Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `#DNF is #P-complete, by one call and by subtraction` (2nd statement)

groundedproofs/Lax859101Proofs/Bridge.lean · lax-859101

What this proof establishes

thm✓Lax859101.DnfComplete (2nd statement)

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 is the library's; its hardness is carried from #SAT, by this submission's statement or the one it requires, along the library's reduction.