GameTree.size_mem_tail_lt
theoremverifiedformalizationimported Lean
Any tail child is structurally smaller.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} in theorem GameTree.size_mem_tail_lt (m : N) (h : GameTree N U) (t : List (GameTree N U)) {c : GameTree N U} (hmem : c ∈ t) : c.size < (Node m h t).size
- Formalizes
- EconCSLib, `GameTree.size_mem_tail_lt`
- 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.size_mem_tail_lt← GameTree.size_mem_tail_lt (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:92): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- GameTree.size_posSize is always positive.
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.sizeStructural size, used for well-founded recursion.
- GameTree.childrenThe full child list at a
Node, as a guaranteed non-empty list. - GameTree.size_head_ltThe head of a
Node's children is structurally smaller.
- Used by 2
- GameTree.size_mem_children_ltAny child (head or in tail) is structurally smaller than the node.
- GameTree.strong_inductionStrong induction: to prove
motive g, it suffices to handleLeafand, for eachNode, to prove the motive given the motive for…
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 inopen GameTree invariable {N U : Type*} in/-- Any tail child is structurally smaller. -/theorem GameTree.size_mem_tail_lt (m : N) (h : GameTree N U) (t : List (GameTree N U)) {c : GameTree N U} (hmem : c ∈ t) : c.size < (Node m h t).size := by simp only [size] have hsum : c.size ≤ (t.map size).sum := by induction t with | nil => cases hmem | cons x xs ih => rcases List.mem_cons.mp hmem with rfl | hmem' · simp [List.sum_cons] · simp [List.sum_cons] have := ih hmem' omega have : 0 < h.size := size_pos h omega