Theorems · Theorem · order theory
Set.Nonempty.subset_singleton_iff
∀ {α : Type u_1} {s : Set α} {a : α}, s.Nonempty → (s ⊆ {a} ↔ s = {a})- Defined in
- Mathlib.Data.Set.Insert
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 28 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Setstatement and proof · cited by 53,352
- Set.Nonemptystatement and proof · cited by 2,627
- Set.Nonempty.ne_emptyproof · cited by 65
- Set.subset_singleton_iff_eqproof · cited by 10
Cited by5
Results whose statement or proof uses this declaration.
- Set.Nonempty.subset_one_iffproof · cited by 1
- convexHull_eq_singletonproof · cited by 1
- PartialOrder.dirSupClosed_singletonproof · cited by 1
- Set.Nonempty.subset_zero_iffproof · cited by 1
- Convexity.convexHull_eq_singletonproof · cited by 0