Theorems · Theorem · category theory

CategoryTheory.Functor.mapMonNatIso.congr_simp

∀ {C : Type u₁} [inst : CategoryTheory.Category.{v₁, u₁} C] [inst_1 : CategoryTheory.MonoidalCategory C] {D : Type u₂}
  [inst_2 : CategoryTheory.Category.{v₂, u₂} D] [inst_3 : CategoryTheory.MonoidalCategory D]
  {F F' : CategoryTheory.Functor C D} [inst_4 : F.LaxMonoidal] [inst_5 : F'.LaxMonoidal] (e e_1 : F ≅ F')
  (e_e : e = e_1) [inst_6 : CategoryTheory.NatTrans.IsMonoidal e.hom],
  CategoryTheory.Functor.mapMonNatIso e = CategoryTheory.Functor.mapMonNatIso e_1

Defined in

Mathlib.CategoryTheory.Monoidal.Mon

Cited by

0 results in Mathlib

Foundations

Depth 27 from the axioms · uses propext, Classical.choice, Quot.sound

Assumes

CategoryTheory.CategoryCategoryTheory.MonoidalCategoryCategoryTheory.CategoryCategoryTheory.MonoidalCategoryCategoryTheory.Functor.LaxMonoidalCategoryTheory.Functor.LaxMonoidalCategoryTheory.NatTrans.IsMonoidal