Loogle!
Result
Found 114 declarations mentioning AddCommMonCat.
- AddCommMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: Type (u + 1) - AddCommMonCat.carrier 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : AddCommMonCat) : Type u - AddCommMonCat.instCategory 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.Category.{u, u + 1} AddCommMonCat - AddCommMonCat.instInhabited 📋 Mathlib.Algebra.Category.MonCat.Basic
: Inhabited AddCommMonCat - AddCommMonCat.Hom 📋 Mathlib.Algebra.Category.MonCat.Basic
(A B : AddCommMonCat) : Type u - AddCommMonCat.instCoeMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: Coe AddCommMonCat AddMonCat - AddCommMonCat.instCoeSortType 📋 Mathlib.Algebra.Category.MonCat.Basic
: CoeSort AddCommMonCat (Type u) - AddCommMonCat.mk 📋 Mathlib.Algebra.Category.MonCat.Basic
(carrier : Type u) [str : AddCommMonoid carrier] : AddCommMonCat - AddCommMonCat.of 📋 Mathlib.Algebra.Category.MonCat.Basic
(M : Type u) [AddCommMonoid M] : AddCommMonCat - AddCommMonCat.str 📋 Mathlib.Algebra.Category.MonCat.Basic
(self : AddCommMonCat) : AddCommMonoid ↑self - AddCommMonCat.equivalence 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddCommMonCat ≌ CommMonCat - AddCommMonCat.uliftFunctor 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.Functor AddCommMonCat AddCommMonCat - AddCommMonCat.uliftFunctor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : AddCommMonCat) : ↑(AddCommMonCat.uliftFunctor.obj X) = ULift.{u, v} ↑X - AddCommMonCat.equivalence_functor_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : AddCommMonCat) : ↑(AddCommMonCat.equivalence.functor.obj X) = Multiplicative ↑X - AddCommMonCat.equivalence_inverse_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : CommMonCat) : ↑(AddCommMonCat.equivalence.inverse.obj X) = Additive ↑X - AddCommMonCat.Hom.hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : AddCommMonCat} (f : X.Hom Y) : ↑X →+ ↑Y - AddCommMonCat.Hom.hom' 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : AddCommMonCat} (self : A.Hom B) : ↑A →+ ↑B - AddCommMonCat.Hom.Simps.hom 📋 Mathlib.Algebra.Category.MonCat.Basic
(X Y : AddCommMonCat) (f : X.Hom Y) : ↑X →+ ↑Y - AddCommMonCat.ofHom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (f : X →+ Y) : AddCommMonCat.of X ⟶ AddCommMonCat.of Y - AddEquiv.toAddCommMonCatIso 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (e : X ≃+ Y) : AddCommMonCat.of X ≅ AddCommMonCat.of Y - AddCommMonCat.equivalence_unitIso 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddCommMonCat.equivalence.unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id AddCommMonCat) - addEquivIsoAddCommMonCatIso 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] : X ≃+ Y ≅ AddCommMonCat.of X ≅ AddCommMonCat.of Y - AddCommMonCat.ofHom_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{M : Type u} [AddCommMonoid M] : AddCommMonCat.ofHom (AddMonoidHom.id M) = CategoryTheory.CategoryStruct.id (AddCommMonCat.of M) - CategoryTheory.Iso.commMonCatIsoToAddEquiv 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : AddCommMonCat} (i : X ≅ Y) : ↑X ≃+ ↑Y - AddCommMonCat.ofHom_hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : AddCommMonCat} (f : M ⟶ N) : AddCommMonCat.ofHom (AddCommMonCat.Hom.hom f) = f - AddCommMonCat.Hom.ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : AddCommMonCat} {x y : A.Hom B} (hom' : x.hom' = y.hom') : x = y - AddCommMonCat.Hom.ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{A B : AddCommMonCat} {x y : A.Hom B} : x = y ↔ x.hom' = y.hom' - AddCommMonCat.hom_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{M : AddCommMonCat} : AddCommMonCat.Hom.hom (CategoryTheory.CategoryStruct.id M) = AddMonoidHom.id ↑M - AddCommMonCat.instConcreteCategoryAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.ConcreteCategory AddCommMonCat fun x1 x2 => ↑x1 →+ ↑x2 - AddCommMonCat.hom_ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : AddCommMonCat} {f g : M ⟶ N} (hf : AddCommMonCat.Hom.hom f = AddCommMonCat.Hom.hom g) : f = g - AddCommMonCat.hom_ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : AddCommMonCat} {f g : M ⟶ N} : f = g ↔ AddCommMonCat.Hom.hom f = AddCommMonCat.Hom.hom g - AddCommMonCat.forget_reflects_isos 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget AddCommMonCat).ReflectsIsomorphisms - AddEquiv.toAddCommMonCatIso_hom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (e : X ≃+ Y) : e.toAddCommMonCatIso.hom = AddCommMonCat.ofHom e.toAddMonoidHom - AddEquiv.toAddCommMonCatIso_inv 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (e : X ≃+ Y) : e.toAddCommMonCatIso.inv = AddCommMonCat.ofHom e.symm.toAddMonoidHom - AddCommMonCat.hom_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N T : AddCommMonCat} (f : M ⟶ N) (g : N ⟶ T) : AddCommMonCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (AddCommMonCat.Hom.hom g).comp (AddCommMonCat.Hom.hom f) - AddCommMonCat.ofHom_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N P : Type u} [AddCommMonoid M] [AddCommMonoid N] [AddCommMonoid P] (f : M →+ N) (g : N →+ P) : AddCommMonCat.ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (AddCommMonCat.ofHom f) (AddCommMonCat.ofHom g) - AddCommMonCat.hasForgetToAddMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: CategoryTheory.HasForget₂ AddCommMonCat AddMonCat - AddCommMonCat.forget₂_full 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ AddCommMonCat AddMonCat).Full - AddCommMonCat.fullyFaithfulForgetToAddMonCat 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ AddCommMonCat AddMonCat).FullyFaithful - AddCommMonCat.instFullMonCatForget₂AddMonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.MonCat.Basic
: (CategoryTheory.forget₂ AddCommMonCat AddMonCat).Full - AddCommMonCat.coe_forget₂_obj 📋 Mathlib.Algebra.Category.MonCat.Basic
(X : AddCommMonCat) : ↑((CategoryTheory.forget₂ AddCommMonCat AddMonCat).obj X) = ↑X - AddCommMonCat.id_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
(M : AddCommMonCat) (x : ↑M) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id M)) x = x - AddCommMonCat.coe_id 📋 Mathlib.Algebra.Category.MonCat.Basic
{X : AddCommMonCat} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - AddCommMonCat.ofHom_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (f : X →+ Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (AddCommMonCat.ofHom f)) x = f x - AddCommMonCat.uliftFunctor_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{x✝ x✝¹ : AddCommMonCat} (f : x✝ ⟶ x✝¹) : AddCommMonCat.uliftFunctor.map f = AddCommMonCat.ofHom (AddEquiv.ulift.symm.toAddMonoidHom.comp ((AddCommMonCat.Hom.hom f).comp AddEquiv.ulift.toAddMonoidHom)) - AddCommMonCat.hom_neg_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : AddCommMonCat} (e : M ≅ N) (s : ↑N) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - AddCommMonCat.neg_hom_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N : AddCommMonCat} (e : M ≅ N) (x : ↑M) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - AddCommMonCat.ext 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : AddCommMonCat} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - AddCommMonCat.ext_iff 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : AddCommMonCat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - AddCommMonCat.forget₂_map_ofHom 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : Type u} [AddCommMonoid X] [AddCommMonoid Y] (f : X →+ Y) : (CategoryTheory.forget₂ AddCommMonCat AddMonCat).map (AddCommMonCat.ofHom f) = AddMonCat.ofHom f - AddCommMonCat.equivalence_functor_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X✝ Y✝ : AddCommMonCat} (f : X✝ ⟶ Y✝) : AddCommMonCat.equivalence.functor.map f = CommMonCat.ofHom (AddMonoidHom.toMultiplicative (AddCommMonCat.Hom.hom f)) - AddCommMonCat.equivalence_inverse_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X✝ Y✝ : CommMonCat} (f : X✝ ⟶ Y✝) : AddCommMonCat.equivalence.inverse.map f = AddCommMonCat.ofHom (MonoidHom.toAdditive (CommMonCat.Hom.hom f)) - AddCommMonCat.comp_apply 📋 Mathlib.Algebra.Category.MonCat.Basic
{M N T : AddCommMonCat} (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) - AddCommMonCat.coe_comp 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y Z : AddCommMonCat} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - AddCommMonCat.hom_forget₂_map 📋 Mathlib.Algebra.Category.MonCat.Basic
{X Y : AddCommMonCat} (f : X ⟶ Y) : AddMonCat.Hom.hom ((CategoryTheory.forget₂ AddCommMonCat AddMonCat).map f) = AddCommMonCat.Hom.hom f - AddCommMonCat.equivalence_counitIso 📋 Mathlib.Algebra.Category.MonCat.Basic
: AddCommMonCat.equivalence.counitIso = CategoryTheory.Iso.refl ({ obj := fun X => AddCommMonCat.of (Additive ↑X), map := fun {X Y} f => AddCommMonCat.ofHom (MonoidHom.toAdditive (CommMonCat.Hom.hom f)), map_id := AddCommMonCat.equivalence._proof_3, map_comp := @AddCommMonCat.equivalence._proof_4 }.comp { obj := fun X => CommMonCat.of (Multiplicative ↑X), map := fun {X Y} f => CommMonCat.ofHom (AddMonoidHom.toMultiplicative (AddCommMonCat.Hom.hom f)), map_id := AddCommMonCat.equivalence._proof_1, map_comp := @AddCommMonCat.equivalence._proof_2 }) - AddCommGrpCat.instCoeCommMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: Coe AddCommGrpCat AddCommMonCat - AddCommGrpCat.hasForgetToAddCommMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.HasForget₂ AddCommGrpCat AddCommMonCat - AddCommGrpCat.forget₂_commMonCat_map_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddCommGroup X] [AddCommGroup Y] (f : X →+ Y) : (CategoryTheory.forget₂ AddCommGrpCat AddCommMonCat).map (AddCommGrpCat.ofHom f) = AddCommMonCat.ofHom f - SemiRingCat.hasForgetToAddCommMonCat 📋 Mathlib.Algebra.Category.Ring.Basic
: CategoryTheory.HasForget₂ SemiRingCat AddCommMonCat - SemiRingCat.forget₂_addCommMonCat_map 📋 Mathlib.Algebra.Category.Ring.Basic
{R S : SemiRingCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ SemiRingCat AddCommMonCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ SemiRingCat AddCommMonCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - SemimoduleCat.hasForgetToAddCommMonoid 📋 Mathlib.Algebra.Category.ModuleCat.Semi
(R : Type u) [Semiring R] : CategoryTheory.HasForget₂ (SemimoduleCat R) AddCommMonCat - SemimoduleCat.instReflectsIsomorphismsAddCommMonCatForget₂LinearMapIdCarrierAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.ModuleCat.Semi
{R : Type u} [Semiring R] : (CategoryTheory.forget₂ (SemimoduleCat R) AddCommMonCat).ReflectsIsomorphisms - SemimoduleCat.forget₂_obj 📋 Mathlib.Algebra.Category.ModuleCat.Semi
(R : Type u) [Semiring R] (X : SemimoduleCat R) : (CategoryTheory.forget₂ (SemimoduleCat R) AddCommMonCat).obj X = AddCommMonCat.of ↑X - SemimoduleCat.forget₂_obj_moduleCat_of 📋 Mathlib.Algebra.Category.ModuleCat.Semi
(R : Type u) [Semiring R] (X : Type v) [AddCommMonoid X] [Module R X] : (CategoryTheory.forget₂ (SemimoduleCat R) AddCommMonCat).obj (SemimoduleCat.of R X) = AddCommMonCat.of X - SemimoduleCat.forget₂_map 📋 Mathlib.Algebra.Category.ModuleCat.Semi
(R : Type u) [Semiring R] (X Y : SemimoduleCat R) (f : X ⟶ Y) : (CategoryTheory.forget₂ (SemimoduleCat R) AddCommMonCat).map f = AddCommMonCat.ofHom ↑(SemimoduleCat.Hom.hom f) - AddCommMonCat.FilteredColimits.M 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommMonCat) : AddMonCat - AddCommMonCat.FilteredColimits.colimit 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommMonCat) : AddCommMonCat - AddCommMonCat.FilteredColimits.colimitCocone 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommMonCat) : CategoryTheory.Limits.Cocone F - AddCommMonCat.FilteredColimits.colimitAddCommMonoid 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommMonCat) : AddCommMonoid ↑(AddCommMonCat.FilteredColimits.M F) - AddCommMonCat.FilteredColimits.colimitCoconeIsColimit 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommMonCat) : CategoryTheory.Limits.IsColimit (AddCommMonCat.FilteredColimits.colimitCocone F) - AddCommMonCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddCommMonCat) - AddCommMonCat.FilteredColimits.forget₂AddMonPreservesFilteredColimits 📋 Mathlib.Algebra.Category.MonCat.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddCommMonCat AddMonCat) - AddCommMonCat.forget_isCorepresentable 📋 Mathlib.Algebra.Category.MonCat.ForgetCorepresentable
: (CategoryTheory.forget AddCommMonCat).IsCorepresentable - AddCommMonCat.coyonedaObjIsoForget 📋 Mathlib.Algebra.Category.MonCat.ForgetCorepresentable
: CategoryTheory.coyoneda.obj (Opposite.op (AddCommMonCat.of (ULift.{u, 0} ℕ))) ≅ CategoryTheory.forget AddCommMonCat - AddCommMonCat.hasLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.HasLimits AddCommMonCat - AddCommMonCat.hasLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.HasLimitsOfSize.{w, v, u, u + 1} AddCommMonCat - AddCommMonCat.hasLimitsOfShape 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.HasLimitsOfShape J AddCommMonCat - AddCommMonCat.forget_preservesLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget AddCommMonCat) - AddCommMonCat.forget_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{v, v, u, u, u + 1, u + 1} (CategoryTheory.forget AddCommMonCat) - AddCommMonCat.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 AddCommMonCat) - AddCommMonCat.addCommMonoidObj 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) (j : J) : AddCommMonoid ((F.comp (CategoryTheory.forget AddCommMonCat)).obj j) - AddCommMonCat.forget₂Mon_preservesLimits 📋 Mathlib.Algebra.Category.MonCat.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ AddCommMonCat AddMonCat) - AddCommMonCat.forget₂AddMonPreservesLimitsOfSize 📋 Mathlib.Algebra.Category.MonCat.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ AddCommMonCat AddMonCat) - AddCommMonCat.hasLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : CategoryTheory.Limits.HasLimit F - AddCommMonCat.limitCone 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : CategoryTheory.Limits.Cone F - AddCommMonCat.limitConeIsLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : CategoryTheory.Limits.IsLimit (AddCommMonCat.limitCone F) - AddCommMonCat.forget_createsLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : CategoryTheory.CreatesLimit F (CategoryTheory.forget AddCommMonCat) - AddCommMonCat.forget₂CreatesLimit 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ AddCommMonCat AddMonCat) - AddCommMonCat.limitAddCommMonoid 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : AddCommMonoid (CategoryTheory.Limits.Types.Small.limitCone (F.comp (CategoryTheory.forget AddCommMonCat))).pt - AddCommMonCat.instSmallElemForallObjCompMonCatForget₂AddMonoidHomCarrierCarrierForgetSections 📋 Mathlib.Algebra.Category.MonCat.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommMonCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommMonCat)).sections] : Small.{u, max u v} ↑((F.comp (CategoryTheory.forget₂ AddCommMonCat AddMonCat)).comp (CategoryTheory.forget AddMonCat)).sections - AddCommGrpCat.forget₂AddCommMon_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ AddCommGrpCat AddCommMonCat) - AddCommGrpCat.forget₂AddCommMon_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.forget₂ AddCommGrpCat AddCommMonCat) - AddCommGrpCat.forget₂AddCommMon_preservesLimitsAux 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommGrpCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ AddCommGrpCat AddCommMonCat).mapCone (AddCommGrpCat.limitCone F)) - SemiRingCat.forget₂AddCommMon_preservesLimits 📋 Mathlib.Algebra.Category.Ring.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ SemiRingCat AddCommMonCat) - SemiRingCat.forget₂AddCommMon_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Ring.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ SemiRingCat AddCommMonCat) - SemiRingCat.forget₂AddCommMonPreservesLimitsAux 📋 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 AddCommMonCat).mapCone (SemiRingCat.HasLimits.limitCone F)) - AddCommMonCat.free 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: CategoryTheory.Functor (Type u) AddCommMonCat - AddCommMonCat.instIsLeftAdjointFree 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: AddCommMonCat.free.IsLeftAdjoint - AddCommMonCat.free_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
(α : Type u) : ↑(AddCommMonCat.free.obj α) = (α →₀ ℕ) - AddCommMonCat.instIsRightAdjointForgetAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: (CategoryTheory.forget AddCommMonCat).IsRightAdjoint - AddCommMonCat.adj 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
: AddCommMonCat.free ⊣ CategoryTheory.forget AddCommMonCat - AddCommMonCat.free_map 📋 Mathlib.Algebra.Category.MonCat.Adjunctions
{X✝ Y✝ : Type u} (f : X✝ ⟶ Y✝) : AddCommMonCat.free.map f = AddCommMonCat.ofHom (Finsupp.mapDomain.addMonoidHom ⇑(CategoryTheory.ConcreteCategory.hom f)) - AddCommMonCat.coyoneda 📋 Mathlib.Algebra.Category.MonCat.Yoneda
: CategoryTheory.Functor AddCommMonCatᵒᵖ (CategoryTheory.Functor AddCommMonCat AddCommMonCat) - AddCommMonCat.coyonedaType 📋 Mathlib.Algebra.Category.MonCat.Yoneda
: CategoryTheory.Functor Type uᵒᵖ (CategoryTheory.Functor AddCommMonCat AddCommMonCat) - AddCommMonCat.coyonedaType_obj_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(X : Type uᵒᵖ) (M : AddCommMonCat) : ↑((AddCommMonCat.coyonedaType.obj X).obj M) = (Opposite.unop X → ↑M) - AddCommMonCat.coyoneda_obj_obj_coe 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(M : AddCommMonCatᵒᵖ) (N : AddCommMonCat) : ↑((AddCommMonCat.coyoneda.obj M).obj N) = (↑(Opposite.unop M) →+ ↑N) - AddCommMonCat.coyonedaForget 📋 Mathlib.Algebra.Category.MonCat.Yoneda
: AddCommMonCat.coyoneda.comp ((CategoryTheory.Functor.whiskeringRight AddCommMonCat AddCommMonCat (Type u_1)).obj (CategoryTheory.forget AddCommMonCat)) ≅ CategoryTheory.coyoneda - AddCommMonCat.coyonedaType_obj_map 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(X : Type uᵒᵖ) {X✝ Y✝ : AddCommMonCat} (f : X✝ ⟶ Y✝) : (AddCommMonCat.coyonedaType.obj X).map f = AddCommMonCat.ofHom (AddMonoidHom.pi fun i => (AddCommMonCat.Hom.hom f).comp (Pi.evalAddMonoidHom (fun a => ↑X✝) i)) - AddCommMonCat.coyonedaType_map_app 📋 Mathlib.Algebra.Category.MonCat.Yoneda
{X✝ Y✝ : Type uᵒᵖ} (f : X✝ ⟶ Y✝) (N : AddCommMonCat) : (AddCommMonCat.coyonedaType.map f).app N = AddCommMonCat.ofHom (AddMonoidHom.pi fun i => Pi.evalAddMonoidHom (fun a => ↑N) ((CategoryTheory.ConcreteCategory.hom f.unop) i)) - AddCommMonCat.coyonedaForget_inv_app_app_hom_apply 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(X : AddCommMonCatᵒᵖ) (X✝ : AddCommMonCat) (f : Opposite.unop X ⟶ X✝) : (CategoryTheory.ConcreteCategory.hom ((AddCommMonCat.coyonedaForget.inv.app X).app X✝)) f = AddCommMonCat.Hom.hom f - AddCommMonCat.coyonedaForget_hom_app_app_hom_apply_hom 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(X : AddCommMonCatᵒᵖ) (X✝ : AddCommMonCat) (f : ↑(Opposite.unop X) →+ ↑X✝) : AddCommMonCat.Hom.hom ((CategoryTheory.ConcreteCategory.hom ((AddCommMonCat.coyonedaForget.hom.app X).app X✝)) f) = f - AddCommMonCat.coyoneda_obj_map 📋 Mathlib.Algebra.Category.MonCat.Yoneda
(M : AddCommMonCatᵒᵖ) {X✝ Y✝ : AddCommMonCat} (f : X✝ ⟶ Y✝) : (AddCommMonCat.coyoneda.obj M).map f = AddCommMonCat.ofHom (AddMonoidHom.compHom (AddCommMonCat.Hom.hom f)) - AddCommMonCat.coyoneda_map_app 📋 Mathlib.Algebra.Category.MonCat.Yoneda
{X✝ Y✝ : AddCommMonCatᵒᵖ} (f : X✝ ⟶ Y✝) (N : AddCommMonCat) : (AddCommMonCat.coyoneda.map f).app N = AddCommMonCat.ofHom (AddCommMonCat.Hom.hom f.unop).compHom'
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