Theorems · Theorem · combinatorics
Multiset.cons_sub_of_le
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) {s t : Multiset α}, t ≤ s → a ::ₘ s - t = a ::ₘ (s - t)- Defined in
- Mathlib.Data.Multiset.AddSub
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 53 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.consstatement and proof · cited by 313
- Multiset.singleton_addproof · cited by 13
- Multiset.add_sub_assocproof · cited by 1
Cited by1
Results whose statement or proof uses this declaration.
- Multiset.antidiagonal_eq_map_powersetproof · cited by 1