AFTD Auto-Formalizing Theoretical Domains

GameTree.Subtree.child_mem

theoremverifiedformalizationimported Lean

Any child (head or tail) is a subtree.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
theorem GameTree.Subtree.child_mem (m : N) (h : GameTree N U) (t : List (GameTree N U))
    {c : GameTree N U} (hmem : c ∈ h :: t) : Subtree c (Node m h t)
Formalizes
EconCSLib, `GameTree.Subtree.child_mem`
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 4

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N U : Type*} in/-- Any child (head or tail) is a subtree. -/theorem GameTree.Subtree.child_mem (m : N) (h : GameTree N U) (t : List (GameTree N U))    {c : GameTree N U} (hmem : c ∈ h :: t) : Subtree c (Node m h t) := by  rcases List.mem_cons.mp hmem with rfl | hmem'  · exact Subtree.head m c t  · exact Subtree.tail_mem m h t hmem'
See it in the graphDiscuss this resultChallenge it