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

Proof of `Accepting runs and modal game plays` (2nd statement)

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

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.