Theorems · Theorem · order theory
Multiset.count_inter
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (s t : Multiset α),
Multiset.count a (s ∩ t) = min (Multiset.count a s) (Multiset.count a t)- Defined in
- Mathlib.Data.Multiset.UnionInter
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 62 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.
Cites5
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
- Multiset.count_addproof · cited by 23
- Multiset.count_subproof · cited by 12
- Multiset.sub_add_interproof · cited by 3
Cited by9
Results whose statement or proof uses this declaration.
- Multiset.add_eq_union_iff_disjointproof · cited by 6
- Ideal.sup_eq_prod_inf_factorsproof · cited by 3
- Multiset.toDFinsupp_interproof · cited by 2
- Multiset.replicate_interproof · cited by 2
- IsDedekindDomain.HeightOneSpectrum.multiplicity_supproof · cited by 1
- Multiset.inter_add_sub_of_add_eq_addproof · cited by 1
- Multiset.coe_interproof · cited by 0
- Finsupp.toMultiset_infproof · cited by 0
- Multiset.toFinsupp_interproof · cited by 0