AFTD Auto-Formalizing Theoretical Domains

GameTree.value_Leaf

theoremverifiedformalizationimported Lean

GameTree.value_Leaf

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in
@[simp]
theorem GameTree.value_Leaf (p : N → U) : value (Leaf p : GameTree N U) = p
Formalizes
EconCSLib, `GameTree.value_Leaf`
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 3
  • GameTree.valueGameTree.value
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • GameTreeA finite extensive-form game of perfect information, without chance. * Leaf payoff — a terminal state with a payoff vector N → U. *…
Used by 51

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [TotalPreorder U] [DecidableLE U] in
@[simp]
theorem GameTree.value_Leaf (p : N → U) : value (Leaf p : GameTree N U) = p := rfl
See it in the graphDiscuss this resultChallenge it