AFTD Auto-Formalizing Theoretical Domains

Arena.finalState_succ

theoremverifiedformalizationimported Lean

Arena.finalState_succ

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable (A : Arena) in
theorem Arena.finalState_succ (choose : (s : A.State) → A.Action s) (s : A.State) (n : ℕ) :
    A.finalState choose s (n + 1) = A.finalState choose (A.next s (choose s)) n
Formalizes
EconCSLib, `Arena.finalState_succ`
Lean proof
By xbei (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.finalStateThe final state after at most fuel steps.

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable (A : Arena) in
theorem Arena.finalState_succ (choose : (s : A.State) → A.Action s) (s : A.State) (n : ℕ) :
    A.finalState choose s (n + 1) = A.finalState choose (A.next s (choose s)) n := rfl
See it in the graphDiscuss this resultChallenge it