AFTD Auto-Formalizing Theoretical Domains

ControlledGame.isReachable_init

theoremverifiedformalizationimported Lean

The initial state is reachable.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} in
theorem ControlledGame.isReachable_init (G : ControlledGame N) : G.IsReachable G.init
Formalizes
EconCSLib, `ControlledGame.isReachable_init`
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 — Lean reports it depends on no axioms
Built on 3
  • ControlledGame.IsReachableA state is reachable in a controlled game if it is reachable from its distinguished initial state.
  • 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 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N : Type*} in
/-- The initial state is reachable. -/
theorem ControlledGame.isReachable_init (G : ControlledGame N) : G.IsReachable G.init :=
  .refl _
See it in the graphDiscuss this resultChallenge it