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

Proof of `The automaton property of syntactic set-algebras`

groundedproofs/Lax369799Proofs/AutomatonProperty.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.

Read the Lean proof on GitHub

Description

Normalize the planted context, then minimize both its boundary data and unary values. The deterministic Delta witness is below the original letter and remains accepting. Monotonicity and the algebraic normal form transfer acceptance back to the original context.