AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.reachableSubgameAt_mover

theoremverifiedformalizationimported Lean

ExtensiveGame.reachableSubgameAt_mover

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
@[simp]
theorem ExtensiveGame.reachableSubgameAt_mover (G : ExtensiveGame iota U) (root : G.State)
    (s : (G.reachableSubgameAt root).State) :
    (G.reachableSubgameAt root).mover s = G.mover s.1
Formalizes
EconCSLib, `ExtensiveGame.reachableSubgameAt_mover`
Lean proof
By xbei, 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.
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.ReachableA state t is reachable from s if a finite legal path leads from s to t.
  • ExtensiveGame.reachableSubgameAtThe subgame whose state space is restricted to states reachable from root. The older subgameAt view changes only the initial state.…
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds only a distinguished initial state and a mover label to the pure…
  • ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. * mover s = who controls…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
@[simp]
theorem ExtensiveGame.reachableSubgameAt_mover (G : ExtensiveGame iota U) (root : G.State)
    (s : (G.reachableSubgameAt root).State) :
    (G.reachableSubgameAt root).mover s = G.mover s.1 := rfl
See it in the graphDiscuss this resultChallenge it