Proof of `Algebraic transition tables for unfold-automata`
groundedproofs/Lax369799Proofs/AlgebraicTransitions.lean · lax-369799
What this proof establishes
no assumptions
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
Choose the deterministic witness supplied by the automaton property. Express it as a parallel family of unary values and enumerate these values as finite edge types. The original inequalities give transition membership and acceptance preservation.