ExtensiveGame.IsReachable.next
theoremverifiedformalizationimported Lean
If s is reachable and we take action a, then next s a is reachable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} {U : Type*} in theorem ExtensiveGame.IsReachable.next {G : ExtensiveGame N U} {s : G.State} (h : G.IsReachable s) (a : G.Action s) : G.IsReachable (G.next s a)
- Formalizes
- EconCSLib, `ExtensiveGame.IsReachable.next`
- Lean proof
- By Lazyfill (from the file's git history), from github.com/gametheoryinlean/EconCSLib at
1a88f809b538(Copyright (c) 2026 EconCSLib contributors. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.30.0.ExtensiveGame.IsReachable.next← ExtensiveGame.IsReachable.next (EconCSLib/GameTheory/ExtensiveGame/Execution/Reachability.lean:46): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 5
- ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
- Arena.Reachable.step'Taking one legal action extends a reachable path.
- ControlledGameA payoff-free controlled extensive-game skeleton.
ControlledGameadds only a distinguished initial state and a mover label to the pure… - ExtensiveGame.IsReachableA state is reachable in the game if it is reachable from
init. - ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. *
mover s= who controls…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} {U : Type*} in /-- If `s` is reachable and we take action `a`, then `next s a` is reachable. -/ theorem ExtensiveGame.IsReachable.next {G : ExtensiveGame N U} {s : G.State} (h : G.IsReachable s) (a : G.Action s) : G.IsReachable (G.next s a) := h.step' a