AFTD Auto-Formalizing Theoretical Domains

Arena.Reachable.trans

theoremverifiedformalizationimported Lean

Reachability is transitive.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
theorem Arena.Reachable.trans {A : Arena} {s t u : A.State}
    (h₁ : A.Reachable s t) (h₂ : A.Reachable t u) :
    A.Reachable s u
Formalizes
EconCSLib, `Arena.Reachable.trans`
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 2
  • 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.
Used by 56

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true in/-- Reachability is transitive. -/theorem Arena.Reachable.trans {A : Arena} {s t u : A.State}    (h₁ : A.Reachable s t) (h₂ : A.Reachable t u) :    A.Reachable s u := by  induction h₁ with  | refl => exact h₂  | step action _ ih => exact .step action (ih h₂)
See it in the graphDiscuss this resultChallenge it