Theorems · Theorem · order theory
Multiset.card_Icc
∀ {α : Type u_1} [inst : DecidableEq α] (s t : Multiset α),
(Finset.Icc s t).card = ∏ i ∈ s.toFinset ∪ t.toFinset, (Multiset.count i t + 1 - Multiset.count i s)- Defined in
- Mathlib.Data.Multiset.Interval
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 87 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.
Cites19
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- DFunLike.coeproof · cited by 62,936
- Finsetstatement · cited by 13,712
- Equiv.symmproof · cited by 3,681
- Multisetstatement and proof · cited by 2,627
- Finset.prodstatement and proof · cited by 2,356
- Finset.cardstatement · cited by 2,327
- Finset.prod_congrproof · cited by 646
- Finset.Iccstatement · cited by 348
- Multiset.countstatement and proof · cited by 302
- Equiv.toEmbeddingproof · cited by 254
- Multiset.toFinsetstatement and proof · cited by 230
- AddEquiv.toEquivproof · cited by 174
Cited by4
Results whose statement or proof uses this declaration.
- Multiset.card_Iocproof · cited by 0
- Multiset.card_Iooproof · cited by 0
- Multiset.card_Icoproof · cited by 0
- Multiset.card_Iicproof · cited by 0