Loogle!
Result
Found 181 declarations mentioning MonCat.carrier.
- MonCat.carrier 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : MonCat) : Type u - MonCat.str 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : MonCat) : Monoid ↑self - MonCat.coe_of 📋 Mathlib.Algebra.Category.MonCat.Basic
(M : Type u) [Monoid M] : ↑(MonCat.of M) = M - 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 - CategoryTheory.Iso.monCatIsoToMulEquiv 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : MonCat} (i : X ≅ Y) : ↑X ≃* ↑Y - 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.one_of 📋 Mathlib.Algebra.Category.MonCat.Basic
{A : Type u_1} [Monoid A] : 1 = 1 - 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.mul_of 📋 Mathlib.Algebra.Category.MonCat.Basic
{A : Type u_1} [Monoid A] (a b : A) : a * b = a * b - 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 - MonCat.hom_ofHom 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : Type u} [Monoid M] [Monoid N] (f : M →* N) : MonCat.Hom.hom (MonCat.ofHom f) = f - 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.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_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.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 - CommMonCat.FilteredColimits.colimitCommMonoid 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J CommMonCat) : CommMonoid ↑(CommMonCat.FilteredColimits.M 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.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.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.colimitGroup 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) : Group ↑(GrpCat.FilteredColimits.G F) - GrpCat.FilteredColimits.colimitInv 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) : Inv ↑(GrpCat.FilteredColimits.G F) - GrpCat.FilteredColimits.colimitInvAux 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (x : (j : J) × ↑(F.obj j)) : ↑(GrpCat.FilteredColimits.G F) - GrpCat.FilteredColimits.G.mk 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) : (j : J) × ↑(F.obj j) → ↑(GrpCat.FilteredColimits.G F) - GrpCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ GrpCat MonCat) - GrpCat.FilteredColimits.colimit_one_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (j : J) : 1 = GrpCat.FilteredColimits.G.mk F ⟨j, 1⟩ - GrpCat.FilteredColimits.colimitInvAux_eq_of_rel 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (x y : (j : J) × ↑(F.obj j)) (h : CategoryTheory.Limits.Types.FilteredColimit.Rel (F.comp (CategoryTheory.forget GrpCat)) x y) : GrpCat.FilteredColimits.colimitInvAux F x = GrpCat.FilteredColimits.colimitInvAux F y - GrpCat.FilteredColimits.colimit_inv_mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (x : (j : J) × ↑(F.obj j)) : (GrpCat.FilteredColimits.G.mk F x)⁻¹ = GrpCat.FilteredColimits.G.mk F ⟨x.fst, x.snd⁻¹⟩ - GrpCat.FilteredColimits.colimit_mul_mk_eq' 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) {j : J} (x y : ↑(F.obj j)) : GrpCat.FilteredColimits.G.mk F ⟨j, x⟩ * GrpCat.FilteredColimits.G.mk F ⟨j, y⟩ = GrpCat.FilteredColimits.G.mk F ⟨j, x * y⟩ - GrpCat.FilteredColimits.G.mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (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) : GrpCat.FilteredColimits.G.mk F x = GrpCat.FilteredColimits.G.mk F y - GrpCat.FilteredColimits.colimit_mul_mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J GrpCat) (x y : (j : J) × ↑(F.obj j)) (k : J) (f : x.fst ⟶ k) (g : y.fst ⟶ k) : GrpCat.FilteredColimits.G.mk F x * GrpCat.FilteredColimits.G.mk F y = GrpCat.FilteredColimits.G.mk F ⟨k, (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd * (CategoryTheory.ConcreteCategory.hom (F.map g)) y.snd⟩ - SemiRingCat.FilteredColimits.colimitSemiring 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J SemiRingCat) [CategoryTheory.IsFiltered J] : Semiring ↑(SemiRingCat.FilteredColimits.R F) - SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descMonoidHom 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] {F : CategoryTheory.Functor J SemiRingCat} [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) : ↑(SemiRingCat.FilteredColimits.R F) →* ↑t.pt - SemiRingCat.FilteredColimits.forget₂Mon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ SemiRingCat MonCat) - SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descAddMonoidHom 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] {F : CategoryTheory.Functor J SemiRingCat} [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) : ↑(SemiRingCat.FilteredColimits.R F) →+ ↑t.pt - 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_apply_eq 📋 Mathlib.Algebra.Category.Ring.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] {F : CategoryTheory.Functor J SemiRingCat} [CategoryTheory.IsFiltered J] (t : CategoryTheory.Limits.Cocone F) (x : ↑(SemiRingCat.FilteredColimits.R F)) : (SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descMonoidHom t) x = (SemiRingCat.FilteredColimits.colimitCoconeIsColimit.descAddMonoidHom t) x - 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.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_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.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.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_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⁻¹ - 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_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.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.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.one 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (j : J) : MonCat.Colimits.Relation F (MonCat.Colimits.Prequotient.of j 1) MonCat.Colimits.Prequotient.one - MonCat.Colimits.Relation.mul 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (j : J) (x y : ↑(F.obj j)) : MonCat.Colimits.Relation F (MonCat.Colimits.Prequotient.of j (x * y)) ((MonCat.Colimits.Prequotient.of j x).mul (MonCat.Colimits.Prequotient.of j y)) - MonCat.Colimits.Relation.map 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] {F : CategoryTheory.Functor J MonCat} (j j' : J) (f : j ⟶ j') (x : ↑(F.obj j)) : MonCat.Colimits.Relation F (MonCat.Colimits.Prequotient.of j' ((CategoryTheory.ConcreteCategory.hom (F.map f)) x)) (MonCat.Colimits.Prequotient.of j x) - MonCat.Colimits.cocone_naturality_components 📋 Mathlib.Algebra.Category.MonCat.Colimits
{J : Type v} [CategoryTheory.Category.{u, v} J] (F : CategoryTheory.Functor J MonCat) (j j' : J) (f : j ⟶ j') (x : ↑(F.obj j)) : (CategoryTheory.ConcreteCategory.hom (MonCat.Colimits.coconeMorphism F j')) ((CategoryTheory.ConcreteCategory.hom (F.map f)) x) = (CategoryTheory.ConcreteCategory.hom (MonCat.Colimits.coconeMorphism F j)) x - MonCat.shrinkFunctor 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] : CategoryTheory.Functor C MonCat - MonCat.shrinkFunctor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] (X : C) : ↑((MonCat.shrinkFunctor.{w, w', v, u} F).obj X) = Shrink.{w, w'} ↑(F.obj X) - instSmallCompMonCatForgetMonoidHomCarrierOfSmallObj 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] : CategoryTheory.FunctorToTypes.Small.{w, w', v, u} (F.comp (CategoryTheory.forget MonCat)) - MonCat.shrinkFunctorMap 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C MonCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] : MonCat.shrinkFunctor.{w, w', v, u} F ⟶ MonCat.shrinkFunctor.{w, w', v, u} G - MonCat.shrinkFunctor_map 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C MonCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] {X Y : C} (f : X ⟶ Y) : (MonCat.shrinkFunctor.{w, w', v, u} F).map f = MonCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (MonCat.Hom.hom (F.map f))).comp Shrink.mulEquiv.toMonoidHom) - MonCat.shrinkFunctorMap_app 📋 Mathlib.Algebra.Category.MonCat.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C MonCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] (X : C) : (MonCat.shrinkFunctorMap τ).app X = MonCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (MonCat.Hom.hom (τ.app X))).comp Shrink.mulEquiv.toMonoidHom) - CategoryTheory.IsCommMonObj.ofRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.CommMon_
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] [CategoryTheory.BraidedCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ CommMonCat) (α : (F.comp (CategoryTheory.forget CommMonCat)).RepresentableBy X) : CategoryTheory.IsCommMonObj X - CategoryTheory.instSmallCarrierObjOppositeMonCatMonFunctorYonedaMon 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (M : CategoryTheory.Mon C) (X : Cᵒᵖ) : Small.{w, v} ↑((CategoryTheory.yonedaMon.obj M).obj X) - CategoryTheory.shrinkYonedaMonObjObjEquiv 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {M : CategoryTheory.Mon C} {Y : Cᵒᵖ} : ↑((CategoryTheory.shrinkYonedaMon.{w, v, u}.obj M).obj Y) ≃* (Opposite.unop Y ⟶ M.X) - CategoryTheory.shrinkYonedaMon_obj_map_shrinkYonedaMonObjObjEquiv_symm 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {M : CategoryTheory.Mon C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : Opposite.unop Y ⟶ M.X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaMon.{w, v, u}.obj M).map g)) (CategoryTheory.shrinkYonedaMonObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaMonObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkYonedaMon_map_app_shrinkYonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {M M' : CategoryTheory.Mon C} {Y : Cᵒᵖ} (f : Opposite.unop Y ⟶ M.X) (g : M ⟶ M') : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaMon.{w, v, u}.map g).app Y)) (CategoryTheory.shrinkYonedaMonObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaMonObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp f g.hom) - CategoryTheory.shrinkYonedaMonObjObjEquiv_symm_comp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {M : CategoryTheory.Mon C} {Y Y' : C} (g : Y' ⟶ Y) (f : Y ⟶ M.X) : CategoryTheory.shrinkYonedaMonObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g f) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaMon.{w, v, u}.obj M).map g.op)) (CategoryTheory.shrinkYonedaMonObjObjEquiv.symm f) - CategoryTheory.SubmonoidFunctor.instCoeHeadCarrierObjMonCatToFunctor 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) {U : C} : CoeHead ↑(S.toFunctor.obj U) ↑(M.obj U) - CategoryTheory.SubmonoidFunctor.obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (self : CategoryTheory.SubmonoidFunctor M) (U : C) : Submonoid ↑(M.obj U) - CategoryTheory.SubmonoidFunctor.ext 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {M : CategoryTheory.Functor C MonCat} {x y : CategoryTheory.SubmonoidFunctor M} (obj : x.obj = y.obj) : x = y - CategoryTheory.SubmonoidFunctor.ext_iff 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {M : CategoryTheory.Functor C MonCat} {x y : CategoryTheory.SubmonoidFunctor M} : x = y ↔ x.obj = y.obj - CategoryTheory.SubmonoidFunctor.toSubfunctor 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) : CategoryTheory.Subfunctor (M.comp (CategoryTheory.forget MonCat)) - CategoryTheory.SubmonoidFunctor.inf_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S T : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : (Lattice.inf S T).obj x✝ = S.obj x✝ ⊓ T.obj x✝ - CategoryTheory.SubmonoidFunctor.toSubfunctor_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : S.toSubfunctor.obj x✝ = (S.obj x✝).carrier - CategoryTheory.SubmonoidFunctor.toFunctor_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : S.toFunctor.obj x✝ = MonCat.of ↥(S.obj x✝) - CategoryTheory.SubmonoidFunctor.bot_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (x✝ : C) : ⊥.obj x✝ = ⊥ - CategoryTheory.SubmonoidFunctor.top_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (x✝ : C) : ⊤.obj x✝ = ⊤ - CategoryTheory.SubmonoidFunctor.sInf_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : Set (CategoryTheory.SubmonoidFunctor M)) (x✝ : C) : (sInf S).obj x✝ = ⨅ F ∈ S, F.obj x✝ - CategoryTheory.SubmonoidFunctor.sup_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (F G : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : (SemilatticeSup.sup F G).obj x✝ = F.obj x✝ ⊔ G.obj x✝ - CategoryTheory.SubmonoidFunctor.comap_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M M' : CategoryTheory.Functor C MonCat} (p : M ⟶ M') (S' : CategoryTheory.SubmonoidFunctor M') (x✝ : C) : (CategoryTheory.SubmonoidFunctor.comap p S').obj x✝ = Submonoid.comap (MonCat.Hom.hom (p.app x✝)) (S'.obj x✝) - CategoryTheory.SubmonoidFunctor.image_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M M' : CategoryTheory.Functor C MonCat} (p : M ⟶ M') (S : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : (CategoryTheory.SubmonoidFunctor.image p S).obj x✝ = Submonoid.map (MonCat.Hom.hom (p.app x✝)) (S.obj x✝) - CategoryTheory.SubmonoidFunctor.sSup_obj 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : Set (CategoryTheory.SubmonoidFunctor M)) (x✝ : C) : (sSup S).obj x✝ = ⨆ F ∈ S, F.obj x✝ - CategoryTheory.SubmonoidFunctor.ι_app 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) (x✝ : C) : S.ι.app x✝ = MonCat.ofHom (S.obj x✝).subtype - CategoryTheory.SubmonoidFunctor.map 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (self : CategoryTheory.SubmonoidFunctor M) {U V : C} (i : U ⟶ V) : self.obj U ≤ Submonoid.comap (MonCat.Hom.hom (M.map i)) (self.obj V) - CategoryTheory.SubmonoidFunctor.map_le 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) {U V : C} (f : U ⟶ V) : Submonoid.map (MonCat.Hom.hom (M.map f)) (S.obj U) ≤ S.obj V - CategoryTheory.SubmonoidFunctor.mk 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (obj : (U : C) → Submonoid ↑(M.obj U)) (map : ∀ {U V : C} (i : U ⟶ V), obj U ≤ Submonoid.comap (MonCat.Hom.hom (M.map i)) (obj V) := by cat_disch) : CategoryTheory.SubmonoidFunctor M - CategoryTheory.SubmonoidFunctor.lift_app 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M M' : CategoryTheory.Functor C MonCat} (p : M ⟶ M') (S' : CategoryTheory.SubmonoidFunctor M') (hp : CategoryTheory.SubmonoidFunctor.image p ⊤ ≤ S') (U : C) : (CategoryTheory.SubmonoidFunctor.lift p S' hp).app U = MonCat.ofHom ((MonCat.Hom.hom (p.app U)).codRestrict (S'.obj U) ⋯) - CategoryTheory.SubmonoidFunctor.toFunctor_map 📋 Mathlib.CategoryTheory.Subfunctor.SubmonoidFunctor
{C : Type u} [CategoryTheory.Category.{v, u} C] {M : CategoryTheory.Functor C MonCat} (S : CategoryTheory.SubmonoidFunctor M) {X✝ Y✝ : C} (i : X✝ ⟶ Y✝) : S.toFunctor.map i = MonCat.ofHom (((MonCat.Hom.hom (M.map i)).submonoidComap (S.obj Y✝)).comp (Submonoid.inclusion ⋯))
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 ce5dd8c