GameTree.size_head_lt
theoremverifiedformalizationimported Lean
The head of a Node's children is structurally smaller.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in theorem GameTree.size_head_lt (m : N) (h : GameTree N U) (t : List (GameTree N U)) : h.size < (Node m h t).size
- Formalizes
- EconCSLib, `GameTree.size_head_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_head_lt← GameTree.size_head_lt (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:85): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- GameTree.sizeStructural size, used for well-founded recursion.
- GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- Used by 4
- GameTree.size_mem_tail_ltAny tail child is structurally smaller.
- GameTree.size_posSize is always positive.
- 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 invariable {N U : Type*} in/-- The head of a `Node`'s children is structurally smaller. -/theorem GameTree.size_head_lt (m : N) (h : GameTree N U) (t : List (GameTree N U)) : h.size < (Node m h t).size := by simp [size] have : 0 ≤ (t.map size).sum := Nat.zero_le _ omega