Proof of `Eliminating one priority by a fixed point` (1st statement)
groundedproofs/Lax369799Proofs/ParityFixedPoints.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
Repeated phases either visit priority p infinitely often, which is winning when p is even, or eventually remain in a single winning stopped phase. This proves maximality of the winning fixed point.