Proof of `PTIME at the bottom of the polynomial hierarchy` (1st 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 two classes of level zero are coPTIME and PTIME, equal by a statement of the submission on polynomial time.