Loogle!
Result
Found 194 declarations mentioning GrpCat.carrier.
- GrpCat.carrier 📋 Mathlib.Algebra.Category.Grp.Basic
(self : GrpCat) : Type u - GrpCat.str 📋 Mathlib.Algebra.Category.Grp.Basic
(self : GrpCat) : Group ↑self - GrpCat.coe_of 📋 Mathlib.Algebra.Category.Grp.Basic
(R : Type u) [Group R] : ↑(GrpCat.of R) = R - GrpCat.uliftFunctor_obj 📋 Mathlib.Algebra.Category.Grp.Basic
(X : GrpCat) : GrpCat.uliftFunctor.obj X = GrpCat.of (ULift.{u, v} ↑X) - GrpCat.Hom.hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (f : X.Hom Y) : ↑X →* ↑Y - GrpCat.Hom.hom' 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : GrpCat} (self : A.Hom B) : ↑A →* ↑B - GrpCat.Hom.Simps.hom 📋 Mathlib.Algebra.Category.Grp.Basic
(X Y : GrpCat) (f : X.Hom Y) : ↑X →* ↑Y - GrpCat.ofHom_hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (f : X ⟶ Y) : GrpCat.ofHom (GrpCat.Hom.hom f) = f - MulEquiv.toGrpIso 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (e : ↑X ≃* ↑Y) : X ≅ Y - CategoryTheory.Iso.groupIsoToMulEquiv 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (i : X ≅ Y) : ↑X ≃* ↑Y - mulEquivIsoGroupIso 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} : ↑X ≃* ↑Y ≅ X ≅ Y - GrpCat.Hom.ext 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : GrpCat} {x y : A.Hom B} (hom' : x.hom' = y.hom') : x = y - GrpCat.Hom.ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{A B : GrpCat} {x y : A.Hom B} : x = y ↔ x.hom' = y.hom' - GrpCat.hom_id 📋 Mathlib.Algebra.Category.Grp.Basic
{X : GrpCat} : GrpCat.Hom.hom (CategoryTheory.CategoryStruct.id X) = MonoidHom.id ↑X - GrpCat.hom_ext 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} {f g : X ⟶ Y} (hf : GrpCat.Hom.hom f = GrpCat.Hom.hom g) : f = g - GrpCat.hom_ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} {f g : X ⟶ Y} : f = g ↔ GrpCat.Hom.hom f = GrpCat.Hom.hom g - GrpCat.instConcreteCategoryMonoidHomCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.ConcreteCategory GrpCat fun x1 x2 => ↑x1 →* ↑x2 - GrpCat.forget_reflects_isos 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget GrpCat).ReflectsIsomorphisms - GrpCat.hom_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{R S : Type u} [Group R] [Group S] (f : R →* S) : GrpCat.Hom.hom (GrpCat.ofHom f) = f - MulEquiv.toGrpIso_hom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (e : ↑X ≃* ↑Y) : e.toGrpIso.hom = GrpCat.ofHom e.toMonoidHom - GrpCat.hom_comp 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y T : GrpCat} (f : X ⟶ Y) (g : Y ⟶ T) : GrpCat.Hom.hom (CategoryTheory.CategoryStruct.comp f g) = (GrpCat.Hom.hom g).comp (GrpCat.Hom.hom f) - 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 - MulEquiv.toGrpIso_inv 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (e : ↑X ≃* ↑Y) : e.toGrpIso.inv = GrpCat.ofHom e.symm.toMonoidHom - CommGrpCat.hasForgetToGroup 📋 Mathlib.Algebra.Category.Grp.Basic
: CategoryTheory.HasForget₂ CommGrpCat GrpCat - CommGrpCat.fullyFaithfulForget₂ToGrp 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ CommGrpCat GrpCat).FullyFaithful - CommGrpCat.instFullGrpCatForget₂MonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Basic
: (CategoryTheory.forget₂ CommGrpCat GrpCat).Full - GrpCat.id_apply 📋 Mathlib.Algebra.Category.Grp.Basic
(X : GrpCat) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) x = x - GrpCat.coe_id 📋 Mathlib.Algebra.Category.Grp.Basic
{X : GrpCat} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.id X)) = id - GrpCat.one_apply 📋 Mathlib.Algebra.Category.Grp.Basic
(G H : GrpCat) (g : ↑G) : (CategoryTheory.ConcreteCategory.hom 1) g = 1 - GrpCat.ofHom_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [Group X] [Group Y] (f : X →* Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (GrpCat.ofHom f)) x = f x - GrpCat.uliftFunctor_map 📋 Mathlib.Algebra.Category.Grp.Basic
{x✝ x✝¹ : GrpCat} (f : x✝ ⟶ x✝¹) : GrpCat.uliftFunctor.map f = GrpCat.ofHom (MulEquiv.ulift.symm.toMonoidHom.comp ((GrpCat.Hom.hom f).comp MulEquiv.ulift.toMonoidHom)) - GrpCat.hom_inv_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (e : X ≅ Y) (s : ↑Y) : (CategoryTheory.ConcreteCategory.hom e.hom) ((CategoryTheory.ConcreteCategory.hom e.inv) s) = s - GrpCat.inv_hom_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} (e : X ≅ Y) (x : ↑X) : (CategoryTheory.ConcreteCategory.hom e.inv) ((CategoryTheory.ConcreteCategory.hom e.hom) x) = x - GrpCat.ext 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} {f g : X ⟶ Y} (w : ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x) : f = g - GrpCat.ext_iff 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : GrpCat} {f g : X ⟶ Y} : f = g ↔ ∀ (x : ↑X), (CategoryTheory.ConcreteCategory.hom f) x = (CategoryTheory.ConcreteCategory.hom g) x - 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.comp_apply 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y T : GrpCat} (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) - GrpCat.coe_comp 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y Z : GrpCat} {f : X ⟶ Y} {g : Y ⟶ Z} : ⇑(CategoryTheory.ConcreteCategory.hom (CategoryTheory.CategoryStruct.comp f g)) = ⇑(CategoryTheory.ConcreteCategory.hom g) ∘ ⇑(CategoryTheory.ConcreteCategory.hom f) - CommGrpCat.forget₂_grp_map_ofHom 📋 Mathlib.Algebra.Category.Grp.Basic
{X Y : Type u} [CommGroup X] [CommGroup Y] (f : X →* Y) : (CategoryTheory.forget₂ CommGrpCat GrpCat).map (CommGrpCat.ofHom f) = GrpCat.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 - CommGrpCat.forget₂_map 📋 Mathlib.Algebra.Category.Grp.Basic
{R S : CommGrpCat} (f : R ⟶ S) (x : ↑((CategoryTheory.forget₂ CommGrpCat GrpCat).obj R)) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.forget₂ CommGrpCat GrpCat).map f)) x = (CategoryTheory.ConcreteCategory.hom f) x - CommGrpCat.FilteredColimits.colimitCommGroup 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
{J : Type v} [CategoryTheory.SmallCategory J] [CategoryTheory.IsFiltered J] (F : CategoryTheory.Functor J CommGrpCat) : CommGroup ↑(CommGrpCat.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_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget GrpCat) - 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 - CommGrpCat.FilteredColimits.forget₂Group_preservesFilteredColimits 📋 Mathlib.Algebra.Category.Grp.FilteredColimits
: CategoryTheory.Limits.PreservesFilteredColimits (CategoryTheory.forget₂ CommGrpCat GrpCat) - 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⟩ - GrpCat.forget_isCorepresentable 📋 Mathlib.Algebra.Category.Grp.ForgetCorepresentable
: (CategoryTheory.forget GrpCat).IsCorepresentable - GrpCat.coyonedaObjIsoForget 📋 Mathlib.Algebra.Category.Grp.ForgetCorepresentable
: CategoryTheory.coyoneda.obj (Opposite.op (GrpCat.of (ULift.{u, 0} (Multiplicative ℤ)))) ≅ CategoryTheory.forget GrpCat - GrpCat.sectionsSubgroup 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) : Subgroup ((j : J) → ↑(F.obj j)) - GrpCat.forget_createsLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.CreatesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget GrpCat) - GrpCat.forget_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget GrpCat) - GrpCat.forget_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget GrpCat) - GrpCat.forget_createsLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.CreatesLimitsOfShape J (CategoryTheory.forget GrpCat) - GrpCat.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 GrpCat) - 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) - GrpCat.groupObj 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) (j : J) : Group ((F.comp (CategoryTheory.forget GrpCat)).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) - CommGrpCat.forget₂Group_preservesLimits 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimits (CategoryTheory.forget₂ CommGrpCat GrpCat) - CommGrpCat.forget₂Group_preservesLimitsOfSize 📋 Mathlib.Algebra.Category.Grp.Limits
: CategoryTheory.Limits.PreservesLimitsOfSize.{w, v, u, u, u + 1, u + 1} (CategoryTheory.forget₂ CommGrpCat GrpCat) - CommGrpCat.instReflectsIsomorphismsGrpCatForget₂MonoidHomCarrierCarrier 📋 Mathlib.Algebra.Category.Grp.Limits
: (CategoryTheory.forget₂ CommGrpCat GrpCat).ReflectsIsomorphisms - CommGrpCat.forget₂Group_preservesLimitsOfShape 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.forget₂ CommGrpCat GrpCat) - CommGrpCat.forget₂Group_preservesLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommGrpCat) : CategoryTheory.Limits.PreservesLimit F (CategoryTheory.forget₂ CommGrpCat GrpCat) - CommGrpCat.Forget₂.createsLimit 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommGrpCat) : CategoryTheory.CreatesLimit F (CategoryTheory.forget₂ CommGrpCat GrpCat) - GrpCat.sectionsGroup 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) : Group ↑(F.comp (CategoryTheory.forget GrpCat)).sections - GrpCat.hasLimit 📋 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] : CategoryTheory.Limits.HasLimit F - GrpCat.limitCone 📋 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] : CategoryTheory.Limits.Cone F - GrpCat.hasLimit_iff_small_sections 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) : CategoryTheory.Limits.HasLimit F ↔ Small.{u, max u v} ↑(F.comp (CategoryTheory.forget GrpCat)).sections - GrpCat.limitConeIsLimit 📋 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] : CategoryTheory.Limits.IsLimit (GrpCat.limitCone F) - GrpCat.limitGroup 📋 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] : Group (CategoryTheory.Limits.Types.Small.limitCone (F.comp (CategoryTheory.forget GrpCat))).pt - 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 - GrpCat.sectionsπMonoidHom 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J GrpCat) (j : J) : ↑(F.comp (CategoryTheory.forget GrpCat)).sections →* ↑(F.obj j) - 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 - 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)) - GrpCat.SurjectiveOfEpiAuxs.instSMulCarrierXWithInfinity 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : SMul (↑B) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f) - GrpCat.epi_iff_range_eq_top 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Epi f ↔ (GrpCat.Hom.hom f).range = ⊤ - GrpCat.ker_eq_bot_of_mono 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) [CategoryTheory.Mono f] : (GrpCat.Hom.hom f).ker = ⊥ - GrpCat.mono_iff_ker_eq_bot 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Mono f ↔ (GrpCat.Hom.hom f).ker = ⊥ - GrpCat.SurjectiveOfEpiAuxs.g 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : ↑B →* Equiv.Perm (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f) - GrpCat.SurjectiveOfEpiAuxs.h 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : ↑B →* Equiv.Perm (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f) - GrpCat.SurjectiveOfEpiAuxs.one_smul 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f) : 1 • x = x - GrpCat.forget_grp_preserves_epi 📋 Mathlib.Algebra.Category.Grp.EpiMono
: (CategoryTheory.forget GrpCat).PreservesEpimorphisms - GrpCat.forget_grp_preserves_mono 📋 Mathlib.Algebra.Category.Grp.EpiMono
: (CategoryTheory.forget GrpCat).PreservesMonomorphisms - GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} {f : A ⟶ B} : ↑(Set.range fun x => x • ↑(GrpCat.Hom.hom f).range) → GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f - GrpCat.SurjectiveOfEpiAuxs.comp_eq 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : CategoryTheory.CategoryStruct.comp f (GrpCat.ofHom (GrpCat.SurjectiveOfEpiAuxs.g f)) = CategoryTheory.CategoryStruct.comp f (GrpCat.ofHom (GrpCat.SurjectiveOfEpiAuxs.h f)) - GrpCat.SurjectiveOfEpiAuxs.g_ne_h 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) (hx : x ∉ (GrpCat.Hom.hom f).range) : GrpCat.SurjectiveOfEpiAuxs.g f ≠ GrpCat.SurjectiveOfEpiAuxs.h f - GrpCat.SurjectiveOfEpiAuxs.mul_smul 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (b b' : ↑B) (x : GrpCat.SurjectiveOfEpiAuxs.XWithInfinity f) : (b * b') • x = b • b' • x - GrpCat.SurjectiveOfEpiAuxs.g_apply_infinity 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) : ((GrpCat.SurjectiveOfEpiAuxs.g f) x) GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity - GrpCat.surjective_of_epi 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) [CategoryTheory.Epi f] : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f) - GrpCat.epi_iff_surjective 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Epi f ↔ Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom f) - GrpCat.mono_iff_injective 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : CategoryTheory.Mono f ↔ Function.Injective ⇑(CategoryTheory.ConcreteCategory.hom f) - GrpCat.SurjectiveOfEpiAuxs.h_apply_infinity 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) (hx : x ∈ (GrpCat.Hom.hom f).range) : ((GrpCat.SurjectiveOfEpiAuxs.h f) x) GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity - GrpCat.SurjectiveOfEpiAuxs.agree 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : ↑(GrpCat.Hom.hom f).range = {x | (GrpCat.SurjectiveOfEpiAuxs.h f) x = (GrpCat.SurjectiveOfEpiAuxs.g f) x} - GrpCat.SurjectiveOfEpiAuxs.τ_apply_fromCoset 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : (GrpCat.SurjectiveOfEpiAuxs.tau f) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity - GrpCat.SurjectiveOfEpiAuxs.τ_apply_infinity 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : (GrpCat.SurjectiveOfEpiAuxs.tau f) GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.τ_symm_apply_fromCoset 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : (Equiv.symm (GrpCat.SurjectiveOfEpiAuxs.tau f)) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity - GrpCat.SurjectiveOfEpiAuxs.τ_symm_apply_infinity 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) : (Equiv.symm (GrpCat.SurjectiveOfEpiAuxs.tau f)) GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.τ_apply_fromCoset' 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) (hx : x ∈ (GrpCat.Hom.hom f).range) : (GrpCat.SurjectiveOfEpiAuxs.tau f) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨x • ↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.infinity - GrpCat.SurjectiveOfEpiAuxs.g_apply_fromCoset 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) (y : ↑(Set.range fun x => x • ↑(GrpCat.Hom.hom f).range)) : ((GrpCat.SurjectiveOfEpiAuxs.g f) x) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset y) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨x • ↑y, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.fromCoset_eq_of_mem_range 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) {b : ↑B} (hb : b ∈ (GrpCat.Hom.hom f).range) : GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(GrpCat.Hom.hom f).range, ⋯⟩ = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.fromCoset_ne_of_nin_range 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) {b : ↑B} (hb : b ∉ (GrpCat.Hom.hom f).range) : GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(GrpCat.Hom.hom f).range, ⋯⟩ ≠ GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) : ((GrpCat.SurjectiveOfEpiAuxs.h f) x) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset' 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x b : ↑B) (hb : b ∈ (GrpCat.Hom.hom f).range) : ((GrpCat.SurjectiveOfEpiAuxs.h f) x) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(GrpCat.Hom.hom f).range, ⋯⟩ - GrpCat.SurjectiveOfEpiAuxs.h_apply_fromCoset_nin_range 📋 Mathlib.Algebra.Category.Grp.EpiMono
{A B : GrpCat} (f : A ⟶ B) (x : ↑B) (hx : x ∈ (GrpCat.Hom.hom f).range) (b : ↑B) (hb : b ∉ (GrpCat.Hom.hom f).range) : ((GrpCat.SurjectiveOfEpiAuxs.h f) x) (GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨b • ↑(GrpCat.Hom.hom f).range, ⋯⟩) = GrpCat.SurjectiveOfEpiAuxs.XWithInfinity.fromCoset ⟨(x * b) • ↑(GrpCat.Hom.hom f).range, ⋯⟩ - MonCat.units_obj_coe 📋 Mathlib.Algebra.Category.Grp.Adjunctions
(R : MonCat) : ↑(MonCat.units.obj R) = (↑R)ˣ - GrpCat.instIsRightAdjointForgetMonoidHomCarrier 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: (CategoryTheory.forget GrpCat).IsRightAdjoint - GrpCat.adj 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: GrpCat.free ⊣ CategoryTheory.forget GrpCat - GrpCat.forget₂MonAdj 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: CategoryTheory.forget₂ GrpCat MonCat ⊣ MonCat.units - GrpCat.abelianizeAdj 📋 Mathlib.Algebra.Category.Grp.Adjunctions
: GrpCat.abelianize ⊣ CategoryTheory.forget₂ CommGrpCat GrpCat - GrpCat.isZero_of_subsingleton 📋 Mathlib.Algebra.Category.Grp.Zero
(G : GrpCat) [Subsingleton ↑G] : CategoryTheory.Limits.IsZero G - GrpCat.subsingleton_of_isZero 📋 Mathlib.Algebra.Category.Grp.Zero
{G : GrpCat} (h : CategoryTheory.Limits.IsZero G) : Subsingleton ↑G - GrpCat.isZero_iff_subsingleton 📋 Mathlib.Algebra.Category.Grp.Zero
{G : GrpCat} : CategoryTheory.Limits.IsZero G ↔ Subsingleton ↑G - GrpCat.tensorObj_eq 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : GrpCat) : CategoryTheory.MonoidalCategoryStruct.tensorObj G H = GrpCat.of (↑G × ↑H) - GrpCat.binaryProductLimitCone_cone_pt 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : GrpCat) : (G.binaryProductLimitCone H).cone.pt = GrpCat.of (↑G × ↑H) - GrpCat.instBraidedForgetMonoidHomCarrier 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
: (CategoryTheory.forget GrpCat).Braided - GrpCat.binaryProductLimitCone_isLimit_lift 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
(G H : GrpCat) (t : CategoryTheory.Limits.Cone (CategoryTheory.Limits.pair G H)) : (G.binaryProductLimitCone H).isLimit.lift t = GrpCat.ofHom ((GrpCat.Hom.hom (CategoryTheory.Limits.BinaryFan.fst t)).prod (GrpCat.Hom.hom (CategoryTheory.Limits.BinaryFan.snd t))) - GrpCat.μ_forget_apply 📋 Mathlib.Algebra.Category.Grp.CartesianMonoidal
{G H : GrpCat} (p : ↑G) (q : ↑H) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Functor.LaxMonoidal.μ (CategoryTheory.forget GrpCat) G H)) (p, q) = (p, q) - FiniteGrp.instFiniteCarrierToGrp 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(G : FiniteGrp.{u_1}) : Finite ↑G.toGrp - FiniteGrp.instGroupCarrierToGrp 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(G : FiniteGrp.{u_1}) : Group ↑G.toGrp - FiniteGrp.isFinite 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(self : FiniteGrp.{u}) : Finite ↑self.toGrp - FiniteGrp.mk 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
(toGrp : GrpCat) [isFinite : Finite ↑toGrp] : FiniteGrp.{u} - FiniteGrp.instConcreteCategoryMonoidHomCarrierToGrp 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
: CategoryTheory.ConcreteCategory FiniteGrp.{u_1} fun x1 x2 => ↑x1.toGrp →* ↑x2.toGrp - FiniteGrp.ofHom_apply 📋 Mathlib.Algebra.Category.Grp.FiniteGrp
{X Y : Type u} [Group X] [Finite X] [Group Y] [Finite Y] (f : X →* Y) (x : X) : (CategoryTheory.ConcreteCategory.hom (FiniteGrp.ofHom f)) x = f x - grpTypeEquivalenceGrpForget 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.Grp
: GrpTypeEquivalenceGrp.functor.comp (CategoryTheory.forget₂ GrpCat MonCat) ≅ (CategoryTheory.Grp.forget₂Mon (Type u)).comp MonTypeEquivalenceMon.functor - commGrpTypeEquivalenceCommGrpForgetGrp 📋 Mathlib.CategoryTheory.Monoidal.Internal.Types.CommGrp_
: CommGrpTypeEquivalenceCommGrp.functor.comp (CategoryTheory.forget₂ CommGrpCat GrpCat) ≅ (CategoryTheory.CommGrp.forget₂Grp (Type u)).comp GrpTypeEquivalenceGrp.functor - GrpCat.shrinkFunctor 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] : CategoryTheory.Functor C GrpCat - GrpCat.shrinkFunctor_obj_coe 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] (X : C) : ↑((GrpCat.shrinkFunctor.{w, w', v, u} F).obj X) = Shrink.{w, w'} ↑(F.obj X) - GrpCat.shrinkFunctorMap 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C GrpCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] : GrpCat.shrinkFunctor.{w, w', v, u} F ⟶ GrpCat.shrinkFunctor.{w, w', v, u} G - instSmallCompGrpCatForgetMonoidHomCarrierOfSmallObj 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] : CategoryTheory.FunctorToTypes.Small.{w, w', v, u} (F.comp (CategoryTheory.forget GrpCat)) - GrpCat.shrinkFunctor_map 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C GrpCat) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] {X Y : C} (f : X ⟶ Y) : (GrpCat.shrinkFunctor.{w, w', v, u} F).map f = GrpCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (GrpCat.Hom.hom (F.map f))).comp Shrink.mulEquiv.toMonoidHom) - GrpCat.shrinkFunctorMap_app 📋 Mathlib.Algebra.Category.Grp.Shrink
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C GrpCat} (τ : F ⟶ G) [∀ (X : C), Small.{w, w'} ↑(F.obj X)] [∀ (X : C), Small.{w, w'} ↑(G.obj X)] (X : C) : (GrpCat.shrinkFunctorMap τ).app X = GrpCat.ofHom ((Shrink.mulEquiv.symm.toMonoidHom.comp (GrpCat.Hom.hom (τ.app X))).comp Shrink.mulEquiv.toMonoidHom) - CategoryTheory.yonedaGrpObj_obj_coe 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.GrpObj G] (X : Cᵒᵖ) : ↑((CategoryTheory.yonedaGrpObj G).obj X) = (Opposite.unop X ⟶ G) - CategoryTheory.yonedaGrpObjRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (G : C) [CategoryTheory.GrpObj G] : ((CategoryTheory.yonedaGrpObj G).comp (CategoryTheory.forget GrpCat)).RepresentableBy G - CategoryTheory.GrpObj.ofRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ GrpCat) (α : (F.comp (CategoryTheory.forget GrpCat)).RepresentableBy X) : CategoryTheory.GrpObj X - CategoryTheory.yonedaGrpObjIsoOfRepresentableBy 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ GrpCat) (α : (F.comp (CategoryTheory.forget GrpCat)).RepresentableBy X) : CategoryTheory.yonedaGrpObj X ≅ F - CategoryTheory.essImage_yonedaGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.yonedaGrp.essImage = fun F => (F.comp (CategoryTheory.forget GrpCat)).IsRepresentable - CategoryTheory.yonedaGrp_naturality 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {G H X Y : C} [CategoryTheory.GrpObj G] [CategoryTheory.GrpObj H] (α : CategoryTheory.yonedaGrpObj G ⟶ CategoryTheory.yonedaGrpObj 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.yonedaGrp_naturality_assoc 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {G H X Y : C} [CategoryTheory.GrpObj G] [CategoryTheory.GrpObj H] (α : CategoryTheory.yonedaGrpObj G ⟶ CategoryTheory.yonedaGrpObj 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.yonedaGrpObjIsoOfRepresentableBy_hom 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ GrpCat) (α : (F.comp (CategoryTheory.forget GrpCat)).RepresentableBy X) : (CategoryTheory.yonedaGrpObjIsoOfRepresentableBy X F α).hom = { app := fun X_1 => GrpCat.ofHom ↑{ toEquiv := α.homEquiv, map_mul' := ⋯ }, naturality := ⋯ } - CategoryTheory.yonedaGrpObjIsoOfRepresentableBy_inv 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.Grp
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (X : C) (F : CategoryTheory.Functor Cᵒᵖ GrpCat) (α : (F.comp (CategoryTheory.forget GrpCat)).RepresentableBy X) : (CategoryTheory.yonedaGrpObjIsoOfRepresentableBy X F α).inv = { app := fun X_1 => GrpCat.ofHom ↑{ toEquiv := α.homEquiv.symm, map_mul' := ⋯ }, naturality := ⋯ } - CategoryTheory.PreGaloisCategory.autGaloisSystem_obj_coe 📋 Mathlib.CategoryTheory.Galois.Prorepresentability
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] [CategoryTheory.GaloisCategory C] (F : CategoryTheory.Functor C FintypeCat) (A : CategoryTheory.PreGaloisCategory.PointedGaloisObject F) : ↑((CategoryTheory.PreGaloisCategory.autGaloisSystem F).obj A) = CategoryTheory.Aut A.obj - CategoryTheory.PreGaloisCategory.autIsoFibers 📋 Mathlib.CategoryTheory.Galois.Prorepresentability
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] [CategoryTheory.GaloisCategory C] (F : CategoryTheory.Functor C FintypeCat) [CategoryTheory.PreGaloisCategory.FiberFunctor F] : (CategoryTheory.PreGaloisCategory.autGaloisSystem F).comp (CategoryTheory.forget GrpCat) ≅ (CategoryTheory.PreGaloisCategory.PointedGaloisObject.incl F).comp (F.comp FintypeCat.incl) - CategoryTheory.PreGaloisCategory.autGaloisSystem_map_surjective 📋 Mathlib.CategoryTheory.Galois.Prorepresentability
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] [CategoryTheory.GaloisCategory C] (F : CategoryTheory.Functor C FintypeCat) ⦃A B : CategoryTheory.PreGaloisCategory.PointedGaloisObject F⦄ (f : A ⟶ B) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom ((CategoryTheory.PreGaloisCategory.autGaloisSystem F).map f)) - CategoryTheory.PreGaloisCategory.AutGalois.π_apply 📋 Mathlib.CategoryTheory.Galois.Prorepresentability
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] [CategoryTheory.GaloisCategory C] (F : CategoryTheory.Functor C FintypeCat) (A : CategoryTheory.PreGaloisCategory.PointedGaloisObject F) (x : CategoryTheory.PreGaloisCategory.AutGalois F) : (CategoryTheory.PreGaloisCategory.AutGalois.π F A) x = ↑x A - CategoryTheory.PreGaloisCategory.autIsoFibers_inv_app 📋 Mathlib.CategoryTheory.Galois.Prorepresentability
{C : Type u₁} [CategoryTheory.Category.{u₂, u₁} C] [CategoryTheory.GaloisCategory C] (F : CategoryTheory.Functor C FintypeCat) [CategoryTheory.PreGaloisCategory.FiberFunctor F] (A : CategoryTheory.PreGaloisCategory.PointedGaloisObject F) (b : (F.obj A.obj).obj) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.PreGaloisCategory.autIsoFibers F).inv.app A)) b = (CategoryTheory.PreGaloisCategory.evaluationEquivOfIsGalois F A.obj A.pt).symm b - CategoryTheory.instSmallCarrierObjOppositeGrpCatGrpFunctorYonedaGrp 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] (M : CategoryTheory.Grp C) (X : Cᵒᵖ) : Small.{w, v} ↑((CategoryTheory.yonedaGrp.obj M).obj X) - CategoryTheory.shrinkYonedaGrpObjObjEquiv 📋 Mathlib.CategoryTheory.Monoidal.Cartesian.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.CartesianMonoidalCategory C] {M : CategoryTheory.Grp C} {Y : Cᵒᵖ} : ↑((CategoryTheory.shrinkYonedaGrp.{w, v, u}.obj M).obj Y) ≃* (Opposite.unop Y ⟶ M.X) - CategoryTheory.shrinkYonedaGrp_obj_map_shrinkYonedaGrpObjObjEquiv_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.Grp C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : Opposite.unop Y ⟶ M.X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaGrp.{w, v, u}.obj M).map g)) (CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkYonedaGrp_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.Grp C} {Y : Cᵒᵖ} (f : Opposite.unop Y ⟶ M.X) (g : M ⟶ M') : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaGrp.{w, v, u}.map g).app Y)) (CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp f g.hom.hom) - CategoryTheory.shrinkYonedaGrpObjObjEquiv_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.Grp C} {Y Y' : C} (g : Y' ⟶ Y) (f : Y ⟶ M.X) : CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g f) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaGrp.{w, v, u}.obj M).map g.op)) (CategoryTheory.shrinkYonedaGrpObjObjEquiv.symm f) - CategoryTheory.PresheafOfGroups.OneCochain.ev 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (self : CategoryTheory.PresheafOfGroups.OneCochain G U) (i j : I) ⦃T : C⦄ (a : T ⟶ U i) (b : T ⟶ U j) : ↑(G.obj (Opposite.op T)) - CategoryTheory.PresheafOfGroups.OneCochain.ext 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} {x y : CategoryTheory.PresheafOfGroups.OneCochain G U} (ev : x.ev = y.ev) : x = y - CategoryTheory.PresheafOfGroups.OneCochain.ext_iff 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} {x y : CategoryTheory.PresheafOfGroups.OneCochain G U} : x = y ↔ x.ev = y.ev - CategoryTheory.PresheafOfGroups.OneCocycle.ev_refl 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (γ : CategoryTheory.PresheafOfGroups.OneCocycle G U) (i : I) ⦃T : C⦄ (a : T ⟶ U i) : γ.ev i i a a = 1 - CategoryTheory.PresheafOfGroups.Cochain₀.inv_apply 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (γ : CategoryTheory.PresheafOfGroups.ZeroCochain G U) (i : I) : γ⁻¹ i = (γ i)⁻¹ - CategoryTheory.PresheafOfGroups.OneCocycle.ev_symm 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (γ : CategoryTheory.PresheafOfGroups.OneCocycle G U) (i j : I) ⦃T : C⦄ (a : T ⟶ U i) (b : T ⟶ U j) : γ.ev i j a b = (γ.ev j i b a)⁻¹ - CategoryTheory.PresheafOfGroups.OneCochain.inv_ev 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (γ : CategoryTheory.PresheafOfGroups.OneCochain G U) (i j : I) {T : C} (a : T ⟶ U i) (b : T ⟶ U j) : γ⁻¹.ev i j a b = (γ.ev i j a b)⁻¹ - CategoryTheory.PresheafOfGroups.OneCochain.one_ev 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (i j : I) {T : C} (a : T ⟶ U i) (b : T ⟶ U j) : CategoryTheory.PresheafOfGroups.OneCochain.ev 1 i j a b = 1 - CategoryTheory.PresheafOfGroups.Cochain₀.one_apply 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (i : I) : 1 i = 1 - CategoryTheory.PresheafOfGroups.OneCocycle.mk 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (toOneCochain : CategoryTheory.PresheafOfGroups.OneCochain G U) (ev_trans : ∀ (i j k : I) ⦃T : C⦄ (a : T ⟶ U i) (b : T ⟶ U j) (c : T ⟶ U k), toOneCochain.ev i j a b * toOneCochain.ev j k b c = toOneCochain.ev i k a c := by aesop) : CategoryTheory.PresheafOfGroups.OneCocycle G U - CategoryTheory.PresheafOfGroups.OneCocycle.ev_trans 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (self : CategoryTheory.PresheafOfGroups.OneCocycle G U) (i j k : I) ⦃T : C⦄ (a : T ⟶ U i) (b : T ⟶ U j) (c : T ⟶ U k) : self.ev i j a b * self.ev j k b c = self.ev i k a c - CategoryTheory.PresheafOfGroups.Cochain₀.mul_apply 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor Cᵒᵖ GrpCat) {I : Type w'} (U : I → C) (γ₁ γ₂ : CategoryTheory.PresheafOfGroups.ZeroCochain G U) (i : I) : (γ₁ * γ₂) i = γ₁ i * γ₂ i - CategoryTheory.PresheafOfGroups.OneCochain.mul_ev 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (γ₁ γ₂ : CategoryTheory.PresheafOfGroups.OneCochain G U) (i j : I) {T : C} (a : T ⟶ U i) (b : T ⟶ U j) : (γ₁ * γ₂).ev i j a b = γ₁.ev i j a b * γ₂.ev i j a b - CategoryTheory.PresheafOfGroups.OneCochain.ev_precomp 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (self : CategoryTheory.PresheafOfGroups.OneCochain G U) (i j : I) ⦃T T' : C⦄ (φ : T ⟶ T') (a : T' ⟶ U i) (b : T' ⟶ U j) : (CategoryTheory.ConcreteCategory.hom (G.map φ.op)) (self.ev i j a b) = self.ev i j (CategoryTheory.CategoryStruct.comp φ a) (CategoryTheory.CategoryStruct.comp φ b) - CategoryTheory.PresheafOfGroups.OneCochain.mk 📋 Mathlib.CategoryTheory.Sites.NonabelianCohomology.H1
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : CategoryTheory.Functor Cᵒᵖ GrpCat} {I : Type w'} {U : I → C} (ev : (i j : I) → ⦃T : C⦄ → (T ⟶ U i) → (T ⟶ U j) → ↑(G.obj (Opposite.op T))) (ev_precomp : ∀ (i j : I) ⦃T T' : C⦄ (φ : T ⟶ T') (a : T' ⟶ U i) (b : T' ⟶ U j), (CategoryTheory.ConcreteCategory.hom (G.map φ.op)) (ev i j a b) = ev i j (CategoryTheory.CategoryStruct.comp φ a) (CategoryTheory.CategoryStruct.comp φ b) := by aesop) : CategoryTheory.PresheafOfGroups.OneCochain G U - ProfiniteGrp.instHasForget₂ContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfiniteGrpCatMonoidHomCarrier 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.HasForget₂ ProfiniteGrp.{u_1} GrpCat - ProfiniteGrp.instHasForget₂FiniteGrpMonoidHomCarrierToGrpContinuousMonoidHomCarrierToTopTotallyDisconnectedSpaceToProfinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Basic
: CategoryTheory.HasForget₂ FiniteGrp.{u_1} ProfiniteGrp.{u_1} - InfiniteGalois.finGaloisGroupFunctor_map_proj_eq_proj 📋 Mathlib.FieldTheory.Galois.Profinite
{k : Type u_3} {K : Type u_4} [Field k] [Field K] [Algebra k K] (g : ↑(ProfiniteGrp.limit (InfiniteGalois.asProfiniteGaloisGroupFunctor k K)).toProfinite.toTop) {L₁ L₂ : FiniteGaloisIntermediateField k K} (h : L₁ ⟶ L₂) : (CategoryTheory.ConcreteCategory.hom ((finGaloisGroupFunctor k K).map h.op)) ((InfiniteGalois.proj L₂) g) = (InfiniteGalois.proj L₁) g - ProfiniteGrp.diagram_obj 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Limits
(P : ProfiniteGrp.{u}) (X : OpenNormalSubgroup ↑P.toProfinite.toTop) : P.diagram.obj X = (CategoryTheory.forget₂ FiniteGrp.{u} ProfiniteGrp.{u}).obj (P.toFiniteQuotientFunctor.obj X) - ProfiniteGrp.diagram_map 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Limits
(P : ProfiniteGrp.{u}) {X✝ Y✝ : OpenNormalSubgroup ↑P.toProfinite.toTop} (f : X✝ ⟶ Y✝) : P.diagram.map f = (CategoryTheory.forget₂ FiniteGrp.{u} ProfiniteGrp.{u}).map (P.toFiniteQuotientFunctor.map f) - ProfiniteGrp.ProfiniteCompletion.etaFn 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) (x : ↑G) : ↑(ProfiniteGrp.ProfiniteCompletion.completion G).toProfinite.toTop - ProfiniteGrp.ProfiniteCompletion.etaFn_injective_iff_residuallyFinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) : Function.Injective (ProfiniteGrp.ProfiniteCompletion.etaFn G) ↔ Group.ResiduallyFinite ↑G - ProfiniteGrp.ProfiniteCompletion.diagram 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) : CategoryTheory.Functor (FiniteIndexNormalSubgroup ↑G) ProfiniteGrp.{u} - ProfiniteGrp.ProfiniteCompletion.finiteGrpDiagram 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) : CategoryTheory.Functor (FiniteIndexNormalSubgroup ↑G) FiniteGrp.{u} - ProfiniteGrp.ProfiniteCompletion.denseRange 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) : DenseRange (ProfiniteGrp.ProfiniteCompletion.etaFn G) - ProfiniteGrp.ProfiniteCompletion.mono_eta_iff_residuallyFinite 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
(G : GrpCat) : CategoryTheory.Mono (ProfiniteGrp.ProfiniteCompletion.eta G) ↔ Group.ResiduallyFinite ↑G - ProfiniteGrp.ProfiniteCompletion.preimage 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} (f : G ⟶ GrpCat.of ↑P.toProfinite.toTop) (H : OpenNormalSubgroup ↑P.toProfinite.toTop) : FiniteIndexNormalSubgroup ↑G - ProfiniteGrp.ProfiniteCompletion.preimage_le 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} {f : G ⟶ GrpCat.of ↑P.toProfinite.toTop} {H K : OpenNormalSubgroup ↑P.toProfinite.toTop} (h : H ≤ K) : ProfiniteGrp.ProfiniteCompletion.preimage f H ≤ ProfiniteGrp.ProfiniteCompletion.preimage f K - ProfiniteGrp.ProfiniteCompletion.adjunction 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
: ProfiniteGrp.profiniteCompletion ⊣ CategoryTheory.forget₂ ProfiniteGrp.{u_1} GrpCat - ProfiniteGrp.ProfiniteCompletion.quotientMap 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} (f : G ⟶ GrpCat.of ↑P.toProfinite.toTop) (H : OpenNormalSubgroup ↑P.toProfinite.toTop) : FiniteGrp.of (↑G ⧸ (ProfiniteGrp.ProfiniteCompletion.preimage f H).toSubgroup) ⟶ FiniteGrp.of (↑P.toProfinite.toTop ⧸ ↑H.toOpenSubgroup) - ProfiniteGrp.ProfiniteCompletion.lift_eta 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} (f : G ⟶ GrpCat.of ↑P.toProfinite.toTop) : CategoryTheory.CategoryStruct.comp (ProfiniteGrp.ProfiniteCompletion.eta G) ((CategoryTheory.forget₂ ProfiniteGrp.{u} GrpCat).map (ProfiniteGrp.ProfiniteCompletion.lift f)) = f - ProfiniteGrp.ProfiniteCompletion.lift_eta_assoc 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} (f : G ⟶ GrpCat.of ↑P.toProfinite.toTop) {Z : GrpCat} (h : (CategoryTheory.forget₂ ProfiniteGrp.{u} GrpCat).obj P ⟶ Z) : CategoryTheory.CategoryStruct.comp (ProfiniteGrp.ProfiniteCompletion.eta G) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.forget₂ ProfiniteGrp.{u} GrpCat).map (ProfiniteGrp.ProfiniteCompletion.lift f)) h) = CategoryTheory.CategoryStruct.comp f h - ProfiniteGrp.ProfiniteCompletion.lift_unique 📋 Mathlib.Topology.Algebra.Category.ProfiniteGrp.Completion
{G : GrpCat} {P : ProfiniteGrp.{u}} (f g : ProfiniteGrp.ProfiniteCompletion.completion G ⟶ P) (h : CategoryTheory.CategoryStruct.comp (ProfiniteGrp.ProfiniteCompletion.eta G) ((CategoryTheory.forget₂ ProfiniteGrp.{u} GrpCat).map f) = CategoryTheory.CategoryStruct.comp (ProfiniteGrp.ProfiniteCompletion.eta G) ((CategoryTheory.forget₂ ProfiniteGrp.{u} GrpCat).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