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

Proof of `Syntactic set-algebras and rankwise finiteness` (3rd statement)

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

Acceptance descends through the syntactic equivalence. The quotient map sends disjoint union to meet, while acceptance of a disjoint union is the conjunction of acceptance of its summands. These facts give the filter properties. On deterministic systems acceptance is language membership.