Theorems · Theorem · combinatorics
Multiset.count_singleton
∀ {α : Type u_1} [inst : DecidableEq α] (a b : α), Multiset.count a {b} = if a = b then 1 else 0- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 10 results in Mathlib
- Foundations
- Depth 19 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 · cited by 2,627
- Multiset.countstatement · cited by 302
- Multiset.count_consproof · cited by 1
Cited by10
Results whose statement or proof uses this declaration.
- Polynomial.roots_X_sub_Cproof · cited by 14
- Finsupp.count_toMultisetproof · cited by 10
- MvPolynomial.degreeOf_Xproof · cited by 1
- Multiset.sub_singletonproof · cited by 0
- Multiset.toFinset_eq_singleton_iffproof · cited by 0
- Relation.cutExpand_le_invImage_lexproof · cited by 0
- Sym.coe_equivNatSumOfFintype_symm_applyproof · cited by 0
- Finset.map_sym_eq_piAntidiagproof · cited by 0
- Ideal.eq_span_singleton_of_mem_of_notMem_sq_of_notMem_prime_neproof · cited by 0
- Multiset.toFinsupp_singletonproof · cited by 0