AFTD Auto-Formalizing Theoretical Domains

GameTree.Subtree.tail_mem

theoremverifiedformalizationimported Lean

Any tail member of a Node is a subtree of the node.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
theorem GameTree.Subtree.tail_mem (m : N) (h : GameTree N U) (t : List (GameTree N U))
    {c : GameTree N U} (hmem : c ∈ t) : Subtree c (Node m h t)
Formalizes
EconCSLib, `GameTree.Subtree.tail_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
none — Lean reports it depends on no axioms
Built on 2
  • GameTree.SubtreeSubtree s g — s occurs as a subtree of g.
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
Used by 1

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} in
/-- Any tail member of a `Node` is a subtree of the node. -/
theorem GameTree.Subtree.tail_mem (m : N) (h : GameTree N U) (t : List (GameTree N U))
    {c : GameTree N U} (hmem : c ∈ t) : Subtree c (Node m h t) :=
  Subtree.inTail c m h t hmem (Subtree.refl c)
See it in the graphDiscuss this resultChallenge it