Theorems · Definition · combinatorics
Multiset.pi
{α : Type u_1} →
[DecidableEq α] →
{β : α → Type u_2} → (m : Multiset α) → ((a : α) → Multiset (β a)) → Multiset ((a : α) → a ∈ m → β a)pi m t constructs the Cartesian product over t indexed by m.
- Defined in
- Mathlib.Data.Multiset.Pi
- Cited by
- 9 results in Mathlib
- Foundations
- Depth 60 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.
Cites6
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.mapproof · cited by 876
- Multiset.bindproof · cited by 59
- Multiset.Pi.consproof · cited by 14
- Multiset.Pi.emptyproof · cited by 5
- Multiset.recOnproof · cited by 4
Cited by11
Results whose statement or proof uses this declaration.
- Finset.piproof · cited by 23
- MultilinearMap.dfinsuppFamilyproof · cited by 13
- Multiset.pi_consstatement · cited by 5
- Multiset.mem_pistatement and proof · cited by 2
- Multiset.card_pistatement and proof · cited by 1
- Multiset.pi_coestatement and proof · cited by 1
- Finset.pi_insertproof · cited by 1
- Multiset.pi_zerostatement · cited by 0
- Multiset.Nodup.pistatement and proof · cited by 0
- MultilinearMap.dfinsuppFamily_apply_support'statement · cited by 0
- Finset.pi_valstatement · cited by 0