Proof of `The polynomial hierarchy by alternating Turing machines` (5th statement)
groundedproofs/Lax564036Proofs/Bridge.lean · lax-564036
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The library's theorem, the reductions transported to the concept's problem along the agreement.