Proof of `Regular-tree recognition from unfold-invariant recognition` (2nd statement)
groundedproofs/Lax369799Proofs/Regularization.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
Restrict the recognizing algebra to its generated values and quotient by polynomial acceptance equivalence. Both steps preserve recognition and finite sorts; closed unfolding invariance makes the quotient unfolding-invariant.