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

Proof of `Modal equations on input vertices` (2nd statement)

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

Once every word-state priority lies below the cutoff, no position is stopped. The projected equations then give the original winning region.