Theorems · Theorem · combinatorics
Finset.eq_univ_of_card
∀ {α : Type u_1} [inst : Fintype α] (s : Finset α), s.card = Fintype.card α → s = Finset.univ- Defined in
- Mathlib.Data.Fintype.Card
- Cited by
- 5 results in Mathlib
- Foundations
- Depth 57 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- Fintype
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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
- Fintypestatement and proof · cited by 7,736
- Finset.univstatement and proof · cited by 3,473
- Finset.cardstatement and proof · cited by 2,327
- le_reflproof · cited by 2,061
- Fintype.cardstatement and proof · cited by 1,386
- Finset.subset_univproof · cited by 60
- Finset.card_univproof · cited by 58
- Finset.eq_of_subset_of_card_leproof · cited by 34
Cited by5
Results whose statement or proof uses this declaration.
- Finset.card_eq_iff_eq_univproof · cited by 6
- FormalMultilinearSeries.comp_coeff_oneproof · cited by 2
- Equiv.Perm.subgroup_eq_top_of_swap_memproof · cited by 1
- IsKleinFour.eq_finset_univproof · cited by 1
- IsAddKleinFour.eq_finset_univproof · cited by 1