AFTD Auto-Formalizing Theoretical Domains

ControlledGame.IsReachable

defimported Lean

A state is reachable in a controlled game if it is reachable from its distinguished initial state.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} in
def ControlledGame.IsReachable (G : ControlledGame N) (state : G.State) : Prop
Defined in
EconCSLib, `ControlledGame.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 3
  • 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.
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds only a distinguished initial state and a mover label to the pure…
Used by 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} in
/-- A state is reachable in a controlled game if it is reachable from its distinguished initial state. -/
def ControlledGame.IsReachable (G : ControlledGame N) (state : G.State) : Prop :=
  G.toArena.Reachable G.init state
See it in the graphDiscuss this resultChallenge it