Proof of `Testing infinite runs on finite branch graphs` (2nd statement)
groundedproofs/Lax369799Proofs/RegularBranchWords.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
Present every ultimately periodic branch by its finite graph, then apply the periodic branch test for the parity condition.