GameTree.mem_valueList_iff
theoremverifiedformalizationimported Lean
Membership in valueList via membership in the source list.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in theorem GameTree.mem_valueList_iff {v : N → U} {l : List (GameTree N U)} : v ∈ valueList l ↔ ∃ c ∈ l, value c = v
- Formalizes
- EconCSLib, `GameTree.mem_valueList_iff`
- 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.mem_valueList_iff← GameTree.mem_valueList_iff (EconCSLib/GameTheory/ExtensiveGame/BackwardInduction.lean:81): verbatim
- Verified
- 08 Oct 2026
- Axioms
Quot.soundpropext- Built on 8
- GameTree.value_LeafGameTree.value_Leaf
- GameTree.value_NodeGameTree.value_Node
- GameTree.valueList_eq_map
valueList lis exactlyl.map value. Useful for rewriting. - 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_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
argMaxOn ... ∈ value h :: valueList t, so it equals… - leviCivitaSymbol_permThe Levi-Civita symbol of a permutation
σis the sign ofσ.
- GameTree.value_Node_eq_some_child_valueThe value at a node is itself the value of some child (the argmax). Specifically,
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/-- Membership in `valueList` via membership in the source list. -/theorem GameTree.mem_valueList_iff {v : N → U} {l : List (GameTree N U)} : v ∈ valueList l ↔ ∃ c ∈ l, value c = v := by rw [valueList_eq_map] simp [List.mem_map, eq_comm]