Theorems · Theorem · combinatorics
Multiset.cons_le_of_notMem
∀ {α : Type u_1} {s t : Multiset α} {a : α}, a ∉ s → (a ::ₘ s ≤ t ↔ a ∈ t ∧ s ≤ t)- Defined in
- Mathlib.Data.Multiset.ZeroCons
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 27 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
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.mem_cons_selfproof · cited by 44
- Multiset.subset_of_leproof · cited by 27
- Multiset.exists_cons_of_memproof · cited by 15
- Multiset.cons_le_consproof · cited by 6
- Multiset.le_cons_selfproof · cited by 5
- Multiset.le_cons_of_notMemproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.