Proof of `Accepting runs and modal game plays` (2nd statement)
groundedproofs/Lax369799Proofs/AutomatonRunGame.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
An opposing positional strategy selects a branch of the run. A first leaf contradicts finite-branch acceptance; without a leaf, the selected infinite branch contradicts the opposing strategy's parity guarantee.