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

Proof of `Language invariance, closure, and syntactic finiteness for supported algebras` (4th statement)

groundedproofs/Lax369799Proofs/SupportedRecognition.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

Relabel a common unfolding by the recognizing letter map. Equal supported evaluations give equal membership in the accepting subset.