Proof of `Language invariance, closure, and syntactic finiteness for supported algebras` (4th statement)
groundedproofs/Lax369799Proofs/SupportedRecognition.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
Relabel a common unfolding by the recognizing letter map. Equal supported evaluations give equal membership in the accepting subset.