Loogle!
Result
Found 267 declarations mentioning MonCat. Of these, only the first 200 are shown.
- MonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: Type (u + 1) - MonCat.carrier 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : MonCat) : Type u - MonCat.instCategory 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.Category.{u, u + 1} MonCat - MonCat.instInhabited 📋 Mathlib.Algebra.Category.MonCat.Basic
: Inhabited MonCat - CommMonCat.instCoeMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: Coe CommMonCat MonCat - MonCat.Hom 📋 Mathlib.Algebra.Category.MonCat.Basic
(A B : MonCat) : Type u - MonCat.instCoeSortType 📋 Mathlib.Algebra.Category.MonCat.Basic
: CoeSort MonCat (Type u) - MonCat.mk 📋 Mathlib.Algebra.Category.MonCat.Basic
(carrier : Type u) [str : Monoid carrier] : MonCat - MonCat.of 📋 Mathlib.Algebra.Category.MonCat.Basic
(M : Type u) [Monoid M] : MonCat - MonCat.str 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : MonCat) : Monoid ↑self - AddMonCat.equivalence 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddMonCat ≌ MonCat - MonCat.uliftFunctor 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.Functor MonCat MonCat - MonCat.instOneHom 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : MonCat) : One (X ⟶ Y) - MonCat.uliftFunctor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : MonCat) : ↑(MonCat.uliftFunctor.obj X) = ULift.{u, v} ↑X - AddMonCat.equivalence_functor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : AddMonCat) : ↑(AddMonCat.equivalence.functor.obj X) = Multiplicative ↑X - AddMonCat.equivalence_inverse_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : MonCat) : ↑(AddMonCat.equivalence.inverse.obj X) = Additive ↑X - MonCat.Hom.hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} (f : X.Hom Y) : ↑X →* ↑Y - MonCat.Hom.hom' 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : MonCat} (self : A.Hom B) : ↑A →* ↑B - MonCat.Hom.Simps.hom 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : MonCat) (f : X.Hom Y) : ↑X →* ↑Y - MonCat.ofHom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] (f : X →* Y) : MonCat.of X ⟶ MonCat.of Y - MulEquiv.toMonCatIso 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] (e : X ≃* Y) : MonCat.of X ≅ MonCat.of Y - CategoryTheory.Iso.monCatIsoToMulEquiv 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} (i : X ≅ Y) : ↑X ≃* ↑Y - mulEquivIsoMonCatIso 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] : X ≃* Y ≅ MonCat.of X ≅ MonCat.of Y - MonCat.ofHom_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{M : Type u} [Monoid M] : MonCat.ofHom (MonoidHom.id M) = CategoryTheory.CategoryStruct.id (MonCat.of M) - AddMonCat.equivalence_unitIso 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddMonCat.equivalence.unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id AddMonCat) - MonCat.hom_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{M : MonCat} : MonCat.Hom.hom (CategoryTheory.CategoryStruct.id M) = MonoidHom.id ↑M - MonCat.ofHom_hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : MonCat} (f : M ⟶ N) : MonCat.ofHom (MonCat.Hom.hom f) = f - MonCat.Hom.ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : MonCat} {x y : A.Hom B} (hom' : x.hom' = y.hom') : x = y - MonCat.Hom.ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : MonCat} {x y : A.Hom B} : x = y ↔ x.hom' = y.hom' - MonCat.instConcreteCategoryMonoidHomCarrier 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.ConcreteCategory MonCat fun x1 x2 => ↑x1 →* ↑x2 - MonCat.forget_reflects_isos 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget MonCat).ReflectsIsomorphisms - MonCat.hom_ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : MonCat} {f g : M ⟶ N} (hf : MonCat.Hom.hom f = MonCat.Hom.hom g) : f = g - MonCat.hom_ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : MonCat} {f g : M ⟶ N} : f = g ↔ MonCat.Hom.hom f = MonCat.Hom.hom g - MulEquiv.toMonCatIso_hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] (e : X ≃* Y) : e.toMonCatIso.hom = MonCat.ofHom e.toMonoidHom - MulEquiv.toMonCatIso_inv 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] (e : X ≃* Y) : e.toMonCatIso.inv = MonCat.ofHom e.symm.toMonoidHom - MonCat.hom_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N T : MonCat} (f : M ⟶ N) (g : N ⟶ T) : MonCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (MonCat.Hom.hom g).comp (MonCat.Hom.hom f) - MonCat.ofHom_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N P : Type u} [Monoid M] [Monoid N] [Monoid P] (f : M →* N) (g : N →* P) : MonCat.ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (MonCat.ofHom f) (MonCat.ofHom g) - MonCat.oneHom_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : MonCat) (x : ↑X) : (MonCat.Hom.hom 1) x = 1 - MonCat.hom_one 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : MonCat) : MonCat.Hom.hom 1 = 1 - CommMonCat.hasForgetToMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.HasForget₂ CommMonCat MonCat - CommMonCat.forget₂_full 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ CommMonCat MonCat).Full - CommMonCat.fullyFaithfulForgetToMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ CommMonCat MonCat).FullyFaithful - CommMonCat.instFullMonCatForget₂MonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ CommMonCat MonCat).Full - MonCat.id_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
(M : MonCat) (x : ↑M) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id M)) x = x - MonCat.coe_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{X : MonCat} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - CommMonCat.coe_forget₂_obj 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : CommMonCat) : ↑((CategoryTheory.forget₂ CommMonCat MonCat).obj X) = ↑X - MonCat.ofHom_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [Monoid X] [Monoid Y] (f : X →* Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (MonCat.ofHom f)) x = f x - MonCat.uliftFunctor_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{x✝ x✝¹ : MonCat} (f : x✝ ⟶ x✝¹) : MonCat.uliftFunctor.map f = MonCat.ofHom (MulEquiv.ulift.symm.toMonoidHom.comp ((MonCat.Hom.hom f).comp MulEquiv.ulift.toMonoidHom)) - MonCat.hom_inv_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : MonCat} (e : M ≅ N) (s : ↑N) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - MonCat.inv_hom_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : MonCat} (e : M ≅ N) (x : ↑M) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - MonCat.ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - MonCat.ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - AddMonCat.equivalence_functor_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X✝ Y✝ : AddMonCat} (f : X✝ ⟶ Y✝) : AddMonCat.equivalence.functor.map f = MonCat.ofHom (AddMonoidHom.toMultiplicative (AddMonCat.Hom.hom f)) - AddMonCat.equivalence_inverse_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X✝ Y✝ : MonCat} (f : X✝ ⟶ Y✝) : AddMonCat.equivalence.inverse.map f = AddMonCat.ofHom (MonoidHom.toAdditive (MonCat.Hom.hom f)) - MonCat.comp_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N T : MonCat} (f : M ⟶ N) (g : N ⟶ T) (x : ↑M) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) x = (CategoryTheory.ConcreteCategory.hom g) ((CategoryTheory.ConcreteCategory.hom f) x) - MonCat.coe_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y Z : MonCat} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - CommMonCat.forget₂_map_ofHom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [CommMonoid X] [CommMonoid Y] (f : X →* Y) : (CategoryTheory.forget₂ CommMonCat MonCat).map (CommMonCat.ofHom f) = MonCat.ofHom f - MonCat.forget_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} (f : X ⟶ Y) : ⇑(CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget MonCat).map f)) = ⇑(CategoryTheory.ConcreteCategory.hom f) - CommMonCat.hom_forget₂_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : CommMonCat} (f : X ⟶ Y) : MonCat.Hom.hom ((CategoryTheory.forget₂ CommMonCat MonCat).map f) = CommMonCat.Hom.hom f - AddMonCat.equivalence_counitIso 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddMonCat.equivalence.counitIso = CategoryTheory.Iso.refl ({ obj := fun X => AddMonCat.of (Additive ↑X), map := fun {X Y} f => AddMonCat.ofHom (MonoidHom.toAdditive (MonCat.Hom.hom f)), map_id := AddMonCat.equivalence._proof_3, map_comp := @AddMonCat.equivalence._proof_4 }.comp { obj := fun X => MonCat.of (Multiplicative ↑X), map := fun {X Y} f => MonCat.ofHom (AddMonoidHom.toMultiplicative (AddMonCat.Hom.hom f)), map_id := AddMonCat.equivalence._proof_1, map_comp := @AddMonCat.equivalence._proof_2 }) - GrpCat.instCoeMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: Coe GrpCat MonCat - GrpCat.hasForgetToMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.HasForget₂ GrpCat MonCat - GrpCat.fullyFaithfulForget₂ToMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ GrpCat MonCat).FullyFaithful - GrpCat.instFullMonCatForget₂MonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ GrpCat MonCat).Full - GrpCat.forget₂_map_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [Group X] [Group Y] (f : X →* Y) : (CategoryTheory.forget₂ GrpCat MonCat).map (GrpCat.ofHom f) = MonCat.ofHom f - GrpCat.forget₂_map 📋 Mathlib.Algebra.Category.Grp.Basic
{R S : GrpCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ GrpCat MonCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ GrpCat MonCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - SemiRingCat.hasForgetToMonCat 📋 Mathlib.Algebra.Category.Ring.Basic
: CategoryTheory.HasForget₂ SemiRingCat MonCat - SemiRingCat.forget₂_monCat_map 📋 Mathlib.Algebra.Category.Ring.Basic
{R S : SemiRingCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ SemiRingCat MonCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ SemiRingCat MonCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - MonCat.FilteredColimits.M 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) : Type (max u v) - CommMonCat.FilteredColimits.M 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J CommMonCat) : MonCat - MonCat.FilteredColimits.colimit 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : MonCat - MonCat.FilteredColimits.colimitMonoid 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : Monoid (MonCat.FilteredColimits.M F) - MonCat.FilteredColimits.colimitMul 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : Mul (MonCat.FilteredColimits.M F) - MonCat.FilteredColimits.colimitMulOneClass 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : MulOneClass (MonCat.FilteredColimits.M F) - MonCat.FilteredColimits.colimitOne 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : One (MonCat.FilteredColimits.M F) - MonCat.FilteredColimits.colimitCocone 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : CategoryTheory.Limits.Cocone F - MonCat.FilteredColimits.colimitCoconeIsColimit 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] : CategoryTheory.Limits.IsColimit (MonCat.FilteredColimits.colimitCocone F) - MonCat.FilteredColimits.M.mk 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) : (j : J) × ↑(F.obj j) → MonCat.FilteredColimits.M F - MonCat.FilteredColimits.coconeMorphism 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] (j : J) : F.obj j ⟶ MonCat.FilteredColimits.colimit F - MonCat.FilteredColimits.colimitDesc 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) : MonCat.FilteredColimits.colimit F ⟶ t.pt - MonCat.FilteredColimits.colimitMulAux 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] (x y : (j : J) × ↑(F.obj j)) : MonCat.FilteredColimits.M F - MonCat.FilteredColimits.M.mk_surjective 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) (m : MonCat.FilteredColimits.M F) : ∃ j x, MonCat.FilteredColimits.M.mk F ⟨j, x⟩ = m - MonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget MonCat) - MonCat.FilteredColimits.cocone_naturality 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] {j j' : J} (f : j ⟶ j') : CategoryTheory.CategoryStruct.comp (F.map f) (MonCat.FilteredColimits.coconeMorphism F j') = MonCat.FilteredColimits.coconeMorphism F j - MonCat.FilteredColimits.colimit_one_eq 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] (j : J) : 1 = MonCat.FilteredColimits.M.mk F ⟨j, 1⟩ - CommMonCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommMonCat MonCat) - MonCat.FilteredColimits.colimitMulAux_eq_of_rel_left 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] {x x' y : (j : J) × ↑(F.obj j)} (hxx' : CategoryTheory.Limits.Types.FilteredColimit.Rel (F.comp (CategoryTheory.forget MonCat)) x x') : MonCat.FilteredColimits.colimitMulAux F x y = MonCat.FilteredColimits.colimitMulAux F x' y - MonCat.FilteredColimits.colimitMulAux_eq_of_rel_right 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] {x y y' : (j : J) × ↑(F.obj j)} (hyy' : CategoryTheory.Limits.Types.FilteredColimit.Rel (F.comp (CategoryTheory.forget MonCat)) y y') : MonCat.FilteredColimits.colimitMulAux F x y = MonCat.FilteredColimits.colimitMulAux F x y' - MonCat.FilteredColimits.colimit_mul_mk_eq' 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] {j : J} (x y : ↑(F.obj j)) : MonCat.FilteredColimits.M.mk F ⟨j, x⟩ * MonCat.FilteredColimits.M.mk F ⟨j, y⟩ = MonCat.FilteredColimits.M.mk F ⟨j, x * y⟩ - MonCat.FilteredColimits.M.map_mk 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) {j k : J} (f : j ⟶ k) (x : ↑(F.obj j)) : MonCat.FilteredColimits.M.mk F ⟨k, (CategoryTheory.ConcreteCategory.hom (F.map f)) x⟩ = MonCat.FilteredColimits.M.mk F ⟨j, x⟩ - MonCat.FilteredColimits.M.mk_eq 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) (x y : (j : J) × ↑(F.obj j)) (h : ∃ k f g, (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd = (CategoryTheory.ConcreteCategory.hom (F.map g)) y.snd) : MonCat.FilteredColimits.M.mk F x = MonCat.FilteredColimits.M.mk F y - MonCat.FilteredColimits.colimit_mul_mk_eq 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J MonCat) [CategoryTheory.IsFiltered J] (x y : (j : J) × ↑(F.obj j)) (k : J) (f : x.fst ⟶ k) (g : y.fst ⟶ k) : MonCat.FilteredColimits.M.mk F x * MonCat.FilteredColimits.M.mk F y = MonCat.FilteredColimits.M.mk F ⟨k, (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd * (CategoryTheory.ConcreteCategory.hom (F.map g)) y.snd⟩ - GrpCat.FilteredColimits.G 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) : MonCat - GrpCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ GrpCat MonCat) - SemiRingCat.FilteredColimits.R 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J SemiRingCat) [CategoryTheory.IsFiltered J] : MonCat - SemiRingCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ SemiRingCat MonCat) - SemiRingCat.FilteredColimits.semiringObj 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J SemiRingCat) (j : J) : Semiring (((F.comp (CategoryTheory.forget₂ SemiRingCat MonCat)).comp (CategoryTheory.forget MonCat)).obj j) - SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descMonoidHom_quotMk 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] {F : CategoryTheory.Functor J SemiRingCat} [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) {j : J} (x : ↑(F.obj j)) : (SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descMonoidHom t) (Quot.mk ((F.comp (CategoryTheory.forget₂ SemiRingCat MonCat)).comp (CategoryTheory.forget MonCat)).ColimitTypeRel ⟨j, x⟩) = (CategoryTheory.ConcreteCategory.hom (t.ι.app j)) x - SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descAddMonoidHom_quotMk 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] {F : CategoryTheory.Functor J SemiRingCat} [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) {j : J} (x : ↑(F.obj j)) : (SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descAddMonoidHom t) (Quot.mk ((F.comp (CategoryTheory.forget₂ SemiRingCat MonCat)).comp (CategoryTheory.forget MonCat)).ColimitTypeRel ⟨j, x⟩) = (CategoryTheory.ConcreteCategory.hom (t.ι.app j)) x - MonCat.forget_isCorepresentable 📋 Mathlib.Algebra.Category.MonCat.ForgetCorepresentable
: (CategoryTheory.forget MonCat).IsCorepresentable - MonCat.coyonedaObjIsoForget 📋 Mathlib.Algebra.Category.MonCat.ForgetCorepresentable
: CategoryTheory.coyoneda.obj (Opposite.op (MonCat.of (ULift.{u, 0} (Multiplicative ℕ)))) ≅ CategoryTheory.forget MonCat - MonCat.hasLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.HasLimits MonCat - MonCat.hasLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.HasLimitsOfSize.{w, v, u, u + 1} MonCat - MonCat.HasLimits.hasLimitsOfShape 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.HasLimitsOfShape J MonCat - MonCat.monoidObj 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) (j : J) : Monoid ↑(F.obj j) - MonCat.sectionsSubmonoid 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) : Submonoid ((j : J) → ↑(F.obj j)) - CommMonCat.forget_createsLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.CreatesLimits (CategoryTheory.forget MonCat) - CommMonCat.forget_createsLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.CreatesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget MonCat) - MonCat.forget_createsLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.CreatesLimits (CategoryTheory.forget MonCat) - MonCat.forget_createsLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.CreatesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget MonCat) - MonCat.forget_preservesLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget MonCat) - MonCat.forget_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget MonCat) - CommMonCat.forget_createsLimitsOfShape 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.forget MonCat) - MonCat.forget_createsLimitsOfShape 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.forget MonCat) - MonCat.forget_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.forget MonCat) - MonCat.forget_createsLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget MonCat) - CommMonCat.forget₂Mon_preservesLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ CommMonCat MonCat) - CommMonCat.forget₂Mon_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ CommMonCat MonCat) - MonCat.sectionsMonoid 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) : Monoid ↑(F.comp (CategoryTheory.forget MonCat)).sections - MonCat.HasLimits.hasLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget MonCat)).sections] : CategoryTheory.Limits.HasLimit F - MonCat.HasLimits.limitCone 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget MonCat)).sections] : CategoryTheory.Limits.Cone F - MonCat.HasLimits.limitConeIsLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget MonCat)).sections] : CategoryTheory.Limits.IsLimit (MonCat.HasLimits.limitCone F) - MonCat.limitMonoid 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget MonCat)).sections] : Monoid (CategoryTheory.Limits.Types.Small.limitCone (F.comp (CategoryTheory.forget MonCat))).pt - CommMonCat.forget₂CreatesLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget CommMonCat)).sections] : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ CommMonCat MonCat) - CommMonCat.instSmallElemForallObjCompMonCatForget₂MonoidHomCarrierCarrierForgetSections 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget CommMonCat)).sections] : Small.{u, max u v} ↑((F.comp (CategoryTheory.forget₂ CommMonCat MonCat)).comp (CategoryTheory.forget MonCat)).sections - MonCat.limitπMonoidHom 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J MonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget MonCat)).sections] (j : J) : (CategoryTheory.Limits.Types.Small.limitCone (F.comp (CategoryTheory.forget MonCat))).pt →* ↑(F.obj j) - GrpCat.forget₂Mon_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ GrpCat MonCat) - GrpCat.forget₂Mon_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ GrpCat MonCat) - GrpCat.Forget₂.createsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ GrpCat MonCat) - GrpCat.instSmallElemForallObjCompMonCatForget₂MonoidHomCarrierCarrierForgetSections 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget GrpCat)).sections] : Small.{u, max u v} ↑((F.comp (CategoryTheory.forget₂ GrpCat MonCat)).comp (CategoryTheory.forget MonCat)).sections - SemiRingCat.forget₂Mon_preservesLimits 📋 Mathlib.Algebra.Category.Ring.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ SemiRingCat MonCat) - SemiRingCat.forget₂Mon_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Ring.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ SemiRingCat MonCat) - SemiRingCat.forget₂MonPreservesLimitsAux 📋 Mathlib.Algebra.Category.Ring.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J SemiRingCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget SemiRingCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ SemiRingCat MonCat).mapCone (SemiRingCat.HasLimits.limitCone F)) - CategoryTheory.yonedaMonObj 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (M : C) [CategoryTheory.MonObj M] : CategoryTheory.Functor Cᵒᵖ MonCat - CategoryTheory.yonedaMon 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Functor (CategoryTheory.Mon C) (CategoryTheory.Functor Cᵒᵖ MonCat) - CategoryTheory.instFaithfulMonFunctorOppositeMonCatYonedaMon 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaMon.Faithful - CategoryTheory.instFullMonFunctorOppositeMonCatYonedaMon 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaMon.Full - CategoryTheory.yonedaMonFullyFaithful 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaMon.FullyFaithful - CategoryTheory.yonedaMonObj_obj_coe 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (M : C) [CategoryTheory.MonObj M] (X : Cᵒᵖ) : ↑((CategoryTheory.yonedaMonObj M).obj X) = (Opposite.unop X ⟶ M) - CategoryTheory.yonedaMonObjRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (M : C) [CategoryTheory.MonObj M] : ((CategoryTheory.yonedaMonObj M).comp (CategoryTheory.forget MonCat)).RepresentableBy M - CategoryTheory.yonedaMon_obj 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (M : CategoryTheory.Mon C) : CategoryTheory.yonedaMon.obj M = CategoryTheory.yonedaMonObj M.X - CategoryTheory.MonObj.ofRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) : CategoryTheory.MonObj X - CategoryTheory.yonedaMonObjIsoOfRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) : CategoryTheory.yonedaMonObj X ≅ F - CategoryTheory.essImage_yonedaMon 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaMon.essImage = fun F => (F.comp (CategoryTheory.forget MonCat)).IsRepresentable - CategoryTheory.yonedaMonObj_map 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (M : C) [CategoryTheory.MonObj M] {X Y₂ : Cᵒᵖ} (φ : X ⟶ Y₂) : (CategoryTheory.yonedaMonObj M).map φ = MonCat.ofHom { toFun := fun x => CategoryTheory.CategoryStruct.comp φ.unop x, map_one' := ⋯, map_mul' := ⋯ } - CategoryTheory.yonedaMon_map_app 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] {X✝ Y✝ : CategoryTheory.Mon C} (ψ : X✝ ⟶ Y✝) (x✝ : Cᵒᵖ) : (CategoryTheory.yonedaMon.map ψ).app x✝ = MonCat.ofHom (CategoryTheory.IsMonHom.monoidHom ψ.hom (Opposite.unop x✝)) - CategoryTheory.yonedaMonObjIsoOfRepresentableBy_hom_app_hom_apply 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) (X✝ : Cᵒᵖ) (a✝ : Opposite.unop X✝ ⟶ X) : (MonCat.Hom.hom ((CategoryTheory.yonedaMonObjIsoOfRepresentableBy X F α).hom.app X✝)) a✝ = α.homEquiv' a✝ - CategoryTheory.yonedaMonObjIsoOfRepresentableBy_inv_app_hom_apply 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) (X✝ : Cᵒᵖ) (a✝ : ↑(F.1 X✝)) : (MonCat.Hom.hom ((CategoryTheory.yonedaMonObjIsoOfRepresentableBy X F α).inv.app X✝)) a✝ = α.homEquiv'.symm a✝ - CategoryTheory.yonedaMon_naturality 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] {M N X Y : C} [CategoryTheory.MonObj M] [CategoryTheory.MonObj N] (α : CategoryTheory.yonedaMonObj M ⟶ CategoryTheory.yonedaMonObj N) (f : X ⟶ Y) (g : Y ⟶ M) : (CategoryTheory.ConcreteCategory.hom (α.app (Opposite.op X))) (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp f ((CategoryTheory.ConcreteCategory.hom (α.app (Opposite.op Y))) g) - CategoryTheory.yonedaMon_naturality_assoc 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] {M N X Y : C} [CategoryTheory.MonObj M] [CategoryTheory.MonObj N] (α : CategoryTheory.yonedaMonObj M ⟶ CategoryTheory.yonedaMonObj N) (f : X ⟶ Y) (g : Y ⟶ M) {Z : C} (h : N ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.ConcreteCategory.hom (α.app (Opposite.op X))) (CategoryTheory.CategoryStruct.comp f g)) h = CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp ((CategoryTheory.ConcreteCategory.hom (α.app (Opposite.op Y))) g) h) - CategoryTheory.MonObj.ofRepresentableBy_one 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) : CategoryTheory.MonObj.one = α.homEquiv'.symm 1 - CategoryTheory.Hom.mulEquivCongrRight_apply 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] {M N : C} [CategoryTheory.MonObj M] [CategoryTheory.MonObj N] (e : M ≅ N) [CategoryTheory.IsMonHom e.hom] (X : C) (a : ↑((CategoryTheory.yonedaMon.obj { X := M, mon := inst✝ }).obj (Opposite.op X))) : (CategoryTheory.Hom.mulEquivCongrRight e X) a = (MonCat.Hom.hom (MonCat.ofHom (CategoryTheory.IsMonHom.monoidHom e.hom X))) a - CategoryTheory.Hom.mulEquivCongrRight_symm_apply 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] {M N : C} [CategoryTheory.MonObj M] [CategoryTheory.MonObj N] (e : M ≅ N) [CategoryTheory.IsMonHom e.hom] (X : C) (a : ↑((CategoryTheory.yonedaMon.obj { X := N, mon := inst✝ }).obj (Opposite.op X))) : (CategoryTheory.Hom.mulEquivCongrRight e X).symm a = (MonCat.Hom.hom (MonCat.ofHom (CategoryTheory.IsMonHom.monoidHom e.inv X))) a - CategoryTheory.MonObj.ofRepresentableBy_mul 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Mon
{C : Type u_1} [CategoryTheory.Category.{v, u_1} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ MonCat) (α : (F.comp (CategoryTheory.forget MonCat)).RepresentableBy X) : CategoryTheory.MonObj.mul = α.homEquiv'.symm (α.homEquiv' (CategoryTheory.SemiCartesianMonoidalCategory.fst X X) * α.homEquiv' (CategoryTheory.SemiCartesianMonoidalCategory.snd X X)) - MonCat.units 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: CategoryTheory.Functor MonCat GrpCat - instIsRightAdjointGrpCatMonCatUnits 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: MonCat.units.IsRightAdjoint - MonCat.units_obj_coe 📋 Mathlib.Algebra.Category.Grp.Adjunctions
(R : MonCat) : ↑(MonCat.units.obj R) = (↑R)ˣ - GrpCat.forget₂MonAdj 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: CategoryTheory.forget₂ GrpCat MonCat ⊣ MonCat.units - MonCat.val_units_map_hom_apply 📋 Mathlib.Algebra.Category.Grp.Adjunctions
{X✝ Y✝ : MonCat} (f : X✝ ⟶ Y✝) (u : (↑X✝)ˣ) : ↑((GrpCat.Hom.hom (MonCat.units.map f)) u) = (MonCat.Hom.hom f) ↑u - MonCat.val_inv_units_map_hom_apply 📋 Mathlib.Algebra.Category.Grp.Adjunctions
{X✝ Y✝ : MonCat} (f : X✝ ⟶ Y✝) (u : (↑X✝)ˣ) : ↑((GrpCat.Hom.hom (MonCat.units.map f)) u)⁻¹ = (MonCat.Hom.hom f) ↑u⁻¹ - monTypeEquivalenceMon 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Basic
: CategoryTheory.Mon (Type u) ≌ MonCat - MonTypeEquivalenceMon.functor 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Basic
: CategoryTheory.Functor (CategoryTheory.Mon (Type u)) MonCat - MonTypeEquivalenceMon.inverse 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Basic
: CategoryTheory.Functor MonCat (CategoryTheory.Mon (Type u)) - monTypeEquivalenceMonForget 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Basic
: MonTypeEquivalenceMon.functor.comp (CategoryTheory.forget MonCat) ≅ CategoryTheory.Mon.forget (Type u) - commMonTypeEquivalenceCommMonForget 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Basic
: CommMonTypeEquivalenceCommMon.functor.comp (CategoryTheory.forget₂ CommMonCat MonCat) ≅ (CategoryTheory.CommMon.forget₂Mon (Type u)).comp MonTypeEquivalenceMon.functor - grpTypeEquivalenceGrpForget 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Grp
: GrpTypeEquivalenceGrp.functor.comp (CategoryTheory.forget₂ GrpCat MonCat) ≅ (CategoryTheory.Grp.forget₂Mon (Type u)).comp MonTypeEquivalenceMon.functor - GrpWithZero.hasForgetToMon 📋 Mathlib.Algebra.Category.GrpWithZero
: CategoryTheory.HasForget₂ GrpWithZero MonCat - MonCat.adjoinOne 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: CategoryTheory.Functor Semigrp MonCat - MonCat.free 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: CategoryTheory.Functor (Type u) MonCat - MonCat.adjoinOne_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
(S : Semigrp) : ↑(MonCat.adjoinOne.obj S) = WithOne ↑S - MonCat.instIsRightAdjointForgetMonoidHomCarrier 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: (CategoryTheory.forget MonCat).IsRightAdjoint - MonCat.adj 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: MonCat.free ⊣ CategoryTheory.forget MonCat - MonCat.adjoinOne_map 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
{X✝ Y✝ : Semigrp} (f : X✝ ⟶ Y✝) : MonCat.adjoinOne.map f = MonCat.ofHom (WithOne.mapMulHom (Semigrp.Hom.hom f)) - MonCat.hasForgetToSemigroup 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: CategoryTheory.HasForget₂ MonCat Semigrp - MonCat.adjoinOneAdj 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: MonCat.adjoinOne ⊣ CategoryTheory.forget₂ MonCat Semigrp - MonCat.Colimits.hasColimits_monCat 📋 Mathlib.Algebra.Category.MonCat.Colimits
: CategoryTheory.Limits.HasColimits MonCat - MonCat.Colimits.ColimitType 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : Type v - MonCat.Colimits.Prequotient 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : Type v - MonCat.Colimits.colimit 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : MonCat - MonCat.Colimits.Prequotient.one 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} : MonCat.Colimits.Prequotient F - MonCat.Colimits.colimitSetoid 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : Setoid (MonCat.Colimits.Prequotient F) - MonCat.Colimits.instInhabitedColimitType 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type u_1} [CategoryTheory.Category.{u_2, u_1} J] (F : CategoryTheory.Functor J MonCat) : Inhabited (MonCat.Colimits.ColimitType F) - MonCat.Colimits.instInhabitedPrequotient 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : Inhabited (MonCat.Colimits.Prequotient F) - MonCat.Colimits.monoidColimitType 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : Monoid (MonCat.Colimits.ColimitType F) - MonCat.Colimits.colimitCocone 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : CategoryTheory.Limits.Cocone F - MonCat.Colimits.Relation 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : MonCat.Colimits.Prequotient F → MonCat.Colimits.Prequotient F → Prop - MonCat.Colimits.colimitIsColimit 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) : CategoryTheory.Limits.IsColimit (MonCat.Colimits.colimitCocone F) - MonCat.Colimits.Relation.refl 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F x x - MonCat.Colimits.Prequotient.mul 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} : MonCat.Colimits.Prequotient F → MonCat.Colimits.Prequotient F → MonCat.Colimits.Prequotient F - MonCat.Colimits.coconeFun 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (j : J) (x : ↑(F.obj j)) : MonCat.Colimits.ColimitType F - MonCat.Colimits.Prequotient.of 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (j : J) : ↑(F.obj j) → MonCat.Colimits.Prequotient F - MonCat.Colimits.descFun 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (s : CategoryTheory.Limits.Cocone F) : MonCat.Colimits.ColimitType F → ↑s.pt - MonCat.Colimits.descFunLift 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (s : CategoryTheory.Limits.Cocone F) : MonCat.Colimits.Prequotient F → ↑s.pt - MonCat.Colimits.Relation.mul_one 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F (x.mul MonCat.Colimits.Prequotient.one) x - MonCat.Colimits.Relation.one_mul 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F (MonCat.Colimits.Prequotient.one.mul x) x - MonCat.Colimits.coconeMorphism 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (j : J) : F.obj j ⟶ MonCat.Colimits.colimit F - MonCat.Colimits.Relation.symm 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x y : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F x y → MonCat.Colimits.Relation F y x - MonCat.Colimits.descMorphism 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (s : CategoryTheory.Limits.Cocone F) : MonCat.Colimits.colimit F ⟶ s.pt - MonCat.Colimits.Relation.trans 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x y z : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F x y → MonCat.Colimits.Relation F y z → MonCat.Colimits.Relation F x z - MonCat.Colimits.Relation.mul_1 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (x x' y : MonCat.Colimits.Prequotient F) : MonCat.Colimits.Relation F x x' → MonCat.Colimits.Relation F (x.mul y) (x'.mul y)
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59