GameTree.Subtree.trans
theoremverifiedformalizationimported Lean
The subtree relation is transitive. In game-theoretic terms, a subgame of a subgame is also a subgame of the original game.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {N U : Type*} in theorem GameTree.Subtree.trans {r s g : GameTree N U} (hrs : Subtree r s) (hsg : Subtree s g) : Subtree r g
- Formalizes
- EconCSLib, `GameTree.Subtree.trans`
- 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.trans← GameTree.Subtree.trans (EconCSLib/GameTheory/ExtensiveGame/GameTree.lean:154): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none — Lean reports it depends on no axioms
- Built on 2
- GameTree.Subtree
Subtree s g—soccurs as a subtree ofg. - GameTreeA finite extensive-form game of perfect information, without chance. *
Leaf payoff— a terminal state with a payoff vectorN → U. *…
- 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/-- The subtree relation is transitive. In game-theoretic terms, a subgame of a subgame is also a subgame of the original game. -/theorem GameTree.Subtree.trans {r s g : GameTree N U} (hrs : Subtree r s) (hsg : Subtree s g) : Subtree r g := by induction hsg with | refl => exact hrs | inHead m h t _ ih => exact Subtree.inHead r m h t ih | inTail m h t hmem _ ih => exact Subtree.inTail r m h t hmem ih