AFTD Auto-Formalizing Theoretical Domains

GameTree.children_node_ne_nil

theoremverifiedformalizationimported Lean

Children of a Node are never empty.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
theorem GameTree.children_node_ne_nil (m : N) (h : GameTree N U) (t : List (GameTree N U)) :
    children (Node m h t) ≠ []
Formalizes
EconCSLib, `GameTree.children_node_ne_nil`
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
propext
Built on 2
  • GameTree.childrenThe full child list at a Node, as a guaranteed non-empty list.
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N U : Type*} in/-- Children of a `Node` are never empty. -/theorem GameTree.children_node_ne_nil (m : N) (h : GameTree N U) (t : List (GameTree N U)) :    children (Node m h t) ≠ [] := by  simp [children]
See it in the graphDiscuss this resultChallenge it