AFTD Auto-Formalizing Theoretical Domains

EconCSLib.StrategicGame.IsDominanceSolvable

defimported Lean

A game is dominance-solvable if IESDS yields a unique surviving profile.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [DecidableEq N] [Preorder U] in
open EconCSLib.StrategicGame in
def EconCSLib.StrategicGame.IsDominanceSolvable (G : EconCSLib.StrategicGame N U) : Prop
Defined in
EconCSLib, `StrategicGame.IsDominanceSolvable`
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.
What was changed in EconCSLib.StrategicGame.IsDominanceSolvable
--- EconCSLib/GameTheory/StrategicGame/IESDS.lean:88 (StrategicGame.IsDominanceSolvable)
+++ as compiled here
@@ -1,3 +1,6 @@
-/-- A game is dominance-solvable if IESDS yields a unique surviving profile. -/
-def IsDominanceSolvable (G : StrategicGame N U) : Prop :=
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+variable {N U : Type*} [DecidableEq N] [Preorder U] in
+open EconCSLib.StrategicGame in
+def EconCSLib.StrategicGame.IsDominanceSolvable (G : EconCSLib.StrategicGame N U) : Prop :=
   ∃! σ : G.Profile, ∀ i, ∀ n, G.Survives n i (σ i)
Verified
08 Oct 2026
Axioms
none listed
Built on 6

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [DecidableEq N] [Preorder U] in
open EconCSLib.StrategicGame in
/-- A game is dominance-solvable if IESDS yields a unique surviving profile. -/
def EconCSLib.StrategicGame.IsDominanceSolvable (G : EconCSLib.StrategicGame N U) : Prop :=
  ∃! σ : G.Profile, ∀ i, ∀ n, G.Survives n i (σ i)
See it in the graphDiscuss this resultChallenge it