AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.IsReachable

defimported Lean

A state is reachable in the game if it is reachable from init.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
def ExtensiveGame.IsReachable (G : ExtensiveGame N U) (s : G.State) : Prop
Defined in
EconCSLib, `ExtensiveGame.IsReachable`
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.
Verified
08 Oct 2026
Axioms
none listed
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…
  • 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 3

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} {U : Type*} in
/-- A state is reachable in the game if it is reachable from `init`. -/
def ExtensiveGame.IsReachable (G : ExtensiveGame N U) (s : G.State) : Prop :=
  G.toControlledGame.IsReachable s
See it in the graphDiscuss this resultChallenge it