AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame

theoremverifiedformalizationimported Lean

ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
@[simp]
theorem ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame
    {G : ExtensiveGame iota U}
    [(s : G.State) -> Fintype (G.Action s)] {i : iota} {root : G.State}
    [(s : G.State) -> Decidable (Arena.Reachable G.toArena root s)]
    (base : G.BehaviorStrategy i)
    (beta : (G.reachableSubgameAt root).BehaviorStrategy i) :
    (base.liftReachableSubgame beta).restrictReachableSubgame root = beta
Formalizes
EconCSLib, `ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame`
Lean proof
By xbei, Lazyfill (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
Classical.choiceQuot.soundpropext
Built on 13
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {iota U : Type*} in@[simp]theorem ExtensiveGame.BehaviorStrategy.restrictReachableSubgame_liftReachableSubgame    {G : ExtensiveGame iota U}    [(s : G.State) -> Fintype (G.Action s)] {i : iota} {root : G.State}    [(s : G.State) -> Decidable (Arena.Reachable G.toArena root s)]    (base : G.BehaviorStrategy i)    (beta : (G.reachableSubgameAt root).BehaviorStrategy i) :    (base.liftReachableSubgame beta).restrictReachableSubgame root = beta := by  funext s h hnonterminal  cases s with  | mk state hstate =>      simp [restrictReachableSubgame, liftReachableSubgame, hstate]
See it in the graphDiscuss this resultChallenge it