Proof of `Counting all independent sets and vertex covers is one-call #P-complete` (1st statement)
groundedproofs/Lax859101Proofs/Bridge.lean · lax-859101
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 is the library's; its hardness is carried from #Independent Set, by this submission's statement or the one it requires, along the library's reduction.