Theorems · Definition · combinatorics
Multiset.pmap
{α : Type u_1} → {β : Type v} → {p : α → Prop} → ((a : α) → p a → β) → (s : Multiset α) → (∀ a ∈ s, p a) → Multiset βLift of the list pmap operation. Map a partial function f over a multiset
s whose elements are all in the domain of f.
- Defined in
- Mathlib.Data.Multiset.Defs
- Cited by
- 16 results in Mathlib
- Foundations
- Depth 17 from the axioms · uses propext, Quot.sound
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.
- Finset.powersetproof · cited by 93
- Finset.powersetCardproof · cited by 60
- Multiset.attachproof · cited by 31
- Finset.attachFinproof · cited by 21
- Associates.factors'proof · cited by 15
- Multiset.pmap_eq_mapstatement · cited by 7
- Multiset.map_pmapstatement · cited by 7
- PrimeMultiset.ofNatMultisetproof · cited by 5
- Multiset.card_pmapstatement · cited by 5
- PrimeMultiset.ofPNatMultisetproof · cited by 4
- Nat.Subtype.exists_succproof · cited by 3
- Multiset.pmap.congr_simpstatement and proof · cited by 2