Proof of `Recurring priorities in finite-state runs` (2nd statement)
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 infinite color class supplies a recurring priority. Choose the least such natural number; every smaller priority has a last occurrence.