Theorems · Theorem · combinatorics
Multiset.count.congr_simp
∀ {α : Type u_1} {inst : DecidableEq α} [inst_1 : DecidableEq α] (a a_1 : α),
a = a_1 → ∀ (a_2 a_3 : Multiset α), a_2 = a_3 → Multiset.count a a_2 = Multiset.count a_1 a_3- Defined in
- Mathlib.Data.Multiset.Count
- Cited by
- 22 results in Mathlib
- Foundations
- Depth 18 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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
Cited by22
Results whose statement or proof uses this declaration.
- Polynomial.count_rootsproof · cited by 19
- Multiset.count_nsmulproof · cited by 10
- MvPolynomial.degreeOf_zeroproof · cited by 7
- Nat.uniformBell_eqproof · cited by 5
- Multiset.count_sumproof · cited by 3
- MvPolynomial.degreeOf_rename_of_injectiveproof · cited by 2
- Ideal.IsDedekindDomain.emultiplicity_map_eq_ramificationIdx'_mulproof · cited by 2
- Multiset.replicate_interproof · cited by 2
- Ideal.count_span_normalizedFactors_eq_of_normUnitproof · cited by 2
- Ideal.map_algebraMap_eq_finsetProd_powproof · cited by 2
- MvPolynomial.mem_restrictDegree_iff_supproof · cited by 1
- MvPolynomial.degreeOf_oneproof · cited by 1