AFTD Auto-Formalizing Theoretical Domains

GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt

theoremverifiedformalizationimported Lean

Root-scoped subgame perfection is equivalent to Nash equilibrium at every subtree of the root. This is the pure finite-tree form of MSZ Definition 7.2.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
theorem GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt
    {σ : Strategy N U} {g : GameTree N U} :
    IsSubgamePerfectOn σ g ↔ ∀ s : GameTree N U, Subtree s g → IsNashAt σ s
Formalizes
EconCSLib, `GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt`
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 13

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
/-- Root-scoped subgame perfection is equivalent to Nash equilibrium at every subtree of the root. This is the pure finite-tree form of MSZ Definition 7.2. -/
theorem GameTree.isSubgamePerfectOn_iff_forall_subtree_isNashAt
    {σ : Strategy N U} {g : GameTree N U} :
    IsSubgamePerfectOn σ g ↔ ∀ s : GameTree N U, Subtree s g → IsNashAt σ s :=
  Iff.rfl
See it in the graphDiscuss this resultChallenge it