Proof of `The algebraic condition on infinite branch words` (2nd statement)
groundedproofs/Lax369799Proofs/AlgebraicOmegaWords.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
Adjoin an identity to the finite unary semigroup. Nonempty interval products still lie in the unary sort, so the linked-pair omega language is exactly the language recognized by the finite-monoid construction.