Proof of `The FAF verifier as a finite local-test system` (1st statement)
groundedproofs/Lax253009Proofs/FAFLocalTests.lean · lax-253009
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 random-choice numbering is a bijection, and acceptance agrees pointwise.