Theorems · Theorem · order theory
Multiset.card_Ico
∀ {α : Type u_1} [inst : DecidableEq α] (s t : Multiset α),
(Finset.Ico s t).card = ∏ i ∈ s.toFinset ∪ t.toFinset, (Multiset.count i t + 1 - Multiset.count i s) - 1- Defined in
- Mathlib.Data.Multiset.Interval
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 88 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.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Finsetstatement · cited by 13,712
- Multisetstatement and proof · cited by 2,627
- Finset.prodstatement and proof · cited by 2,356
- Finset.cardstatement · cited by 2,327
- Finset.Icostatement · cited by 450
- Multiset.countstatement and proof · cited by 302
- Multiset.toFinsetstatement and proof · cited by 230
- Finset.card_Ico_eq_card_Icc_sub_oneproof · cited by 8
- Multiset.card_Iccproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.