Proof of `The Cook–Levin theorem, by first-order reductions` (2nd statement)
groundedproofs/Lax904597Proofs/Bridge.lean · lax-904597
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 Cook–Levin theorem, as the library states it: membership in NP and cofinal NP-hardness coincide definitionally with the concepts' reading.