GameTree.valueList_eq_map
theoremverifiedformalizationimported Lean
valueList l is exactly l.map value. Useful for rewriting.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in theorem GameTree.valueList_eq_map (l : List (GameTree N U)) : valueList l = l.map value
- Formalizes
- EconCSLib, `GameTree.valueList_eq_map`
- 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.GameTree.valueList_eq_map← GameTree.valueList_eq_map (EconCSLib/GameTheory/ExtensiveGame/BackwardInduction.lean:74): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 7
- GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_nilGameTree.valueList_nil
- GameTree.valueList_consGameTree.valueList_cons
- GameTree.valueGameTree.value
- TotalPreorderA total preorder: a preorder where
≤is total (complete). This is weaker thanLinearOrder— it does NOT require antisymmetry or… - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- Used by 2
- GameTree.value_Node_geKey optimality lemma: at a
Node m h t, the moverm's coordinate of the backward-induction value dominates every child's. - GameTree.mem_valueList_iffMembership in
valueListvia membership in the source list.
- GameTree.value_Node_geKey optimality lemma: at a
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N U : Type*} [TotalPreorder U] [DecidableLE U] in/-- `valueList l` is exactly `l.map value`. Useful for rewriting. -/theorem GameTree.valueList_eq_map (l : List (GameTree N U)) : valueList l = l.map value := by induction l with | nil => rfl | cons x xs ih => simp [valueList, ih]