Proof of `Conjunctive query evaluation is NP-complete`
groundedproofs/Lax420092Proofs/Bridge.lean · lax-420092
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
Membership from the library's existential second-order definition of evaluation; hardness from the library's first-order reduction of 3-colorability to evaluation, 3-colorability being NP-hard by the catalog's statement for it. Both are transported along the agreements.