Proof of `Ultimately periodic witnesses in finite parity graphs` (1st statement)
groundedproofs/Lax369799Proofs/PeriodicPaths.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
An arbitrary path and its periodic witness have the same least recurring priority. Acceptance of every periodic path therefore implies acceptance of every path from the initial vertex.