Proof of `The finite modal acceptance game` (3rd statement)
groundedproofs/Lax369799Proofs/ModalAcceptanceGame.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
Eve can choose a legal marking all of whose responses meet the target exactly when the target itself satisfies the positive one-step condition.