AFTD Auto-Formalizing Theoretical Domains

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.
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 vector N → U. *…
Used by 4

Lean source view module on GitHub

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
See it in the graphDiscuss this resultChallenge it