Theorems · Theorem · order theory

Multiset.card_uIcc

∀ {α : Type u_1} [inst : DecidableEq α] (s t : Multiset α),
  (Finset.uIcc s t).card = ∏ i ∈ s.toFinset ∪ t.toFinset, ((↑(Multiset.count i t) - ↑(Multiset.count i s)).natAbs + 1)

Defined in

Mathlib.Data.Multiset.Interval

Cited by

0 results in Mathlib

Foundations

Depth 89 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

DecidableEq