Theorems · Theorem

Traversable.foldrm_map

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

Defined in

Mathlib.Control.Fold

Cited by

0 results in Mathlib

Foundations

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

Assumes

TraversableLawfulTraversableMonadLawfulMonad