IndexedLOrder.Finset.eq_of_mem_of_card_one
theoremverifiedformalizationimported Lean
IndexedLOrder.Finset.eq_of_mem_of_card_one
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in variable [DecidableEq T] [DecidableEq I] in open Classical in variable (c : T → I) (σ : Finset T) (C : Finset I) in variable {c σ C} in lemma IndexedLOrder.Finset.eq_of_mem_of_card_one {X : Type*} [DecidableEq X] {s : Finset X} {a : X} (h_mem : a ∈ s) (h_card : s.card = 1) : s = {a}
- Formalizes
- EconCSLib, `IndexedLOrder.Finset.eq_of_mem_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.IndexedLOrder.Finset.eq_of_mem_of_card_one← IndexedLOrder.Finset.eq_of_mem_of_card_one (EconCSLib/Math/FixedPoint/Scarf.lean:1278): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- instFunLikeIndexedLOrderLinearOrderinstFunLikeIndexedLOrderLinearOrder
- IndexedLOrderA family of linear orders on
Tindexed byI. Eachi : Iprovides a linear orderIST i : LinearOrder Ton the typeT. This is the…
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in open Classical in variable {T : Type*} [Inhabited T] in variable {I : Type*} in variable [IST : IndexedLOrder I T] in set_option quotPrecheck false in variable (σ : Finset T) (C : Finset I) in variable [DecidableEq T] [DecidableEq I] in open Classical in variable (c : T → I) (σ : Finset T) (C : Finset I) in variable {c σ C} in lemma IndexedLOrder.Finset.eq_of_mem_of_card_one {X : Type*} [DecidableEq X] {s : Finset X} {a : X} (h_mem : a ∈ s) (h_card : s.card = 1) : s = {a} := Finset.eq_singleton_iff_unique_mem.mpr ⟨h_mem, fun y hy => let ⟨b, hb⟩ := Finset.card_eq_one.mp h_card have h_a_eq_b : a = b := Finset.eq_of_mem_singleton (hb ▸ h_mem) have h_y_eq_b : y = b := Finset.eq_of_mem_singleton (hb ▸ hy) h_y_eq_b.trans h_a_eq_b.symm⟩