Proof of `Clique, Independent Set and Vertex Cover` (2nd statement)
groundedproofs/Lax799700Proofs/Bridge/CliqueFamily.lean · lax-799700
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 Clique; hardness from the library's reduction out of SAT, which is NP-hard by the NP core’s Cook–Levin theorem. Both are transported to the catalog's problems along the agreements.