AFTD Auto-Formalizing Theoretical Domains

GameTree.outcome_Node

theoremverifiedformalizationimported Lean

GameTree.outcome_Node

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} [TotalPreorder U] in
omit [TotalPreorder U] in
@[simp]
theorem GameTree.outcome_Node (σ : Strategy N U) (m : N) (h : GameTree N U)
    (t : List (GameTree N U)) :
    outcome σ (Node m h t) = outcome σ (σ m h t).val
Formalizes
EconCSLib, `GameTree.outcome_Node`
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 10
  • GameTree.outcome_LeafGameTree.outcome_Leaf
  • GameTree.outcomeThe outcome (terminal payoff vector) of playing strategy σ starting from game tree g. Walks down the tree, using σ to pick a child…
  • GameTree.StrategyA pure strategy for the entire game tree: at every possible node context (mover, head, tail), specify one child (bundled with its…
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • GameTree.childrenThe full child list at a Node, as a guaranteed non-empty list.
  • GameTree.value_LeafGameTree.value_Leaf
  • GameTree.value_NodeGameTree.value_Node
  • GameTree.valueList_nilGameTree.valueList_nil
  • GameTree.valueList_consGameTree.valueList_cons
Used by 45

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen GameTree invariable {N U : Type*} [TotalPreorder U] inomit [TotalPreorder U] in@[simp]theorem GameTree.outcome_Node (σ : Strategy N U) (m : N) (h : GameTree N U)    (t : List (GameTree N U)) :    outcome σ (Node m h t) = outcome σ (σ m h t).val := by  rw [outcome]
See it in the graphDiscuss this resultChallenge it