Proof of `Modal equations on input vertices` (2nd statement)
groundedproofs/Lax369799Proofs/ModalGameEquations.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
Once every word-state priority lies below the cutoff, no position is stopped. The projected equations then give the original winning region.