Theorems · Theorem · combinatorics
Multiset.toFinset_card_le
∀ {α : Type u_1} [inst : DecidableEq α] (m : Multiset α), m.toFinset.card ≤ m.card- Defined in
- Mathlib.Data.Finset.Card
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 73 from the axioms · uses propext, Classical.choice, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetstatement and proof · cited by 2,627
- Finset.cardstatement · cited by 2,327
- Multiset.cardstatement · cited by 375
- Multiset.toFinsetstatement · cited by 230
- Multiset.card_le_cardproof · cited by 11
- Multiset.dedup_leproof · cited by 9
Cited by10
Results whose statement or proof uses this declaration.
- Finset.card_image_leproof · cited by 33
- Polynomial.eq_zero_of_natDegree_lt_card_of_eval_eq_zeroproof · cited by 4
- FiniteField.card_image_polynomial_evalproof · cited by 1
- LieAlgebra.engel_isBot_of_isMinproof · cited by 1
- card_nthRoots_subgroup_unitsproof · cited by 1
- Polynomial.natSepDegree_le_natDegreeproof · cited by 1
- IsPrimitiveRoot.totient_le_degree_minpolyproof · cited by 1
- List.toFinset_card_leproof · cited by 1
- Cubic.card_roots_leproof · cited by 0
- Polynomial.ncard_rootSet_leproof · cited by 0