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

Proof of `Nested fixed-point equations for finite parity games` (1st statement)

groundedproofs/Lax369799Proofs/ParityGameEquations.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

Induct on the priority cutoff. The zero case consists only of absorbing positions. The induction step is the proved one-priority elimination theorem, with a boundary valuation updated at that priority.