Theorems · Theorem · combinatorics
Multiset.count_eq_zero_of_notMem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, a ∉ s → Multiset.count a s = 0- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 27 results in Mathlib
- Foundations
- Depth 20 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.
Cites4
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 and proof · cited by 302
- by_contradictionproof · cited by 42
- Multiset.count_posproof · cited by 12
Cited by27
Results whose statement or proof uses this declaration.
- Polynomial.count_rootsproof · cited by 19
- Multiset.count_nsmulproof · cited by 10
- Multiset.count_map_eq_count'proof · cited by 9
- Nat.uniformBell_eqproof · cited by 5
- Multiset.count_filter_of_negproof · cited by 3
- Multiset.count_sumproof · cited by 3
- UniqueFactorizationMonoid.squarefree_iff_nodup_normalizedFactorsproof · cited by 3
- Multiset.le_card_smul_iff_subsetproof · cited by 2
- Multiset.mulSupport_fun_pow_count_subsetproof · cited by 2
- Multiset.support_fun_nsmul_count_subsetproof · cited by 2
- Sym.count_coe_fill_of_neproof · cited by 2
- Sym.count_coe_fill_self_of_notMemproof · cited by 2