Theorems · Theorem · combinatorics
List.foldr_cons_eq_foldr_apply
∀ {α : Type u_1} {β : Type u_2} {l : List α} {f : α → β → β} {a : α} {b : β} [hf : LeftCommutative f],
List.foldr f b (a :: l) = List.foldr f (f a b) l- Defined in
- Mathlib.Data.List.Fold
- Cited by
- 2 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses propext
- Assumes
- LeftCommutative
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.
- LeftCommutativestatement and proof · cited by 20
- LeftCommutative.left_commproof · cited by 3
Cited by2
Results whose statement or proof uses this declaration.
- List.foldr_eq_of_comm'proof · cited by 0
- List.foldl_flip_eq_foldrproof · cited by 0