Proof of `Regular-tree recognition from unfold-invariant recognition` (1st 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
Substitute a fixed realizing system for each generated value. Unfold-equivalent outer systems have unfold-equivalent flattenings over the original alphabet. Recognition and language invariance transfer membership of the accepting set.