AFTD Auto-Formalizing Theoretical Domains

Arena.Reachable

inductiveimported Lean

A state t is reachable from s if a finite legal path leads from s to t.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
inductive Arena.Reachable (A : Arena) : A.State → A.State → Prop
Defined in
EconCSLib, `Arena.Reachable`
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 1
  • ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
Used by 18

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
/-- A state `t` is reachable from `s` if a finite legal path leads from `s` to `t`. -/
inductive Arena.Reachable (A : Arena) : A.State → A.State → Prop where
  | refl (s : A.State) : A.Reachable s s
  | step {s t : A.State} (a : A.Action s)
      (h : A.Reachable (A.next s a) t) :
      A.Reachable s t
See it in the graphDiscuss this resultChallenge it