Proof of `Hitting Set Is NP-Hard` (4th statement)
groundedproofs/Lax496464Proofs/HittingSet/Hardness.lean · lax-496464
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
Satisfiability is NP-hard by the Cook–Levin theorem; the reduction is correct and runs in polynomial time, and polynomial-time reductions compose.