Mathlib Map

Theorems · Theorem · combinatorics

Multiset.count_cons

∀ {α : Type u_1} [inst : DecidableEq α] (a b : α) (s : Multiset α),
  Multiset.count a (b ::ₘ s) = Multiset.count a s + if a = b then 1 else 0
Defined in
Mathlib.Data.Multiset.Count
Cited by
1 results in Mathlib
Foundations
Depth 18 from the axioms · uses propext, Quot.sound
Assumes
DecidableEq
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Multiset.count_singleton · cited by 10Multiset.count_singletonMultiset · cited by 2627MultisetMultiset.cons · cited by 313Multiset.consMultiset.count · cited by 302Multiset.countMultiset.countP_cons · cited by 3Multiset.countP_consMultiset.count_consCITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by1

Results whose statement or proof uses this declaration.