Theorems · Theorem · combinatorics
Multiset.le_cons_of_notMem
∀ {α : Type u_1} {s t : Multiset α} {a : α}, a ∉ s → (s ≤ a ::ₘ t ↔ s ≤ t)- Defined in
- Mathlib.Data.Multiset.ZeroCons
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 26 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites8
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
- le_transproof · cited by 985
- Multiset.consstatement and proof · cited by 313
- Multiset.ofListproof · cited by 290
- Multiset.mem_cons_selfproof · cited by 44
- Multiset.leInductionOnproof · cited by 12
- Multiset.cons_le_cons_iffproof · cited by 7
- Multiset.le_cons_selfproof · cited by 5
Cited by4
Results whose statement or proof uses this declaration.
- Multiset.le_interproof · cited by 4
- Multiset.erase_le_iff_le_consproof · cited by 1
- Multiset.cons_le_of_notMemproof · cited by 0
- Multiset.ndinsert_leproof · cited by 0