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

Proof of `The finite modal acceptance game` (8th 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

All priorities of the acceptance arena lie below the chosen depth. The finite parity-game equation theorem therefore identifies its winning positions with the nested least and greatest fixed points.