Theorems · Theorem · combinatorics
Multiset.ndinsert_of_notMem
∀ {α : Type u_1} [inst : DecidableEq α] {a : α} {s : Multiset α}, a ∉ s → Multiset.ndinsert a s = a ::ₘ s- Defined in
- Mathlib.Data.Multiset.FinsetOps
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 22 from the axioms · uses propext, 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 · cited by 313
- Multiset.ofListproof · cited by 290
- Multiset.ndinsertstatement · cited by 24
Cited by8
Results whose statement or proof uses this declaration.
- Finset.fold_insertproof · cited by 11
- List.toFinset_consproof · cited by 8
- Fintype.univ_Propproof · cited by 3
- Finset.insert_val_of_notMemproof · cited by 3
- Multiset.dedup_consproof · cited by 2
- Multiset.attach_ndinsertproof · cited by 0
- Multiset.ndinsert_leproof · cited by 0
- Multiset.length_ndinsert_of_notMemproof · cited by 0