AFTD Auto-Formalizing Theoretical Domains

GameTree.size_mem_children_lt

theoremverifiedformalizationimported Lean

Any child (head or in tail) is structurally smaller than the node.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open GameTree in
variable {N U : Type*} in
theorem GameTree.size_mem_children_lt (m : N) (h : GameTree N U) (t : List (GameTree N U))
    {c : GameTree N U} (hmem : c ∈ children (Node m h t)) :
    c.size < (Node m h t).size
Formalizes
EconCSLib, `GameTree.size_mem_children_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.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 5
  • GameTree.size_mem_tail_ltAny tail child is structurally smaller.
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
  • GameTree.childrenThe full child list at a Node, as a guaranteed non-empty list.
  • GameTree.sizeStructural size, used for well-founded recursion.
  • GameTree.size_head_ltThe head of a Node's children is structurally smaller.
Used by 1
  • GameTree.outcomeThe outcome (terminal payoff vector) of playing strategy σ starting from game tree g. Walks down the tree, using σ to pick a child…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen GameTree invariable {N U : Type*} in/-- Any child (head or in tail) is structurally smaller than the node. -/theorem GameTree.size_mem_children_lt (m : N) (h : GameTree N U) (t : List (GameTree N U))    {c : GameTree N U} (hmem : c ∈ children (Node m h t)) :    c.size < (Node m h t).size := by  simp [children, List.mem_cons] at hmem  rcases hmem with rfl | hmem'  · exact size_head_lt m c t  · exact size_mem_tail_lt m h t hmem'
See it in the graphDiscuss this resultChallenge it