Theorems · Theorem · combinatorics
Multiset.count_replicate
∀ {α : Type u_1} [inst : DecidableEq α] (a b : α) (n : ℕ),
Multiset.count a (Multiset.replicate n b) = if b = a then n else 0- Defined in
- Mathlib.Data.Multiset.Replicate
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Multisetproof · cited by 2,627
- Multiset.countstatement and proof · cited by 302
- Multiset.replicatestatement and proof · cited by 88
- Multiset.coe_countproof · cited by 23
- Multiset.coe_replicateproof · cited by 4
Cited by6
Results whose statement or proof uses this declaration.
- Nat.uniformBell_eqproof · cited by 5
- Multiset.replicate_interproof · cited by 2
- spectralNorm.spectralNorm_pow_natDegree_eq_prod_rootsproof · cited by 1
- Sym.fill_filterNeproof · cited by 1
- NumberField.count_multisetInfinitePlace_eq_multproof · cited by 1
- Multiset.toDFinsupp_replicateproof · cited by 1