Theorems · Theorem

Traversable.foldr_map

∀ {α β γ : Type u} {t : Type u → Type u} [inst : Traversable t] [LawfulTraversable t] (g : β → γ) (f : γ → α → α)
  (a : α) (l : t β), Traversable.foldr f a (g <$> l) = Traversable.foldr (f ∘ g) a l

Defined in

Mathlib.Control.Fold

Cited by

0 results in Mathlib

Foundations

Depth 16 from the axioms · uses propext, Quot.sound

Assumes

TraversableLawfulTraversable