Proof of `The finite few-amortized-free-bits test` (2nd statement)
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
Consistent satisfying assignments satisfy every side condition, and genuine long codes pass every corresponding CNA test.