AFTD Auto-Formalizing Theoretical Domains

FiniteImperfectGame.subgameAt

defimported Lean

The subgame starting at state s: same finite game data with a different initial state. Extra validity conditions, such as whether s is a legitimate imperfect-information subroot, can be imposed by theorem statements using this operation.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : FiniteImperfectGame N U) in
def FiniteImperfectGame.subgameAt (s : G.State) : FiniteImperfectGame N U
Defined in
EconCSLib, `FiniteImperfectGame.subgameAt`
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 listed
Built on 1
  • FiniteImperfectGameFinite imperfect-information extensive game data. info s = none means the state is not in a strategic information set, typically because…
Used by 2

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} (G : FiniteImperfectGame N U) in
/-- The subgame starting at state `s`: same finite game data with a different initial state. Extra validity conditions, such as whether `s` is a legitimate imperfect-information subroot, can be imposed by theorem statements using this operation. -/
def FiniteImperfectGame.subgameAt (s : G.State) : FiniteImperfectGame N U :=
  { G with init := s }
See it in the graphDiscuss this resultChallenge it