Proof of `The finite few-amortized-free-bits test` (1st 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
Outside the union of CNA decoding failures, each accepting table has a decoded assignment satisfying its side condition. Their projections agree on all reference functions, so the many-table agreement bound applies.