AFTD Auto-Formalizing Theoretical Domains

MinimaxLoomis.singleton_of_card_one

theoremverifiedformalizationimported Lean

When the row index type has cardinality 1, every simplex point is the unique pure strategy and Finset.univ is a singleton.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
open Finset BigOperators in
set_option linter.unusedSectionVars false in
variable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in
theorem MinimaxLoomis.singleton_of_card_one {K : Type*} [Fintype K] [DecidableEq K]
    (H : Fintype.card K = 1) :
    ∃ a : K, (Finset.univ : Finset K) = {a}
Formalizes
EconCSLib, `MinimaxLoomis.singleton_of_card_one`
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
Classical.choiceQuot.soundpropext
Used by 1
  • Loomis.loomis_value_IJ_2Base case of the Loomis induction: a 1×1 matrix pair has the single ratio A i₀ j₀ / B i₀ j₀ as the common Loomis value.

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true inopen Finset BigOperators inset_option linter.unusedSectionVars false invariable {I J : Type*} [Fintype I] [Fintype J] [Nonempty I] [Nonempty J] in/-- When the row index type has cardinality 1, every simplex point is the unique pure strategy and `Finset.univ` is a singleton. -/theorem MinimaxLoomis.singleton_of_card_one {K : Type*} [Fintype K] [DecidableEq K]    (H : Fintype.card K = 1) :    ∃ a : K, (Finset.univ : Finset K) = {a} := by  obtain ⟨a, ha⟩ := Fintype.card_eq_one_iff.1 H  exact ⟨a, by ext; simp [ha]⟩
See it in the graphDiscuss this resultChallenge it