Mathlib Map

Theorems · Inductive type · category theory

CategoryTheory.Functor.Monoidal

{C : Type u₁} →
  [inst : CategoryTheory.Category.{v₁, u₁} C] →
    [CategoryTheory.MonoidalCategory C] →
      {D : Type u₂} →
        [inst_2 : CategoryTheory.Category.{v₂, u₂} D] →
          [CategoryTheory.MonoidalCategory D] → CategoryTheory.Functor C D → Type (max u₁ v₂)

A functor between monoidal categories is monoidal if it is lax and oplax monoidals, and both data give inverse isomorphisms.

Defined in
Mathlib.CategoryTheory.Monoidal.Functor
Cited by
288 results in Mathlib
Foundations
Depth 2 from the axioms, rests on 4 definitions · uses no axioms
Assumes
CategoryTheory.CategoryCategoryTheory.MonoidalCategoryCategoryTheory.CategoryCategoryTheory.MonoidalCategory

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Cites3

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by381

Results whose statement or proof uses this declaration.

Showing the 200 most cited of 381.