AFTD Auto-Formalizing Theoretical Domains

IsStrictlyDominant.isWeaklyDominant

theoremverifiedformalizationimported Lean

A strictly dominant strategy is weakly dominant.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {N U : Type*} [DecidableEq N] [Preorder U] in
open EconCSLib.StrategicGame in
theorem IsStrictlyDominant.isWeaklyDominant {G : EconCSLib.StrategicGame N U} {i : N} {s : G.strategy i}
    [DecidableEq (G.strategy i)]
    (h : IsStrictlyDominant G i s) : IsWeaklyDominant G i s
Formalizes
EconCSLib, `IsStrictlyDominant.isWeaklyDominant`
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 IsStrictlyDominant.isWeaklyDominant
--- EconCSLib/GameTheory/StrategicGame/Dominance.lean:50 (IsStrictlyDominant.isWeaklyDominant)
+++ as compiled here
@@ -1,3 +1,6 @@
-/-- A strictly dominant strategy is weakly dominant. -/
-theorem IsStrictlyDominant.isWeaklyDominant {G : StrategicGame N U} {i : N} {s : G.strategy i}
+set_option autoImplicit true in
+set_option relaxedAutoImplicit true in
+variable {N U : Type*} [DecidableEq N] [Preorder U] in
+open EconCSLib.StrategicGame in
+theorem IsStrictlyDominant.isWeaklyDominant {G : EconCSLib.StrategicGame N U} {i : N} {s : G.strategy i}
     [DecidableEq (G.strategy i)]
Verified
08 Oct 2026
Axioms
none — Lean reports it depends on no axioms
Built on 10

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {N U : Type*} [DecidableEq N] [Preorder U] inopen EconCSLib.StrategicGame in/-- A strictly dominant strategy is weakly dominant. -/theorem IsStrictlyDominant.isWeaklyDominant {G : EconCSLib.StrategicGame N U} {i : N} {s : G.strategy i}    [DecidableEq (G.strategy i)]    (h : IsStrictlyDominant G i s) : IsWeaklyDominant G i s := by  intro s'  by_cases heq : s = s'  · subst heq; intro σ; exact le_refl _  · exact (h s' heq).weakly
See it in the graphDiscuss this resultChallenge it