Proof of `The Cook–Levin theorem, in its machine form` (1st 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
NP is the class of problems reducing to machine acceptance, from the library.