Proof of `Wide machines are complete for NEXPTIME and EXPSPACE` (1st statement)
groundedproofs/Lax822549Proofs/Bridge.lean · lax-822549
What this proof establishes
no assumptions
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, transported to the concept's problem along the agreement.