Theorems · Theorem · combinatorics
Multiset.count_le_of_le
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) {s t : Multiset α}, s ≤ t → Multiset.count a s ≤ Multiset.count a t- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 12 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- Multiset.countstatement · cited by 302
- Multiset.countP_le_of_leproof · cited by 2
Cited by12
Results whose statement or proof uses this declaration.
- Polynomial.norm_coeff_le_choose_mul_mahlerMeasureproof · cited by 3
- Multiset.sub_add_cancelproof · cited by 2
- Multiset.add_sub_assocproof · cited by 1
- Associates.count_le_count_of_factors_leproof · cited by 1
- MvPolynomial.degreeOf_mul_X_selfproof · cited by 1
- Multiset.count_le_count_consproof · cited by 1
- ChevalleyThm.chevalley_mvPolynomialCproof · cited by 1
- MvPolynomial.indicator_mem_restrictDegreeproof · cited by 1
- Multiset.add_sub_cancelproof · cited by 0
- MvPolynomial.degreeOf_mul_C_leproof · cited by 0
- MvPolynomial.degreeOf_mul_leproof · cited by 0
- MvPolynomial.degreeOf_C_mul_leproof · cited by 0