AFTD Auto-Formalizing Theoretical Domains

GameTree.IsSubgamePerfect.toSubgamePerfectOn

theoremverifiedformalizationimported Lean

A global subgame-perfect equilibrium is subgame-perfect on every fixed root.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
theorem GameTree.IsSubgamePerfect.toSubgamePerfectOn {σ : Strategy N U}
    (hspe : IsSubgamePerfect σ) (g : GameTree N U) :
    IsSubgamePerfectOn σ g
Formalizes
EconCSLib, `GameTree.IsSubgamePerfect.toSubgamePerfectOn`
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
Classical.choiceQuot.soundpropext
Built on 14
Used by 1
  • GameTree.Kuhn_exists_SPE_onKuhn's theorem, root-scoped SPE form: every finite perfect-information game without chance has a pure strategy that is subgame-perfect…

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
/-- A global subgame-perfect equilibrium is subgame-perfect on every fixed root. -/
theorem GameTree.IsSubgamePerfect.toSubgamePerfectOn {σ : Strategy N U}
    (hspe : IsSubgamePerfect σ) (g : GameTree N U) :
    IsSubgamePerfectOn σ g :=
  fun s _ i σ' hiv => hspe s i σ' hiv
See it in the graphDiscuss this resultChallenge it