Proof of `NP is a complexity class` (7th 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
Second-order definability pulls back along first-order reductions.