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

Proof of `Language invariance, closure, and syntactic finiteness for supported algebras` (6th 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

Complete the finite supported recognizer and apply the proved bounded profile refinement for the unpruned contextual quotient.