Theorems · Definition · combinatorics
Multiset.ndinsert
{α : Type u_1} → [DecidableEq α] → α → Multiset α → Multiset αndinsert a s is the lift of the list insert operation. This operation
does not respect multiplicities, unlike cons, but it is suitable as
an insert operation on Finset.
- Defined in
- Mathlib.Data.Multiset.FinsetOps
- Cited by
- 24 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
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.ofListproof · cited by 290
Cited by24
Results whose statement or proof uses this declaration.
- Multiset.ndinsert_of_notMemstatement · cited by 8
- Multiset.ndinsert_of_memstatement · cited by 5
- Multiset.mem_ndinsertstatement · cited by 3
- Multiset.mem_ndinsert_selfstatement · cited by 3
- Multiset.dedup_consstatement · cited by 2
- Multiset.mem_ndinsert_of_memstatement · cited by 2
- Finset.insert_valstatement · cited by 2
- Multiset.Nodup.ndinsertstatement · cited by 1
- Multiset.cons_ndunionstatement · cited by 1
- Multiset.le_ndinsert_selfstatement · cited by 1
- Multiset.disjoint_ndinsert_leftstatement · cited by 1
- Multiset.gcd_ndinsertstatement and proof · cited by 0