Proof of `Ordered syntactic algebras of finite presentations` (3rd statement)
groundedproofs/Lax369799Proofs/FiniteOrderedAlgebra.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
Construct the contextual substitution algebra and its recognizing subset. On reachable deterministic systems, universal yield acceptance is exactly membership in the unfolding-invariant language.