Theorems · Theorem · combinatorics
List.Perm.foldl_eq
∀ {α : Type u_1} {β : Type u_2} {f : β → α → β} {l₁ l₂ : List α} [rcomm : RightCommutative f],
l₁.Perm l₂ → ∀ (b : β), List.foldl f b l₁ = List.foldl f b l₂- Defined in
- Mathlib.Data.List.Perm.Basic
- Cited by
- 1 results in Mathlib
- Foundations
- Depth 14 from the axioms · uses propext
- Assumes
- RightCommutative
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.
- RightCommutativestatement and proof · cited by 17
- RightCommutative.right_commproof · cited by 2
Cited by2
Results whose statement or proof uses this declaration.
- Multiset.foldlproof · cited by 13
- List.Perm.foldl_op_eqproof · cited by 0