GameTree.size_pos
theoremverifiedformalizationimported Lean
Size is always positive.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open GameTree in variable {N U : Type*} in theorem GameTree.size_pos (g : GameTree N U) : 0 < g.size
- Formalizes
- EconCSLib, `GameTree.size_pos`
- 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_pos← GameTree.size_pos (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:79): adapted
What was changed in
GameTree.size_pos--- EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:79 (GameTree.size_pos) +++ as compiled here @@ -1,5 +1,8 @@ -/-- Size is always positive. -/ -theorem size_pos (g : GameTree N U) : 0 < g.size := by +set_option autoImplicit true in +set_option relaxedAutoImplicit true in +open GameTree in +variable {N U : Type*} in +theorem GameTree.size_pos (g : GameTree N U) : 0 < g.size := by cases g with | Leaf _ => simp [size] - | Node _ _ _ => simp [size]; omega + | Node _ _ _ => simp [size] <;> omega - Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- 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. - ZeroSumChance.GameTree.size_posEvery game tree has positive size.
- GameTree.size_head_ltThe head of a
Node's children is structurally smaller.
- GameTreeA finite extensive-form game of perfect information, without chance. *
- Used by 2
- GameTree.size_mem_tail_ltAny tail child is structurally smaller.
- 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/-- Size is always positive. -/theorem GameTree.size_pos (g : GameTree N U) : 0 < g.size := by cases g with | Leaf _ => simp [size] | Node _ _ _ => simp [size] <;> omega