Theorems · Definition · combinatorics
Multiset.foldl
{α : Type u_1} → {β : Type v} → (f : β → α → β) → [RightCommutative f] → β → Multiset α → βfoldl f H b s is the lift of the list operation foldl f b l,
which folds f over the multiset. It is well defined when f is right-commutative,
that is, f (f b a₁) a₂ = f (f b a₂) a₁.
- Defined in
- Mathlib.Data.Multiset.MapFold
- Cited by
- 13 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext
- Assumes
- RightCommutative
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites3
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
- RightCommutativestatement and proof · cited by 17
- List.Perm.foldl_eqproof · cited by 1
Cited by14
Results whose statement or proof uses this declaration.
- Multiset.foldr_swapstatement · cited by 3
- Multiset.fold_eq_foldlstatement · cited by 1
- Multiset.foldl.congr_simpstatement and proof · cited by 1
- Multiset.foldl_consstatement · cited by 1
- Multiset.foldl_induction'statement · cited by 1
- Multiset.foldl_swapstatement · cited by 1
- Multiset.prod_eq_foldlstatement and proof · cited by 0
- Multiset.foldl_addstatement · cited by 0
- Multiset.foldl_inductionstatement · cited by 0
- Multiset.foldl_zerostatement · cited by 0
- Multiset.sum_eq_foldlstatement and proof · cited by 0
- Finmap.foldlproof · cited by 0