ControlledGame.IsReachable.next
theoremverifiedformalizationimported Lean
A legal successor of a reachable state is reachable.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} in theorem ControlledGame.IsReachable.next {G : ControlledGame N} {state : G.State} (h : G.IsReachable state) (action : G.Action state) : G.IsReachable (G.next state action)
- Formalizes
- EconCSLib, `ControlledGame.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.ControlledGame.IsReachable.next← ControlledGame.IsReachable.next (EconCSLib/GameTheory/ExtensiveGame/Structural/Reachability.lean:65): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 4
- ControlledGame.IsReachableA state is reachable in a controlled game if it is reachable from its distinguished initial state.
- 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…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N : Type*} in /-- A legal successor of a reachable state is reachable. -/ theorem ControlledGame.IsReachable.next {G : ControlledGame N} {state : G.State} (h : G.IsReachable state) (action : G.Action state) : G.IsReachable (G.next state action) := h.step' action