AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.subgameAt_payoff

theoremverifiedformalizationimported Lean

ExtensiveGame.subgameAt_payoff

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
@[simp]
theorem ExtensiveGame.subgameAt_payoff (G : ExtensiveGame iota U) (s t : G.State) (i : iota) :
    (G.subgameAt s).payoff t i = G.payoff t i
Formalizes
EconCSLib, `ExtensiveGame.subgameAt_payoff`
Lean proof
By xbei, 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 4
  • ArenaA game arena: the pure dynamics of an extensive-form game. States, actions, and transitions are stored without players, payoffs, or…
  • ExtensiveGame.subgameAtThe subgame starting at state s: same arena, different starting point.
  • ControlledGameA payoff-free controlled extensive-game skeleton. ControlledGame adds only a distinguished initial state and a mover label to the pure…
  • ExtensiveGameA state-payoff extensive game: a payoff-free controlled game together with a convenient endpoint-state payoff. * mover s = who controls…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
@[simp]
theorem ExtensiveGame.subgameAt_payoff (G : ExtensiveGame iota U) (s t : G.State) (i : iota) :
    (G.subgameAt s).payoff t i = G.payoff t i := rfl
See it in the graphDiscuss this resultChallenge it