Theorems · Theorem · combinatorics
Multiset.ndinsert_le
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s t : Multiset α}, Multiset.ndinsert a s ≤ t ↔ s ≤ t ∧ a ∈ t- Defined in
- Mathlib.Data.Multiset.FinsetOps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 27 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.
Cites12
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.consproof · cited by 313
- Multiset.cons_eraseproof · cited by 25
- Multiset.ndinsertstatement and proof · cited by 24
- Multiset.mem_of_leproof · cited by 17
- Multiset.ndinsert_of_notMemproof · cited by 8
- Multiset.cons_le_cons_iffproof · cited by 7
- Multiset.ndinsert_of_memproof · cited by 5
- Multiset.le_cons_of_notMemproof · cited by 4
- Multiset.mem_ndinsert_selfproof · cited by 3
- Multiset.le_ndinsert_selfproof · cited by 1
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.