Theorems · Theorem · combinatorics
Multiset.mem_sub
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s t : Multiset α}, a ∈ s - t ↔ Multiset.count a t < Multiset.count a s- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 26 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.
Cites4
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_posproof · cited by 12
- Multiset.count_subproof · cited by 12
Cited by1
Results whose statement or proof uses this declaration.
- Multiset.IsDershowitzMannaLT.transproof · cited by 0