Proof of `Clique, Independent Set and Vertex Cover` (7th 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.

Read the Lean proof on GitHub

Description

Membership from the library's reduction of IndependentSet to Clique, which is in NP; hardness from the library's reduction out of Clique, which is NP-hard by the catalog’s statement for it. Both are transported to the catalog's problems along the agreements.