Theorems · Theorem · combinatorics
Multiset.attach_ndinsert
∀ {α : Type u_1} [inst : DecidableEq α] (a : α) (s : Multiset α),
(Multiset.ndinsert a s).attach = Multiset.ndinsert ⟨a, ⋯⟩ (Multiset.map (fun p => ⟨↑p, ⋯⟩) s.attach)- Defined in
- Mathlib.Data.Multiset.FinsetOps
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 25 from the axioms · uses propext, Quot.sound
- Assumes
- DecidableEq
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites14
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.mapstatement and proof · cited by 876
- Multiset.consproof · cited by 313
- Multiset.mem_cons_selfproof · cited by 44
- Multiset.mem_cons_of_memproof · cited by 35
- Multiset.attachstatement and proof · cited by 31
- Multiset.ndinsertstatement and proof · cited by 24
- Multiset.map_idproof · cited by 20
- Multiset.ndinsert_of_notMemproof · cited by 8
- Multiset.ndinsert_of_memproof · cited by 5
- Multiset.mem_attachproof · cited by 3
- Multiset.mem_ndinsert_selfstatement and proof · cited by 3
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.