Proof of `Automaton property of the unpruned syntactic algebra` (2nd 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
Recognition of an unfold-invariant language gives finite contextual sorts. Apply the extremal-context argument to the unary sort of this quotient.