Proof of `Automaton property of the unpruned syntactic algebra` (1st statement)
groundedproofs/Lax369799Proofs/FiniteAutomatonProperty.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
Normalize and plant the accepting context, then minimize its boundary and unary data. Delta is deterministic, below the original value, and accepted in the extremal normal context. Monotonicity, the normal-form equation, and planting invariance return acceptance to the original context.