While this submission is a draft, it cannot be used by other submissions.

Proof of `Automaton property of the unpruned syntactic algebra` (1st statement)

groundedproofs/Lax369799Proofs/FiniteAutomatonProperty.lean · lax-369799

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.

Read the Lean proof on GitHub

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.