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

Proof of `Automaton property of the unpruned syntactic algebra` (2nd 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

Recognition of an unfold-invariant language gives finite contextual sorts. Apply the extremal-context argument to the unary sort of this quotient.