Theorems · Definition · category theory
CategoryTheory.Monoidal.induced
{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.MonoidalCategoryStruct D] →
(F : CategoryTheory.Functor D C) →
[F.Faithful] → CategoryTheory.Monoidal.InducingFunctorData F → CategoryTheory.MonoidalCategory DInduce the lawfulness of the monoidal structure along a faithful functor of (plain) categories,
where the operations are already defined on the destination type D.
The functor F must preserve all the data parts of the monoidal structure between the two
categories.
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 21 from the axioms · uses propext, Classical.choice, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites6
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- CategoryTheory.Categorystatement and proof · cited by 32,673
- CategoryTheory.Functorstatement and proof · cited by 16,252
- CategoryTheory.MonoidalCategorystatement and proof · cited by 3,095
- CategoryTheory.Functor.Faithfulstatement and proof · cited by 313
- CategoryTheory.MonoidalCategoryStructstatement and proof · cited by 26
- CategoryTheory.Monoidal.InducingFunctorDatastatement and proof · cited by 9
Cited by2
Results whose statement or proof uses this declaration.
- CategoryTheory.Monoidal.transportproof · cited by 9
- CategoryTheory.Monoidal.fromInducedCoreMonoidalstatement · cited by 0