Proof of `The algebraic condition on infinite branch words` (1st 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
Thin the factorization to a recurrent graph vertex. Nonempty monoid products are still unary values, so thinning preserves the original accepting linked pair.