Theorems · Theorem · combinatorics
Finset.eq_singleton_iff_unique_mem
∀ {α : Type u_1} {s : Finset α} {a : α}, s = {a} ↔ a ∈ s ∧ ∀ x ∈ s, x = a- Defined in
- Mathlib.Data.Finset.Insert
- Cited by
- 7 results in Mathlib
- Foundations
- Depth 56 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites1
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement and proof · cited by 13,712
Cited by7
Results whose statement or proof uses this declaration.
- IsPrimitiveRoot.primitiveRoots_oneproof · cited by 2
- Choose.primeFactors_gcd_choose_of_isPrimePowproof · cited by 1
- Polynomial.eq_X_sub_C_of_separable_of_root_eqproof · cited by 1
- Finset.Colex.toColex_lt_singletonproof · cited by 0
- cauchy_davenport_add_of_linearOrder_isCancelAddproof · cited by 0
- cauchy_davenport_mul_of_linearOrder_isCancelMulproof · cited by 0
- Finset.sym_singletonproof · cited by 0