AFTD Auto-Formalizing Theoretical Domains

ExtensiveGame.reachableSubgameAt_isEmpty_decidable

instanceimported Lean

ExtensiveGame.reachableSubgameAt_isEmpty_decidable

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
instance ExtensiveGame.reachableSubgameAt_isEmpty_decidable (G : ExtensiveGame iota U)
    (root : G.State)
    [inst : (s : G.State) -> Decidable (IsEmpty (G.Action s))] :
    (s : (G.reachableSubgameAt root).State) ->
      Decidable (IsEmpty ((G.reachableSubgameAt root).Action s))
Defined in
EconCSLib, `ExtensiveGame.reachableSubgameAt_isEmpty_decidable`
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
none listed
Built on 8
Used by 34

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {iota U : Type*} in
instance ExtensiveGame.reachableSubgameAt_isEmpty_decidable (G : ExtensiveGame iota U)
    (root : G.State)
    [inst : (s : G.State) -> Decidable (IsEmpty (G.Action s))] :
    (s : (G.reachableSubgameAt root).State) ->
      Decidable (IsEmpty ((G.reachableSubgameAt root).Action s)) :=
  fun s => inst s.1
See it in the graphDiscuss this resultChallenge it