Proof of `Conjunctive query containment 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 along the reduction to evaluation and hardness along the reduction from evaluation, both of this submission, evaluation being NP-complete by this submission's statement.