Proof of `#P by counting the accepting runs of a Turing machine` (1st statement)
groundedproofs/Lax366625Proofs/Bridge.lean · lax-366625
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
The library's theorem, the reductions transported to the concept's problem along the agreement.