While this submission is a draft, it cannot be used by other submissions.

Proof of `The finite modal acceptance game` (5th statement)

groundedproofs/Lax369799Proofs/ModalAcceptanceGame.lean · lax-369799

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Subtraction from an even ceiling preserves parity and reverses the order of recurrent priorities. Every priority lies strictly below the ceiling.