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.GameTree.Subtree.child_mem← GameTree.Subtree.child_mem (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:146): verbatim
- Verified
- 08 Oct 2026
- Axioms
propext- Built on 4
- GameTree.Subtree
Subtree s g—soccurs as a subtree ofg. - GameTree.Subtree.tail_memAny tail member of a
Nodeis a subtree of the node. - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *… - GameTree.Subtree.headThe head of a
Nodeis a subtree of the node.
- GameTree.Subtree
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 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'