Loogle!
Result
Found 175 declarations mentioning AddGrpCat.
- AddGrpCat 📋 Mathlib.Algebra.Category.Grp.Basic
: Type (u + 1) - AddGrpCat.carrier 📋 Mathlib.Algebra.Category.Grp.Basic
(self : AddGrpCat) : Type u - AddGrpCat.instCategory 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.Category.{u, u + 1} AddGrpCat - AddGrpCat.instInhabited 📋 Mathlib.Algebra.Category.Grp.Basic
: Inhabited AddGrpCat - AddCommGrpCat.instCoeAddGrpCat 📋 Mathlib.Algebra.Category.Grp.Basic
: Coe AddCommGrpCat AddGrpCat - AddGrpCat.Hom 📋 Mathlib.Algebra.Category.Grp.Basic
(A B : AddGrpCat) : Type u - AddGrpCat.instCoeMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: Coe AddGrpCat AddMonCat - AddGrpCat.instCoeSortType 📋 Mathlib.Algebra.Category.Grp.Basic
: CoeSort AddGrpCat (Type u) - AddGrpCat.mk 📋 Mathlib.Algebra.Category.Grp.Basic
(carrier : Type u) [str : AddGroup carrier] : AddGrpCat - AddGrpCat.of 📋 Mathlib.Algebra.Category.Grp.Basic
(M : Type u) [AddGroup M] : AddGrpCat - AddGrpCat.str 📋 Mathlib.Algebra.Category.Grp.Basic
(self : AddGrpCat) : AddGroup ↑self - AddGrpCat.uliftFunctor 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.Functor AddGrpCat AddGrpCat - AddGrpCat.instZeroHom 📋 Mathlib.Algebra.Category.Grp.Basic
(G H : AddGrpCat) : Zero (G ⟶ H) - AddGrpCat.uliftFunctor_obj 📋 Mathlib.Algebra.Category.Grp.Basic
(X : AddGrpCat) : AddGrpCat.uliftFunctor.obj X = AddGrpCat.of (ULift.{u, v} ↑X) - AddGrpCat.Hom.hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (f : X.Hom Y) : ↑X →+ ↑Y - AddGrpCat.Hom.hom' 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : AddGrpCat} (self : A.Hom B) : ↑A →+ ↑B - AddGrpCat.ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddGroup X] [AddGroup Y] (f : X →+ Y) : AddGrpCat.of X ⟶ AddGrpCat.of Y - AddGrpCat.ofHom_id 📋 Mathlib.Algebra.Category.Grp.Basic
{X : Type u} [AddGroup X] : AddGrpCat.ofHom (AddMonoidHom.id X) = CategoryTheory.CategoryStruct.id (AddGrpCat.of X) - AddGrpCat.ofHom_hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (f : X ⟶ Y) : AddGrpCat.ofHom (AddGrpCat.Hom.hom f) = f - AddEquiv.toAddGrpIso 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (e : ↑X ≃+ ↑Y) : X ≅ Y - CategoryTheory.Iso.addGroupIsoToAddEquiv 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (i : X ≅ Y) : ↑X ≃+ ↑Y - addEquivIsoAddGroupIso 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} : ↑X ≃+ ↑Y ≅ X ≅ Y - AddGrpCat.Hom.ext 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : AddGrpCat} {x y : A.Hom B} (hom' : x.hom' = y.hom') : x = y - AddGrpCat.Hom.ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : AddGrpCat} {x y : A.Hom B} : x = y ↔ x.hom' = y.hom' - AddGrpCat.hom_id 📋 Mathlib.Algebra.Category.Grp.Basic
{X : AddGrpCat} : AddGrpCat.Hom.hom (CategoryTheory.CategoryStruct.id X) = AddMonoidHom.id ↑X - AddGrpCat.ofHom_injective 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddGroup X] [AddGroup Y] : Function.Injective fun f => AddGrpCat.ofHom f - AddGrpCat.hom_ext 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} {f g : X ⟶ Y} (hf : AddGrpCat.Hom.hom f = AddGrpCat.Hom.hom g) : f = g - AddGrpCat.hom_ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} {f g : X ⟶ Y} : f = g ↔ AddGrpCat.Hom.hom f = AddGrpCat.Hom.hom g - AddGrpCat.instConcreteCategoryAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.ConcreteCategory AddGrpCat fun x1 x2 => ↑x1 →+ ↑x2 - AddGrpCat.forget_reflects_isos 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget AddGrpCat).ReflectsIsomorphisms - AddEquiv.toAddGrpIso_hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (e : ↑X ≃+ ↑Y) : e.toAddGrpIso.hom = AddGrpCat.ofHom e.toAddMonoidHom - AddGrpCat.hom_comp 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y T : AddGrpCat} (f : X ⟶ Y) (g : Y ⟶ T) : AddGrpCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (AddGrpCat.Hom.hom g).comp (AddGrpCat.Hom.hom f) - AddGrpCat.hasForgetToAddMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.HasForget₂ AddGrpCat AddMonCat - AddGrpCat.ofHom_comp 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y Z : Type u} [AddGroup X] [AddGroup Y] [AddGroup Z] (f : X →+ Y) (g : Y →+ Z) : AddGrpCat.ofHom (g.comp f) = CategoryTheory.CategoryStruct.comp (AddGrpCat.ofHom f) (AddGrpCat.ofHom g) - AddGrpCat.fullyFaihtfulForget₂ToAddMonCat 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ AddGrpCat AddMonCat).FullyFaithful - AddGrpCat.instFullMonCatForget₂AddMonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ AddGrpCat AddMonCat).Full - AddEquiv.toAddGrpIso_inv 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (e : ↑X ≃+ ↑Y) : e.toAddGrpIso.inv = AddGrpCat.ofHom e.symm.toAddMonoidHom - AddCommGrpCat.hasForgetToAddGroup 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.HasForget₂ AddCommGrpCat AddGrpCat - AddCommGrpCat.fullyFaihtfulForget₂ToAddGrp 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).FullyFaithful - AddCommGrpCat.instFullAddGrpCatForget₂AddMonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).Full - AddGrpCat.id_apply 📋 Mathlib.Algebra.Category.Grp.Basic
(X : AddGrpCat) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) x = x - AddGrpCat.coe_id 📋 Mathlib.Algebra.Category.Grp.Basic
{X : AddGrpCat} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - AddGrpCat.zero_apply 📋 Mathlib.Algebra.Category.Grp.Basic
(G H : AddGrpCat) (g : ↑G) : (CategoryTheory.ConcreteCategory.hom 0) g = 0 - AddGrpCat.ofHom_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddGroup X] [AddGroup Y] (f : X →+ Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (AddGrpCat.ofHom f)) x = f x - AddGrpCat.uliftFunctor_map 📋 Mathlib.Algebra.Category.Grp.Basic
{x✝ x✝¹ : AddGrpCat} (f : x✝ ⟶ x✝¹) : AddGrpCat.uliftFunctor.map f = AddGrpCat.ofHom (AddEquiv.ulift.symm.toAddMonoidHom.comp ((AddGrpCat.Hom.hom f).comp AddEquiv.ulift.toAddMonoidHom)) - AddGrpCat.hom_neg_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (e : X ≅ Y) (s : ↑Y) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - AddGrpCat.neg_hom_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} (e : X ≅ Y) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - AddGrpCat.ext 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - AddGrpCat.ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : AddGrpCat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - AddGrpCat.forget₂_map_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddGroup X] [AddGroup Y] (f : X →+ Y) : (CategoryTheory.forget₂ AddGrpCat AddMonCat).map (AddGrpCat.ofHom f) = AddMonCat.ofHom f - AddGrpCat.comp_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y T : AddGrpCat} (f : X ⟶ Y) (g : Y ⟶ T) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) x = (CategoryTheory.ConcreteCategory.hom g) ((CategoryTheory.ConcreteCategory.hom f) x) - AddGrpCat.coe_comp 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y Z : AddGrpCat} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - AddCommGrpCat.forget₂_addGrp_map_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [AddCommGroup X] [AddCommGroup Y] (f : X →+ Y) : (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).map (AddCommGrpCat.ofHom f) = AddGrpCat.ofHom f - AddGrpCat.forget₂_map 📋 Mathlib.Algebra.Category.Grp.Basic
{R S : AddGrpCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ AddGrpCat AddMonCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ AddGrpCat AddMonCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - AddCommGrpCat.forget₂_map 📋 Mathlib.Algebra.Category.Grp.Basic
{R S : AddCommGrpCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - AddCommGrpCat.FilteredColimits.G 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddCommGrpCat) : AddGrpCat - AddGrpCat.FilteredColimits.G 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : AddMonCat - AddGrpCat.FilteredColimits.colimit 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : AddGrpCat - AddGrpCat.FilteredColimits.colimitCocone 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.Limits.Cocone F - AddGrpCat.FilteredColimits.colimitAddGroup 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : AddGroup ↑(AddGrpCat.FilteredColimits.G F) - AddGrpCat.FilteredColimits.colimitNeg 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : Neg ↑(AddGrpCat.FilteredColimits.G F) - AddGrpCat.FilteredColimits.colimitCoconeIsColimit 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.Limits.IsColimit (AddGrpCat.FilteredColimits.colimitCocone F) - AddGrpCat.FilteredColimits.colimitNegAux 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (x : (j : J) × ↑(F.obj j)) : ↑(AddGrpCat.FilteredColimits.G F) - AddGrpCat.FilteredColimits.G.mk 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) : (j : J) × ↑(F.obj j) → ↑(AddGrpCat.FilteredColimits.G F) - AddGrpCat.FilteredColimits.forget_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget AddGrpCat) - AddGrpCat.FilteredColimits.forget₂AddMon_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddGrpCat AddMonCat) - AddGrpCat.FilteredColimits.colimit_zero_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (j : J) : 0 = AddGrpCat.FilteredColimits.G.mk F ⟨j, 0⟩ - AddGrpCat.FilteredColimits.colimitNegAux_eq_of_rel 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (x y : (j : J) × ↑(F.obj j)) (h : CategoryTheory.Limits.Types.FilteredColimit.Rel (F.comp (CategoryTheory.forget AddGrpCat)) x y) : AddGrpCat.FilteredColimits.colimitNegAux F x = AddGrpCat.FilteredColimits.colimitNegAux F y - AddCommGrpCat.FilteredColimits.forget₂AddGroup_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddGrpCat.FilteredColimits.colimit_neg_mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (x : (j : J) × ↑(F.obj j)) : -AddGrpCat.FilteredColimits.G.mk F x = AddGrpCat.FilteredColimits.G.mk F ⟨x.fst, -x.snd⟩ - AddGrpCat.FilteredColimits.colimit_add_mk_eq' 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) {j : J} (x y : ↑(F.obj j)) : AddGrpCat.FilteredColimits.G.mk F ⟨j, x⟩ + AddGrpCat.FilteredColimits.G.mk F ⟨j, y⟩ = AddGrpCat.FilteredColimits.G.mk F ⟨j, x + y⟩ - AddGrpCat.FilteredColimits.G.mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (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) : AddGrpCat.FilteredColimits.G.mk F x = AddGrpCat.FilteredColimits.G.mk F y - AddGrpCat.FilteredColimits.colimit_add_mk_eq 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J AddGrpCat) (x y : (j : J) × ↑(F.obj j)) (k : J) (f : x.fst ⟶ k) (g : y.fst ⟶ k) : AddGrpCat.FilteredColimits.G.mk F x + AddGrpCat.FilteredColimits.G.mk F y = AddGrpCat.FilteredColimits.G.mk F ⟨k, (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd + (CategoryTheory.ConcreteCategory.hom (F.map g)) y.snd⟩ - AddGrpCat.forget_isCorepresentable 📋 Mathlib.Algebra.Category.Grp.ForgetCorepresentable
: (CategoryTheory.forget AddGrpCat).IsCorepresentable - AddGrpCat.coyonedaObjIsoForget 📋 Mathlib.Algebra.Category.Grp.ForgetCorepresentable
: CategoryTheory.coyoneda.obj (Opposite.op (AddGrpCat.of (ULift.{u, 0} ℤ))) ≅ CategoryTheory.forget AddGrpCat - AddGrpCat.hasLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.HasLimits AddGrpCat - AddGrpCat.hasLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.HasLimitsOfSize.{w, v, u, u + 1} AddGrpCat - AddGrpCat.hasLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.HasLimitsOfShape J AddGrpCat - AddGrpCat.sectionsAddSubgroup 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) : AddSubgroup ((j : J) → ↑(F.obj j)) - AddGrpCat.forget_createsLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.CreatesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget AddGrpCat) - AddGrpCat.forget_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget AddGrpCat) - AddGrpCat.forget_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget AddGrpCat) - AddGrpCat.forget_createsLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.forget AddGrpCat) - AddGrpCat.forget_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] [Small.{u, v} J] : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.forget AddGrpCat) - AddGrpCat.forget_createsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget AddGrpCat) - AddGrpCat.addGroupObj 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) (j : J) : AddGroup ((F.comp (CategoryTheory.forget AddGrpCat)).obj j) - AddGrpCat.forget₂Mon_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ AddGrpCat AddMonCat) - AddGrpCat.forget₂AddMonPreservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
[UnivLE.{v, u}] : CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ AddGrpCat AddMonCat) - AddGrpCat.Forget₂.createsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ AddGrpCat AddMonCat) - AddCommGrpCat.forget₂AddGroup_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddCommGrpCat.forget₂AddGroup_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddCommGrpCat.instReflectsIsomorphismsAddGrpCatForget₂AddMonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Limits
: (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat).ReflectsIsomorphisms - AddCommGrpCat.forget₂AddGroup_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddCommGrpCat.forget₂AddGroup_preservesLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommGrpCat) : CategoryTheory.Limits.PreservesLimit F (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddCommGrpCat.Forget₂.createsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommGrpCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ AddCommGrpCat AddGrpCat) - AddGrpCat.sectionsAddGroup 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) : AddGroup ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections - AddGrpCat.hasLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections] : CategoryTheory.Limits.HasLimit F - AddGrpCat.limitCone 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections] : CategoryTheory.Limits.Cone F - AddGrpCat.hasLimit_iff_small_sections 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.Limits.HasLimit F ↔ Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections - AddGrpCat.limitConeIsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections] : CategoryTheory.Limits.IsLimit (AddGrpCat.limitCone F) - AddGrpCat.limitAddGroup 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections] : AddGroup (CategoryTheory.Limits.Types.Small.limitCone (F.comp (CategoryTheory.forget AddGrpCat))).pt - AddGrpCat.instSmallElemForallObjCompMonCatForget₂AddMonoidHomCarrierCarrierForgetSections 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections] : Small.{u, max u v} ↑((F.comp (CategoryTheory.forget₂ AddGrpCat AddMonCat)).comp (CategoryTheory.forget AddMonCat)).sections - AddGrpCat.sectionsπAddMonoidHom 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddGrpCat) (j : J) : ↑(F.comp (CategoryTheory.forget AddGrpCat)).sections →+ ↑(F.obj j) - groupAddGroupEquivalence 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: GrpCat ≌ AddGrpCat - AddGrpCat.toGrp 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: CategoryTheory.Functor AddGrpCat GrpCat - GrpCat.toAddGrp 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: CategoryTheory.Functor GrpCat AddGrpCat - groupAddGroupEquivalence_functor 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: groupAddGroupEquivalence.functor = GrpCat.toAddGrp - groupAddGroupEquivalence_inverse 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: groupAddGroupEquivalence.inverse = AddGrpCat.toGrp - AddGrpCat.toGrp_obj_coe 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
(X : AddGrpCat) : ↑(AddGrpCat.toGrp.obj X) = Multiplicative ↑X - GrpCat.toAddGrp_obj_coe 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
(X : GrpCat) : ↑(GrpCat.toAddGrp.obj X) = Additive ↑X - groupAddGroupEquivalence_unitIso 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: groupAddGroupEquivalence.unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id GrpCat) - groupAddGroupEquivalence_counitIso 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
: groupAddGroupEquivalence.counitIso = CategoryTheory.Iso.refl (AddGrpCat.toGrp.comp GrpCat.toAddGrp) - AddGrpCat.toGrp_map 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
{x✝ x✝¹ : AddGrpCat} (f : x✝ ⟶ x✝¹) : AddGrpCat.toGrp.map f = GrpCat.ofHom (AddMonoidHom.toMultiplicative (AddGrpCat.Hom.hom f)) - GrpCat.toAddGrp_map 📋 Mathlib.Algebra.Category.Grp.EquivalenceGroupAddGroup
{x✝ x✝¹ : GrpCat} (f : x✝ ⟶ x✝¹) : GrpCat.toAddGrp.map f = AddGrpCat.ofHom (MonoidHom.toAdditive (GrpCat.Hom.hom f)) - AddGrpCat.epi_iff_range_eq_top 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : AddGrpCat} (f : A ⟶ B) : CategoryTheory.Epi f ↔ (AddGrpCat.Hom.hom f).range = ⊤ - AddGrpCat.ker_eq_bot_of_mono 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : AddGrpCat} (f : A ⟶ B) [CategoryTheory.Mono f] : (AddGrpCat.Hom.hom f).ker = ⊥ - AddGrpCat.mono_iff_ker_eq_bot 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : AddGrpCat} (f : A ⟶ B) : CategoryTheory.Mono f ↔ (AddGrpCat.Hom.hom f).ker = ⊥ - AddGrpCat.forget_grp_preserves_epi 📋 Mathlib.Algebra.Category.Grp.EpiMono
: (CategoryTheory.forget AddGrpCat).PreservesEpimorphisms - AddGrpCat.forget_grp_preserves_mono 📋 Mathlib.Algebra.Category.Grp.EpiMono
: (CategoryTheory.forget AddGrpCat).PreservesMonomorphisms - AddGrpCat.epi_iff_surjective 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : AddGrpCat} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f) - AddGrpCat.mono_iff_injective 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : AddGrpCat} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f) - AddGrpCat.hasZeroObject 📋 Mathlib.Algebra.Category.Grp.Zero
: CategoryTheory.Limits.HasZeroObject AddGrpCat - AddGrpCat.isZero_of_subsingleton 📋 Mathlib.Algebra.Category.Grp.Zero
(G : AddGrpCat) [Subsingleton ↑G] : CategoryTheory.Limits.IsZero G - AddGrpCat.subsingleton_of_isZero 📋 Mathlib.Algebra.Category.Grp.Zero
{G : AddGrpCat} (h : CategoryTheory.Limits.IsZero G) : Subsingleton ↑G - AddGrpCat.isZero_iff_subsingleton 📋 Mathlib.Algebra.Category.Grp.Zero
{G : AddGrpCat} : CategoryTheory.Limits.IsZero G ↔ Subsingleton ↑G - AddGrpCat.isZero_of_iff_subsingleton 📋 Mathlib.Algebra.Category.Grp.Zero
{G : Type u_1} [AddGroup G] : CategoryTheory.Limits.IsZero (AddGrpCat.of G) ↔ Subsingleton G - AddGrpCat.cartesianMonoidalCategoryAddGrp 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
: CategoryTheory.CartesianMonoidalCategory AddGrpCat - AddGrpCat.instBraidedCategory 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
: CategoryTheory.BraidedCategory AddGrpCat - AddGrpCat.binaryProductLimitCone 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : AddGrpCat) : CategoryTheory.Limits.LimitCone (CategoryTheory.Limits.pair G H) - AddGrpCat.tensorObj_eq 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : AddGrpCat) : CategoryTheory.MonoidalCategoryStruct.tensorObj G H = AddGrpCat.of (↑G × ↑H) - AddGrpCat.binaryProductLimitCone_cone_pt 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : AddGrpCat) : (G.binaryProductLimitCone H).cone.pt = AddGrpCat.of (↑G × ↑H) - AddGrpCat.instBraidedForgetAddMonoidHomCarrier 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
: (CategoryTheory.forget AddGrpCat).Braided - AddGrpCat.binaryProductLimitCone_isLimit_lift 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : AddGrpCat) (t : CategoryTheory.Limits.Cone (CategoryTheory.Limits.pair G H)) : (G.binaryProductLimitCone H).isLimit.lift t = AddGrpCat.ofHom ((AddGrpCat.Hom.hom (CategoryTheory.Limits.BinaryFan.fst t)).prod (AddGrpCat.Hom.hom (CategoryTheory.Limits.BinaryFan.snd t))) - AddGrpCat.μ_forget_apply 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
{G H : AddGrpCat} (p : ↑G) (q : ↑H) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Functor.LaxMonoidal.μ (CategoryTheory.forget AddGrpCat) G H)) (p, q) = (p, q) - FiniteAddGrp.toAddGrp 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(self : FiniteAddGrp.{u}) : AddGrpCat - FiniteAddGrp.mk 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(toAddGrp : AddGrpCat) [isFinite : Finite ↑toAddGrp] : FiniteAddGrp.{u} - AddGrpCat.instCreatesLimitsOfSizeUliftFunctor 📋 Mathlib.Algebra.Category.Grp.Ulift
: CategoryTheory.CreatesLimitsOfSize.{w, u, u, max u v, u + 1, max (u + 1) (v + 1)} AddGrpCat.uliftFunctor - AddGrpCat.instFaithfulUliftFunctor 📋 Mathlib.Algebra.Category.Grp.Ulift
: AddGrpCat.uliftFunctor.Faithful - AddGrpCat.instFullUliftFunctor 📋 Mathlib.Algebra.Category.Grp.Ulift
: AddGrpCat.uliftFunctor.Full - AddGrpCat.uliftFunctorFullyFaithful 📋 Mathlib.Algebra.Category.Grp.Ulift
: AddGrpCat.uliftFunctor.FullyFaithful - AddGrpCat.uliftFunctor_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Ulift
: CategoryTheory.Limits.PreservesLimitsOfSize.{w', w, u, max u v, u + 1, max (u + 1) (v + 1)} AddGrpCat.uliftFunctor - AddGrpCat.uliftFunctor_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Ulift
{J : Type w} [CategoryTheory.Category.{w', w} J] : CategoryTheory.Limits.PreservesLimitsOfShape J AddGrpCat.uliftFunctor - AddGrpCat.uliftFunctor_preservesLimit 📋 Mathlib.Algebra.Category.Grp.Ulift
{J : Type w} [CategoryTheory.Category.{w', w} J] (K : CategoryTheory.Functor J AddGrpCat) : CategoryTheory.Limits.PreservesLimit K AddGrpCat.uliftFunctor - CategoryTheory.yonedaAddGrpObj 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.AddGrpObj G] : CategoryTheory.Functor Cᵒᵖ AddGrpCat - CategoryTheory.yonedaAddGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.Functor (CategoryTheory.AddGrp C) (CategoryTheory.Functor Cᵒᵖ AddGrpCat) - CategoryTheory.instFaithfulAddGrpFunctorOppositeAddGrpCatYonedaAddGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaAddGrp.Faithful - CategoryTheory.instFullAddGrpFunctorOppositeAddGrpCatYonedaAddGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaAddGrp.Full - CategoryTheory.yonedaAddGrpFullyFaithful 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaAddGrp.FullyFaithful - CategoryTheory.yonedaAddGrpObj_obj_coe 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.AddGrpObj G] (X : Cᵒᵖ) : ↑((CategoryTheory.yonedaAddGrpObj G).obj X) = (Opposite.unop X ⟶ G) - CategoryTheory.yonedaAddGrp_obj 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : CategoryTheory.AddGrp C) : CategoryTheory.yonedaAddGrp.obj G = CategoryTheory.yonedaAddGrpObj G.X - CategoryTheory.yonedaAddGrpObjRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.AddGrpObj G] : ((CategoryTheory.yonedaAddGrpObj G).comp (CategoryTheory.forget AddGrpCat)).RepresentableBy G - CategoryTheory.AddGrpObj.ofRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ AddGrpCat) (α : (F.comp (CategoryTheory.forget AddGrpCat)).RepresentableBy X) : CategoryTheory.AddGrpObj X - CategoryTheory.yonedaAddGrpObjIsoOfRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ AddGrpCat) (α : (F.comp (CategoryTheory.forget AddGrpCat)).RepresentableBy X) : CategoryTheory.yonedaAddGrpObj X ≅ F - CategoryTheory.essImage_yonedaAddGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaAddGrp.essImage = fun F => (F.comp (CategoryTheory.forget AddGrpCat)).IsRepresentable - CategoryTheory.yonedaAddGrpObj_map 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.AddGrpObj G] {X✝ Y✝ : Cᵒᵖ} (φ : X✝ ⟶ Y✝) : (CategoryTheory.yonedaAddGrpObj G).map φ = AddGrpCat.ofHom (AddMonCat.Hom.hom ((CategoryTheory.yonedaAddMonObj G).map φ)) - CategoryTheory.yonedaAddGrp_map_app 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {G H : CategoryTheory.AddGrp C} (ψ : G ⟶ H) (Y : Cᵒᵖ) : (CategoryTheory.yonedaAddGrp.map ψ).app Y = AddGrpCat.ofHom (AddMonCat.Hom.hom ((CategoryTheory.yonedaAddMon.map ψ.hom).app Y)) - CategoryTheory.yonedaAddGrp_naturality 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {G H X Y : C} [CategoryTheory.AddGrpObj G] [CategoryTheory.AddGrpObj H] (α : CategoryTheory.yonedaAddGrpObj G ⟶ CategoryTheory.yonedaAddGrpObj H) (f : X ⟶ Y) (g : Y ⟶ G) : (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.yonedaAddGrp_naturality_assoc 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {G H X Y : C} [CategoryTheory.AddGrpObj G] [CategoryTheory.AddGrpObj H] (α : CategoryTheory.yonedaAddGrpObj G ⟶ CategoryTheory.yonedaAddGrpObj H) (f : X ⟶ Y) (g : Y ⟶ G) {Z : C} (h : H ⟶ 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.yonedaAddGrpObjIsoOfRepresentableBy_hom 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ AddGrpCat) (α : (F.comp (CategoryTheory.forget AddGrpCat)).RepresentableBy X) : (CategoryTheory.yonedaAddGrpObjIsoOfRepresentableBy X F α).hom = { app := fun X_1 => AddGrpCat.ofHom ↑{ toEquiv := α.homEquiv, map_add' := ⋯ }, naturality := ⋯ } - CategoryTheory.yonedaAddGrpObjIsoOfRepresentableBy_inv 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ AddGrpCat) (α : (F.comp (CategoryTheory.forget AddGrpCat)).RepresentableBy X) : (CategoryTheory.yonedaAddGrpObjIsoOfRepresentableBy X F α).inv = { app := fun X_1 => AddGrpCat.ofHom ↑{ toEquiv := α.homEquiv.symm, map_add' := ⋯ }, naturality := ⋯ } - ProfiniteAddGrp.instHasForget₂ContinuousAddMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteAddGrpCatAddMonoidHomCarrier 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.HasForget₂ ProfiniteAddGrp.{u_1} AddGrpCat - smoothPresheafAddGroup 📋 Mathlib.Geometry.Manifold.Sheaf.Smooth
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {EM : Type u_2} [NormedAddCommGroup EM] [NormedSpace 𝕜 EM] {HM : Type u_3} [TopologicalSpace HM] (IM : ModelWithCorners 𝕜 EM HM) {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {H : Type u_5} [TopologicalSpace H] (I : ModelWithCorners 𝕜 E H) (M : Type u) [TopologicalSpace M] [ChartedSpace HM M] (G : Type u) [TopologicalSpace G] [ChartedSpace H G] [AddGroup G] [LieAddGroup I (↑⊤) G] : TopCat.Presheaf AddGrpCat (TopCat.of M) - smoothSheafAddGroup 📋 Mathlib.Geometry.Manifold.Sheaf.Smooth
{𝕜 : Type u_1} [NontriviallyNormedField 𝕜] {EM : Type u_2} [NormedAddCommGroup EM] [NormedSpace 𝕜 EM] {HM : Type u_3} [TopologicalSpace HM] (IM : ModelWithCorners 𝕜 EM HM) {E : Type u_4} [NormedAddCommGroup E] [NormedSpace 𝕜 E] {H : Type u_5} [TopologicalSpace H] (I : ModelWithCorners 𝕜 E H) (M : Type u) [TopologicalSpace M] [ChartedSpace HM M] (G : Type u) [TopologicalSpace G] [ChartedSpace H G] [AddGroup G] [LieAddGroup I (↑⊤) G] : TopCat.Sheaf AddGrpCat (TopCat.of M) - ProfiniteAddGrp.ProfiniteCompletion.completion 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : ProfiniteAddGrp.{u} - ProfiniteAddGrp.ProfiniteCompletion.etaFn 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) (x : ↑G) : ↑(ProfiniteAddGrp.ProfiniteCompletion.completion G).toProfinite.toTop - ProfiniteAddGrp.ProfiniteCompletion.etaFn_injective_iff_residuallyFinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : Function.Injective (ProfiniteAddGrp.ProfiniteCompletion.etaFn G) ↔ AddGroup.ResiduallyFinite ↑G - ProfiniteAddGrp.ProfiniteCompletion.eta 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : G ⟶ AddGrpCat.of ↑(ProfiniteAddGrp.ProfiniteCompletion.completion G).toProfinite.toTop - ProfiniteAddGrp.ProfiniteCompletion.diagram 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : CategoryTheory.Functor (FiniteIndexNormalAddSubgroup ↑G) ProfiniteAddGrp.{u} - ProfiniteAddGrp.ProfiniteCompletion.finiteAddGrpDiagram 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : CategoryTheory.Functor (FiniteIndexNormalAddSubgroup ↑G) FiniteAddGrp.{u} - ProfiniteAddGrp.ProfiniteCompletion.denseRange 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : DenseRange (ProfiniteAddGrp.ProfiniteCompletion.etaFn G) - ProfiniteAddGrp.ProfiniteCompletion.mono_eta_iff_residuallyFinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : AddGrpCat) : CategoryTheory.Mono (ProfiniteAddGrp.ProfiniteCompletion.eta G) ↔ AddGroup.ResiduallyFinite ↑G - ProfiniteAddGrp.ProfiniteCompletion.preimage 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : AddGrpCat} {P : ProfiniteAddGrp.{u}} (f : G ⟶ AddGrpCat.of ↑P.toProfinite.toTop) (H : OpenNormalAddSubgroup ↑P.toProfinite.toTop) : FiniteIndexNormalAddSubgroup ↑G - ProfiniteAddGrp.ProfiniteCompletion.preimage_le 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : AddGrpCat} {P : ProfiniteAddGrp.{u}} {f : G ⟶ AddGrpCat.of ↑P.toProfinite.toTop} {H K : OpenNormalAddSubgroup ↑P.toProfinite.toTop} (h : H ≤ K) : ProfiniteAddGrp.ProfiniteCompletion.preimage f H ≤ ProfiniteAddGrp.ProfiniteCompletion.preimage f K - ProfiniteAddGrp.ProfiniteCompletion.quotientMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : AddGrpCat} {P : ProfiniteAddGrp.{u}} (f : G ⟶ AddGrpCat.of ↑P.toProfinite.toTop) (H : OpenNormalAddSubgroup ↑P.toProfinite.toTop) : FiniteAddGrp.of (↑G ⧸ (ProfiniteAddGrp.ProfiniteCompletion.preimage f H).toAddSubgroup) ⟶ FiniteAddGrp.of (↑P.toProfinite.toTop ⧸ ↑H.toOpenAddSubgroup) - ProfiniteAddGrp.ProfiniteCompletion.lift_unique 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : AddGrpCat} {P : ProfiniteAddGrp.{u}} (f g : ProfiniteAddGrp.ProfiniteCompletion.completion G ⟶ P) (h : CategoryTheory.CategoryStruct.comp (ProfiniteAddGrp.ProfiniteCompletion.eta G) ((CategoryTheory.forget₂ ProfiniteAddGrp.{u} AddGrpCat).map f) = CategoryTheory.CategoryStruct.comp (ProfiniteAddGrp.ProfiniteCompletion.eta G) ((CategoryTheory.forget₂ ProfiniteAddGrp.{u} AddGrpCat).map g)) : f = g
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