Loogle!
Result
Found 189 declarations mentioning CategoryTheory.MonoOver.
- CategoryTheory.MonoOver π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : Type (max uβ vβ) - CategoryTheory.MonoOver.instCoeOut π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CoeOut (CategoryTheory.MonoOver X) C - CategoryTheory.MonoOver.imageMonoOver π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Limits.HasImage f] : CategoryTheory.MonoOver Y - CategoryTheory.MonoOver.mk π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X A : C} (f : A βΆ X) [hf : CategoryTheory.Mono f] : CategoryTheory.MonoOver X - CategoryTheory.MonoOver.hasColimitsOfSize_of_hasStrongEpiMonoFactorisations π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] : CategoryTheory.Limits.HasColimitsOfSize.{w, w', vβ, max uβ vβ} (CategoryTheory.MonoOver Y) - CategoryTheory.MonoOver.forget π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.Over X) - CategoryTheory.MonoOver.hasFiniteLimits π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) [CategoryTheory.Limits.HasFiniteLimits (CategoryTheory.Over X)] : CategoryTheory.Limits.HasFiniteLimits (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.hasLimitsOfSize π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) [CategoryTheory.Limits.HasLimitsOfSize.{w, w', vβ, max uβ vβ} (CategoryTheory.Over X)] : CategoryTheory.Limits.HasLimitsOfSize.{w, w', vβ, max uβ vβ} (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.isThin π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Quiver.IsThin (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.image π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] : CategoryTheory.Functor (CategoryTheory.Over X) (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.arrow π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : f.obj.left βΆ X - CategoryTheory.MonoOver.fullyFaithfulForget π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : (CategoryTheory.MonoOver.forget X).FullyFaithful - CategoryTheory.MonoOver.mono π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : CategoryTheory.Mono f.arrow - CategoryTheory.MonoOver.instIsRightAdjointOverForget π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] : (CategoryTheory.MonoOver.forget X).IsRightAdjoint - CategoryTheory.MonoOver.reflective π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] : CategoryTheory.Reflective (CategoryTheory.MonoOver.forget X) - CategoryTheory.MonoOver.hasLimitsOfShape π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (X : C) [CategoryTheory.Limits.HasLimitsOfShape J (CategoryTheory.Over X)] : CategoryTheory.Limits.HasLimitsOfShape J (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.imageForgetAdj π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] : CategoryTheory.MonoOver.image β£ CategoryTheory.MonoOver.forget X - CategoryTheory.MonoOver.mapIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B - CategoryTheory.MonoOver.mono_obj_hom π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.MonoOver X) : CategoryTheory.Mono S.obj.hom - CategoryTheory.MonoOver.exists π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.MonoOver Y) - CategoryTheory.MonoOver.pullback π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) : CategoryTheory.Functor (CategoryTheory.MonoOver Y) (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.coconeOfHasStrongEpiMonoFactorisation π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver Y)) : CategoryTheory.Limits.Cocone F - CategoryTheory.MonoOver.map π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.MonoOver Y) - CategoryTheory.MonoOver.faithful_exists π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) : (CategoryTheory.MonoOver.exists f).Faithful - CategoryTheory.MonoOver.mkArrowIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : CategoryTheory.MonoOver.mk f.arrow β f - CategoryTheory.MonoOver.faithful_map π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.map f).Faithful - CategoryTheory.MonoOver.full_map π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.map f).Full - CategoryTheory.MonoOver.forget_obj_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f : CategoryTheory.MonoOver X} : ((CategoryTheory.MonoOver.forget X).obj f).left = f.obj.left - CategoryTheory.MonoOver.isColimitCoconeOfHasStrongEpiMonoFactorisation π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver Y)) : CategoryTheory.Limits.IsColimit (CategoryTheory.MonoOver.coconeOfHasStrongEpiMonoFactorisation F) - CategoryTheory.MonoOver.image_obj π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] (f : CategoryTheory.Over X) : CategoryTheory.MonoOver.image.obj f = CategoryTheory.MonoOver.imageMonoOver f.hom - CategoryTheory.MonoOver.existsPullbackAdj π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) [CategoryTheory.Limits.HasPullbacks C] : CategoryTheory.MonoOver.exists f β£ CategoryTheory.MonoOver.pullback f - CategoryTheory.MonoOver.mapPullbackAdj π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.MonoOver.map f β£ CategoryTheory.MonoOver.pullback f - CategoryTheory.MonoOver.instMonoHomObjOverForget π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f : CategoryTheory.MonoOver X} : CategoryTheory.Mono ((CategoryTheory.MonoOver.forget X).obj f).hom - CategoryTheory.MonoOver.congr π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : CategoryTheory.MonoOver X β CategoryTheory.MonoOver (e.functor.obj X) - CategoryTheory.MonoOver.forget_obj_hom π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f : CategoryTheory.MonoOver X} : ((CategoryTheory.MonoOver.forget X).obj f).hom = f.arrow - CategoryTheory.MonoOver.hasLimit π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (X : C) (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.Limits.HasLimit (F.comp (CategoryTheory.Over.isMono X).ΞΉ)] : CategoryTheory.Limits.HasLimit F - CategoryTheory.MonoOver.mapIso_functor π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : (CategoryTheory.MonoOver.mapIso e).functor = CategoryTheory.MonoOver.map e.hom - CategoryTheory.MonoOver.mapIso_inverse π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : (CategoryTheory.MonoOver.mapIso e).inverse = CategoryTheory.MonoOver.map e.inv - CategoryTheory.MonoOver.map_obj_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] (g : CategoryTheory.MonoOver X) : ((CategoryTheory.MonoOver.map f).obj g).obj.left = g.obj.left - CategoryTheory.MonoOver.existsIsoMap π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.MonoOver.exists f β CategoryTheory.MonoOver.map f - CategoryTheory.MonoOver.mapId π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : CategoryTheory.MonoOver.map (CategoryTheory.CategoryStruct.id X) β CategoryTheory.Functor.id (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.pullbackId π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasPullbacks C] : CategoryTheory.MonoOver.pullback (CategoryTheory.CategoryStruct.id X) β CategoryTheory.Functor.id (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.liftId π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.MonoOver.lift (CategoryTheory.Functor.id (CategoryTheory.Over X)) β― β CategoryTheory.Functor.id (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.forgetImage π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] : (CategoryTheory.MonoOver.forget X).comp CategoryTheory.MonoOver.image β CategoryTheory.Functor.id (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.pullback_obj_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (g : CategoryTheory.MonoOver Y) : ((CategoryTheory.MonoOver.pullback f).obj g).obj.left = CategoryTheory.Limits.pullback g.arrow f - CategoryTheory.MonoOver.homMk π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (h : f.obj.left βΆ g.obj.left) (w : CategoryTheory.CategoryStruct.comp h g.arrow = f.arrow := by aesop_cat) : f βΆ g - CategoryTheory.MonoOver.map_obj_arrow π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] (g : CategoryTheory.MonoOver X) : ((CategoryTheory.MonoOver.map f).obj g).arrow = CategoryTheory.CategoryStruct.comp g.arrow f - CategoryTheory.MonoOver.instIsIsoLeftHomFullSubcategoryOverIsMono π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {A B : CategoryTheory.MonoOver X} (f : A βΆ B) [CategoryTheory.IsIso f] : CategoryTheory.IsIso (CategoryTheory.Over.Hom.left f.hom) - CategoryTheory.MonoOver.isIso_iff_isIso_hom_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {A B : CategoryTheory.MonoOver X} (f : A βΆ B) : CategoryTheory.IsIso f β CategoryTheory.IsIso (CategoryTheory.Over.Hom.left f.hom) - CategoryTheory.MonoOver.lift π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} (F : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)) (h : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) : CategoryTheory.Functor (CategoryTheory.MonoOver Y) (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.pullbackMapSelf π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.map f).comp (CategoryTheory.MonoOver.pullback f) β CategoryTheory.Functor.id (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.pullbackComp π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (g : Y βΆ Z) : CategoryTheory.MonoOver.pullback (CategoryTheory.CategoryStruct.comp f g) β (CategoryTheory.MonoOver.pullback g).comp (CategoryTheory.MonoOver.pullback f) - CategoryTheory.MonoOver.pullbackObjIsoOfIsPullback π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {X Y : C} (f : Y βΆ X) (S : CategoryTheory.MonoOver X) (T : CategoryTheory.MonoOver Y) (f' : T.obj.left βΆ S.obj.left) (h : CategoryTheory.IsPullback f' T.arrow S.arrow f) : (CategoryTheory.MonoOver.pullback f).obj S β T - CategoryTheory.MonoOver.w π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (k : f βΆ g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left k.hom) g.arrow = f.arrow - CategoryTheory.MonoOver.isoMk π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (h : f.obj.left β g.obj.left) (w : CategoryTheory.CategoryStruct.comp h.hom g.arrow = f.arrow := by cat_disch) : f β g - CategoryTheory.MonoOver.mapComp π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : X βΆ Y) (g : Y βΆ Z) [CategoryTheory.Mono f] [CategoryTheory.Mono g] : CategoryTheory.MonoOver.map (CategoryTheory.CategoryStruct.comp f g) β (CategoryTheory.MonoOver.map f).comp (CategoryTheory.MonoOver.map g) - CategoryTheory.MonoOver.congr_functor π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).functor = CategoryTheory.MonoOver.lift (CategoryTheory.Over.post e.functor) β― - CategoryTheory.MonoOver.lift_obj_obj π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} (F : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)) (h : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) (Xβ : CategoryTheory.MonoOver Y) : ((CategoryTheory.MonoOver.lift F h).obj Xβ).obj = F.obj Xβ.obj - CategoryTheory.MonoOver.w_assoc π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (k : f βΆ g) {Z : C} (h : X βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left k.hom) (CategoryTheory.CategoryStruct.comp g.arrow h) = CategoryTheory.CategoryStruct.comp f.arrow h - CategoryTheory.MonoOver.pullback_obj_arrow π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (g : CategoryTheory.MonoOver Y) : ((CategoryTheory.MonoOver.pullback f).obj g).arrow = CategoryTheory.Limits.pullback.snd ((CategoryTheory.MonoOver.forget Y).obj g).hom f - CategoryTheory.MonoOver.lift_comm π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (F : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)) (h : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) : (CategoryTheory.MonoOver.lift F h).comp (CategoryTheory.MonoOver.forget X) = (CategoryTheory.MonoOver.forget Y).comp F - CategoryTheory.MonoOver.strongEpiMonoFactorisationSigmaDesc π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver Y)) : CategoryTheory.Limits.StrongEpiMonoFactorisation (CategoryTheory.Limits.Sigma.desc fun i => (F.obj i).arrow) - CategoryTheory.MonoOver.isoMk_hom π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (h : f.obj.left β g.obj.left) (w : CategoryTheory.CategoryStruct.comp h.hom g.arrow = f.arrow := by cat_disch) : (CategoryTheory.MonoOver.isoMk h w).hom = CategoryTheory.MonoOver.homMk h.hom w - CategoryTheory.MonoOver.isoMk_inv π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} (h : f.obj.left β g.obj.left) (w : CategoryTheory.CategoryStruct.comp h.hom g.arrow = f.arrow := by cat_disch) : (CategoryTheory.MonoOver.isoMk h w).inv = CategoryTheory.MonoOver.homMk h.inv β― - CategoryTheory.MonoOver.mkArrowIso_hom_hom_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : f.mkArrowIso.hom.hom.left = CategoryTheory.CategoryStruct.id f.obj.left - CategoryTheory.MonoOver.mkArrowIso_inv_hom_left π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : f.mkArrowIso.inv.hom.left = CategoryTheory.CategoryStruct.id f.obj.left - CategoryTheory.MonoOver.lift_obj_arrow π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} (F : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)) (h : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) (f : CategoryTheory.MonoOver Y) : ((CategoryTheory.MonoOver.lift F h).obj f).arrow = (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom - CategoryTheory.MonoOver.liftIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} {Fβ Fβ : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)} (hβ : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (Fβ.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) (hβ : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (Fβ.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) (i : Fβ β Fβ) : CategoryTheory.MonoOver.lift Fβ hβ β CategoryTheory.MonoOver.lift Fβ hβ - CategoryTheory.MonoOver.image_map π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasImages C] {f g : CategoryTheory.Over X} (k : f βΆ g) : CategoryTheory.MonoOver.image.map k = (CategoryTheory.MonoOver.forget X).preimage (CategoryTheory.Over.homMk (CategoryTheory.Limits.image.lift { I := CategoryTheory.Limits.image g.hom, m := CategoryTheory.Limits.image.ΞΉ g.hom, m_mono := β―, e := CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left k) (CategoryTheory.Limits.factorThruImage g.hom), fac := β― }) β―) - CategoryTheory.MonoOver.liftComp π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {X Z : C} {Y : D} (F : CategoryTheory.Functor (CategoryTheory.Over X) (CategoryTheory.Over Y)) (G : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over Z)) (hβ : β (f : CategoryTheory.MonoOver X), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget X).obj f)).hom) (hβ : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (G.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) : (CategoryTheory.MonoOver.lift F hβ).comp (CategoryTheory.MonoOver.lift G hβ) β CategoryTheory.MonoOver.lift (F.comp G) β― - CategoryTheory.MonoOver.lift_map_hom π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} (F : CategoryTheory.Functor (CategoryTheory.Over Y) (CategoryTheory.Over X)) (h : β (f : CategoryTheory.MonoOver Y), CategoryTheory.Mono (F.obj ((CategoryTheory.MonoOver.forget Y).obj f)).hom) {Xβ Yβ : CategoryTheory.MonoOver Y} (f : Xβ βΆ Yβ) : ((CategoryTheory.MonoOver.lift F h).map f).hom = F.map f.hom - CategoryTheory.MonoOver.congr_inverse π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).inverse = (CategoryTheory.MonoOver.lift (CategoryTheory.Over.post e.inverse) β―).comp (CategoryTheory.MonoOver.mapIso (e.unitIso.symm.app X)).functor - CategoryTheory.MonoOver.slice π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A : C} {f : CategoryTheory.Over A} (hβ : β (g : CategoryTheory.MonoOver f), CategoryTheory.Mono (f.iteratedSliceEquiv.functor.obj ((CategoryTheory.MonoOver.forget f).obj g)).hom) (hβ : β (g : CategoryTheory.MonoOver f.left), CategoryTheory.Mono (f.iteratedSliceEquiv.inverse.obj ((CategoryTheory.MonoOver.forget f.left).obj g)).hom) : CategoryTheory.MonoOver f β CategoryTheory.MonoOver f.left - CategoryTheory.MonoOver.mapIso_counitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : (CategoryTheory.MonoOver.mapIso e).counitIso = (CategoryTheory.MonoOver.mapComp e.inv e.hom).symm βͺβ« CategoryTheory.eqToIso β― βͺβ« CategoryTheory.MonoOver.mapId B - CategoryTheory.MonoOver.mapIso_unitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : (CategoryTheory.MonoOver.mapIso e).unitIso = ((CategoryTheory.MonoOver.mapComp e.hom e.inv).symm βͺβ« CategoryTheory.eqToIso β― βͺβ« CategoryTheory.MonoOver.mapId A).symm - CategoryTheory.MonoOver.commSqOfHasStrongEpiMonoFactorisation π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver Y)) (c : CategoryTheory.Limits.Cocone F) : CategoryTheory.CommSq (CategoryTheory.Limits.Sigma.desc fun i => CategoryTheory.Over.Hom.left (c.ΞΉ.app i).hom) (CategoryTheory.MonoOver.strongEpiMonoFactorisationSigmaDesc F).e c.pt.arrow (CategoryTheory.MonoOver.strongEpiMonoFactorisationSigmaDesc F).m - CategoryTheory.MonoOver.liftStructOfHasStrongEpiMonoFactorisation π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver Y)) (c : CategoryTheory.Limits.Cocone F) : β―.LiftStruct - CategoryTheory.MonoOver.congr_unitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).unitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.MonoOver.isoMk (e.unitIso.app Y.obj.left) β―) β― - CategoryTheory.MonoOver.congr_counitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).counitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.MonoOver.isoMk (e.counitIso.app Y.obj.left) β―) β― - CategoryTheory.Subobject.equivMonoOver π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : CategoryTheory.Subobject X β CategoryTheory.MonoOver X - CategoryTheory.Subobject.representative π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Functor (CategoryTheory.Subobject X) (CategoryTheory.MonoOver X) - CategoryTheory.Subobject.instIsEquivalenceMonoOverRepresentative π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Subobject.representative.IsEquivalence - CategoryTheory.Subobject.lower π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {Y : D} (F : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.MonoOver Y)) : CategoryTheory.Functor (CategoryTheory.Subobject X) (CategoryTheory.Subobject Y) - CategoryTheory.Subobject.lowerEquivalence π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} (e : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B) : CategoryTheory.Subobject A β CategoryTheory.Subobject B - CategoryTheory.Subobject.thinSkeleton_mk_representative_eq_self π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (A : CategoryTheory.Subobject X) : CategoryTheory.ThinSkeleton.mk (CategoryTheory.Subobject.representative.obj A) = A - CategoryTheory.Subobject.representative_coe π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (Y : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.representative.obj Y).obj.left = CategoryTheory.Subobject.underlying.obj Y - CategoryTheory.Subobject.representative_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (Y : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.representative.obj Y).arrow = Y.arrow - CategoryTheory.MonoOver.subobjectMk_le_mk_of_hom π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {P Q : CategoryTheory.MonoOver X} (f : P βΆ Q) : CategoryTheory.Subobject.mk P.obj.hom β€ CategoryTheory.Subobject.mk Q.obj.hom - CategoryTheory.MonoOver.isIso_iff_subobjectMk_eq π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {P Q : CategoryTheory.MonoOver X} (f : P βΆ Q) : CategoryTheory.IsIso f β CategoryTheory.Subobject.mk P.obj.hom = CategoryTheory.Subobject.mk Q.obj.hom - CategoryTheory.Subobject.representativeIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (A : CategoryTheory.MonoOver X) : CategoryTheory.Subobject.representative.obj ((CategoryTheory.toThinSkeleton (CategoryTheory.MonoOver X)).obj A) β A - CategoryTheory.Subobject.lowerAdjunction π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} {L : CategoryTheory.Functor (CategoryTheory.MonoOver A) (CategoryTheory.MonoOver B)} {R : CategoryTheory.Functor (CategoryTheory.MonoOver B) (CategoryTheory.MonoOver A)} (h : L β£ R) : CategoryTheory.Subobject.lower L β£ CategoryTheory.Subobject.lower R - CategoryTheory.Subobject.lowerEquivalence_functor π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} (e : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B) : (CategoryTheory.Subobject.lowerEquivalence e).functor = CategoryTheory.Subobject.lower e.functor - CategoryTheory.Subobject.lowerEquivalence_inverse π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} (e : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B) : (CategoryTheory.Subobject.lowerEquivalence e).inverse = CategoryTheory.Subobject.lower e.inverse - CategoryTheory.Subobject.lowerβ π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (F : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.Functor (CategoryTheory.MonoOver Y) (CategoryTheory.MonoOver Z))) : CategoryTheory.Functor (CategoryTheory.Subobject X) (CategoryTheory.Functor (CategoryTheory.Subobject Y) (CategoryTheory.Subobject Z)) - CategoryTheory.Subobject.lower_iso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (Fβ Fβ : CategoryTheory.Functor (CategoryTheory.MonoOver X) (CategoryTheory.MonoOver Y)) (h : Fβ β Fβ) : CategoryTheory.Subobject.lower Fβ = CategoryTheory.Subobject.lower Fβ - CategoryTheory.Subobject.existsCompRepresentativeIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) : (CategoryTheory.Subobject.exists f).comp CategoryTheory.Subobject.representative β CategoryTheory.Subobject.representative.comp (CategoryTheory.MonoOver.exists f) - CategoryTheory.Subobject.lowerCompRepresentativeIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (F : CategoryTheory.Functor (CategoryTheory.MonoOver Y) (CategoryTheory.MonoOver X)) : (CategoryTheory.Subobject.lower F).comp CategoryTheory.Subobject.representative β CategoryTheory.Subobject.representative.comp F - CategoryTheory.MonoOver.isIso_hom_left_iff_subobjectMk_eq π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {P Q : CategoryTheory.MonoOver X} (f : P βΆ Q) : CategoryTheory.IsIso (CategoryTheory.Over.Hom.left f.hom) β CategoryTheory.Subobject.mk P.obj.hom = CategoryTheory.Subobject.mk Q.obj.hom - CategoryTheory.Subobject.lower_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (F : CategoryTheory.Functor (CategoryTheory.MonoOver Y) (CategoryTheory.MonoOver X)) : (CategoryTheory.toThinSkeleton (CategoryTheory.MonoOver Y)).comp (CategoryTheory.Subobject.lower F) = F.comp (CategoryTheory.toThinSkeleton (CategoryTheory.MonoOver X)) - CategoryTheory.Subobject.lowerEquivalence_counitIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} (e : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B) : (CategoryTheory.Subobject.lowerEquivalence e).counitIso = CategoryTheory.eqToIso β― - CategoryTheory.Subobject.lowerEquivalence_unitIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : C} {B : D} (e : CategoryTheory.MonoOver A β CategoryTheory.MonoOver B) : (CategoryTheory.Subobject.lowerEquivalence e).unitIso = CategoryTheory.eqToIso β― - CategoryTheory.MonoOver.Factors π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.MonoOver Y) (f : X βΆ Y) : Prop - CategoryTheory.MonoOver.factorThru π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.MonoOver Y) (f : X βΆ Y) (h : P.Factors f) : X βΆ P.obj.left - CategoryTheory.MonoOver.factors_congr π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {f g : CategoryTheory.MonoOver X} {Y : C} (h : Y βΆ X) (e : f β g) : f.Factors h β g.Factors h - CategoryTheory.Subobject.factors_iff π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.Subobject Y) (f : X βΆ Y) : P.Factors f β (CategoryTheory.Subobject.representative.obj P).Factors f - CategoryTheory.essentiallySmall_monoOver_iff_small_subobject π Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type uβ} [CategoryTheory.Category.{v, uβ} C] (X : C) : CategoryTheory.EssentiallySmall.{w, v, max uβ v} (CategoryTheory.MonoOver X) β Small.{w, max uβ v} (CategoryTheory.Subobject X) - CategoryTheory.essentiallySmall_monoOver π Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type uβ} [CategoryTheory.Category.{v, uβ} C] [CategoryTheory.LocallySmall.{w, v, uβ} C] [CategoryTheory.WellPowered.{w, v, uβ} C] (X : C) : CategoryTheory.EssentiallySmall.{w, v, max uβ v} (CategoryTheory.MonoOver X) - CategoryTheory.wellPowered_of_essentiallySmall_monoOver π Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type uβ} [CategoryTheory.Category.{v, uβ} C] [CategoryTheory.LocallySmall.{w, v, uβ} C] (h : β (X : C), CategoryTheory.EssentiallySmall.{w, v, max uβ v} (CategoryTheory.MonoOver X)) : CategoryTheory.WellPowered.{w, v, uβ} C - CategoryTheory.MonoOver.instInhabited π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Inhabited (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.instTop π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Top (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.instBot π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {X : C} : Bot (CategoryTheory.MonoOver X) - CategoryTheory.MonoOver.top_left π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : β€.obj.left = X - CategoryTheory.MonoOver.bot_left π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] (X : C) : β₯.obj.left = β₯_ C - CategoryTheory.MonoOver.leTop π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (f : CategoryTheory.MonoOver X) : f βΆ β€ - CategoryTheory.MonoOver.botCoeIsoZero π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroObject C] {B : C} : β₯.obj.left β 0 - CategoryTheory.MonoOver.botLE π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {X : C} (f : CategoryTheory.MonoOver X) : β₯ βΆ f - CategoryTheory.MonoOver.top_arrow π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : β€.arrow = CategoryTheory.CategoryStruct.id X - CategoryTheory.MonoOver.bot_arrow π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {X : C} : β₯.arrow = CategoryTheory.Limits.initial.to X - CategoryTheory.MonoOver.inf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} : CategoryTheory.Functor (CategoryTheory.MonoOver A) (CategoryTheory.Functor (CategoryTheory.MonoOver A) (CategoryTheory.MonoOver A)) - CategoryTheory.MonoOver.pullbackTop π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) : (CategoryTheory.MonoOver.pullback f).obj β€ β β€ - CategoryTheory.MonoOver.mapTop π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.map f).obj β€ β CategoryTheory.MonoOver.mk f - CategoryTheory.MonoOver.sup π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A : C} : CategoryTheory.Functor (CategoryTheory.MonoOver A) (CategoryTheory.Functor (CategoryTheory.MonoOver A) (CategoryTheory.MonoOver A)) - CategoryTheory.MonoOver.pullbackSelf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B : C} (f : A βΆ B) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.pullback f).obj (CategoryTheory.MonoOver.mk f) β β€ - CategoryTheory.MonoOver.mapBot π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.MonoOver.map f).obj β₯ β β₯ - CategoryTheory.MonoOver.topLEPullbackSelf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B : C} (f : A βΆ B) [CategoryTheory.Mono f] : β€ βΆ (CategoryTheory.MonoOver.pullback f).obj (CategoryTheory.MonoOver.mk f) - CategoryTheory.MonoOver.infLELeft π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} (f g : CategoryTheory.MonoOver A) : (CategoryTheory.MonoOver.inf.obj f).obj g βΆ f - CategoryTheory.MonoOver.infLERight π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} (f g : CategoryTheory.MonoOver A) : (CategoryTheory.MonoOver.inf.obj f).obj g βΆ g - CategoryTheory.MonoOver.leSupLeft π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A : C} (f g : CategoryTheory.MonoOver A) : f βΆ (CategoryTheory.MonoOver.sup.obj f).obj g - CategoryTheory.MonoOver.leSupRight π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A : C} (f g : CategoryTheory.MonoOver A) : g βΆ (CategoryTheory.MonoOver.sup.obj f).obj g - CategoryTheory.MonoOver.bot_arrow_eq_zero π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroMorphisms C] {B : C} : β₯.arrow = 0 - CategoryTheory.MonoOver.leInf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} (f g h : CategoryTheory.MonoOver A) : (h βΆ f) β (h βΆ g) β (h βΆ (CategoryTheory.MonoOver.inf.obj f).obj g) - CategoryTheory.MonoOver.supLe π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A : C} (f g h : CategoryTheory.MonoOver A) : (f βΆ h) β (g βΆ h) β ((CategoryTheory.MonoOver.sup.obj f).obj g βΆ h) - CategoryTheory.MonoOver.inf_obj π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} (f : CategoryTheory.MonoOver A) : CategoryTheory.MonoOver.inf.obj f = (CategoryTheory.MonoOver.pullback f.arrow).comp (CategoryTheory.MonoOver.map f.arrow) - CategoryTheory.Subobject.inf_eq_map_pullback' π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} (fβ : CategoryTheory.MonoOver A) (fβ : CategoryTheory.Subobject A) : (CategoryTheory.Subobject.inf.obj (Quotient.mk'' fβ)).obj fβ = (CategoryTheory.Subobject.map fβ.arrow).obj ((CategoryTheory.Subobject.pullback fβ.arrow).obj fβ) - CategoryTheory.MonoOver.inf_map_app π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} {Xβ Yβ : CategoryTheory.MonoOver A} (k : Xβ βΆ Yβ) (g : CategoryTheory.MonoOver A) : (CategoryTheory.MonoOver.inf.map k).app g = CategoryTheory.MonoOver.homMk (CategoryTheory.Limits.pullback.lift (CategoryTheory.Limits.pullback.fst ((CategoryTheory.MonoOver.forget A).obj g).hom Xβ.arrow) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.snd ((CategoryTheory.MonoOver.forget A).obj g).hom Xβ.arrow) (CategoryTheory.Over.Hom.left k.hom)) β―) β― - CategoryTheory.IsGrothendieckAbelian.isColimitMapCoconeOfSubobjectMkEqISup π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] (c : CategoryTheory.Limits.Cocone (F.comp (CategoryTheory.MonoOver.forget X))) [CategoryTheory.Mono c.pt.hom] (h : CategoryTheory.Subobject.mk c.pt.hom = β¨ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom) : CategoryTheory.Limits.IsColimit ((CategoryTheory.Over.forget X).mapCocone c) - CategoryTheory.IsGrothendieckAbelian.mono_of_isColimit_monoOver π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt βΆ X) (hf : β (j : J), CategoryTheory.CategoryStruct.comp (c.ΞΉ.app j) f = (F.obj j).obj.hom) : CategoryTheory.Mono f - CategoryTheory.IsGrothendieckAbelian.exists_isIso_of_functor_from_monoOver π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) {ΞΊ : Cardinal.{w}} [hΞΊ : Fact ΞΊ.IsRegular] [CategoryTheory.IsCardinalFiltered J ΞΊ] (hXΞΊ : HasCardinalLT (CategoryTheory.Subobject X) ΞΊ) (c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))) (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt βΆ X) (hf : β (j : J), CategoryTheory.CategoryStruct.comp (c.ΞΉ.app j) f = (F.obj j).obj.hom) (h : CategoryTheory.Epi f) : β j, CategoryTheory.IsIso (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.subobjectMk_of_isColimit_eq_iSup π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] (F : CategoryTheory.Functor J (CategoryTheory.MonoOver X)) [CategoryTheory.IsFiltered J] {c : CategoryTheory.Limits.Cocone (F.comp ((CategoryTheory.MonoOver.forget X).comp (CategoryTheory.Over.forget X)))} (hc : CategoryTheory.Limits.IsColimit c) (f : c.pt βΆ X) (hf : β (j : J), CategoryTheory.CategoryStruct.comp (c.ΞΉ.app j) f = (F.obj j).obj.hom) : CategoryTheory.Subobject.mk f = β¨ j, CategoryTheory.Subobject.mk (F.obj j).obj.hom - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.F π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {jβ : J} (y : X βΆ Y.obj jβ) : CategoryTheory.Functor (CategoryTheory.Under jβ) (CategoryTheory.MonoOver X) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.F π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (z : X βΆ c.pt) [CategoryTheory.Mono c.ΞΉ] : CategoryTheory.Functor J (CategoryTheory.MonoOver X) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.F_obj π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (z : X βΆ c.pt) [CategoryTheory.Mono c.ΞΉ] (j : J) : (CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.F z).obj j = CategoryTheory.MonoOver.mk ((CategoryTheory.Limits.pullback.snd c.ΞΉ ((CategoryTheory.Functor.const J).map z)).app j) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.F_obj π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {jβ : J} (y : X βΆ Y.obj jβ) (j : CategoryTheory.Under jβ) : (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.F y).obj j = CategoryTheory.MonoOver.mk ((CategoryTheory.Limits.kernel.ΞΉ (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.g y)).app j) - CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.F_map π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cocone Y} (z : X βΆ c.pt) [CategoryTheory.Mono c.ΞΉ] {j j' : J} (f : j βΆ j') : (CategoryTheory.IsGrothendieckAbelian.IsPresentable.surjectivity.F z).map f = CategoryTheory.MonoOver.homMk ((CategoryTheory.Limits.pullback c.ΞΉ ((CategoryTheory.Functor.const J).map z)).map f) β― - CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.F_map π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.ColimCoyoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {X : C} {J : Type w} [CategoryTheory.SmallCategory J] {Y : CategoryTheory.Functor J C} {jβ : J} (y : X βΆ Y.obj jβ) {j j' : CategoryTheory.Under jβ} (f : j βΆ j') : (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.F y).map f = CategoryTheory.MonoOver.homMk ((CategoryTheory.Limits.kernel (CategoryTheory.IsGrothendieckAbelian.IsPresentable.injectivityβ.g y)).map f) β― - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (Aβ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] : CategoryTheory.Functor J (CategoryTheory.MonoOver X) - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver_obj π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (Aβ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] (j : J) : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver hG Aβ J).obj j = CategoryTheory.MonoOver.mk (transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j Aβ).arrow - CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver_map π Mathlib.CategoryTheory.Abelian.GrothendieckCategory.EnoughInjectives
{C : Type u} [CategoryTheory.Category.{v, u} C] {G : C} [CategoryTheory.Abelian C] (hG : CategoryTheory.IsSeparator G) {X : C} [CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] (Aβ : CategoryTheory.Subobject X) (J : Type w) [LinearOrder J] [OrderBot J] [SuccOrder J] [WellFoundedLT J] {j j' : J} (f : j βΆ j') : (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.functorToMonoOver hG Aβ J).map f = CategoryTheory.MonoOver.homMk ((transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j Aβ).ofLE (transfiniteIterate (CategoryTheory.IsGrothendieckAbelian.generatingMonomorphisms.largerSubobject hG) j' Aβ) β―) β― - CategoryTheory.Filtration.mk π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (toMonoOver : CategoryTheory.Functor I (CategoryTheory.MonoOver X)) : CategoryTheory.Filtration X I - CategoryTheory.Filtration.toMonoOver π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (self : CategoryTheory.Filtration X I) : CategoryTheory.Functor I (CategoryTheory.MonoOver X) - CategoryTheory.Filtration.diagram_obj π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (F : CategoryTheory.Filtration X I) (Xβ : I) : F.diagram.obj Xβ = (F.toMonoOver.obj Xβ).obj.left - CategoryTheory.Filtration.ΞΉ_app π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (F : CategoryTheory.Filtration X I) (i : I) : F.ΞΉ.app i = (F.toMonoOver.obj i).obj.hom - CategoryTheory.Filtration.diagram_map π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] (F : CategoryTheory.Filtration X I) {Xβ Yβ : I} (f : Xβ βΆ Yβ) : F.diagram.map f = CategoryTheory.Over.Hom.left (F.toMonoOver.map f).hom - CategoryTheory.FilteredObject.Hom.comm_assoc π Mathlib.CategoryTheory.Filtration.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {I : Type u_1} [CategoryTheory.Category.{u_2, u_1} I] {F G : CategoryTheory.FilteredObject C I} (self : F.Hom G) (i : I) {Z : C} (h : ((CategoryTheory.Functor.const I).obj G.X).obj i βΆ Z) : CategoryTheory.CategoryStruct.comp (self.natTrans.app i) (CategoryTheory.CategoryStruct.comp (G.filtration.ΞΉ.app i) h) = CategoryTheory.CategoryStruct.comp (F.filtration.ΞΉ.app i) (CategoryTheory.CategoryStruct.comp self.hom h) - CategoryTheory.subterminalsEquivMonoOverTerminal π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : CategoryTheory.Subterminals C β CategoryTheory.MonoOver (β€_ C) - CategoryTheory.subterminalsEquivMonoOverTerminal_inverse_obj_obj π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] (X : CategoryTheory.MonoOver (β€_ C)) : ((CategoryTheory.subterminalsEquivMonoOverTerminal C).inverse.obj X).obj = X.obj.left - CategoryTheory.subterminalsEquivMonoOverTerminal_functor_obj_obj π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] (X : CategoryTheory.Subterminals C) : ((CategoryTheory.subterminalsEquivMonoOverTerminal C).functor.obj X).obj = CategoryTheory.Over.mk (CategoryTheory.Limits.terminal.from X.obj) - CategoryTheory.subterminals_to_monoOver_terminal_comp_forget π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).functor.comp ((CategoryTheory.MonoOver.forget (β€_ C)).comp (CategoryTheory.Over.forget (β€_ C))) = CategoryTheory.subterminalInclusion C - CategoryTheory.monoOver_terminal_to_subterminals_comp π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).inverse.comp (CategoryTheory.subterminalInclusion C) = (CategoryTheory.MonoOver.forget (β€_ C)).comp (CategoryTheory.Over.forget (β€_ C)) - CategoryTheory.subterminalsEquivMonoOverTerminal_functor_map π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] {Xβ Yβ : CategoryTheory.Subterminals C} (f : Xβ βΆ Yβ) : (CategoryTheory.subterminalsEquivMonoOverTerminal C).functor.map f = CategoryTheory.MonoOver.homMk f.hom β― - CategoryTheory.subterminalsEquivMonoOverTerminal_inverse_map π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] {Xβ Yβ : CategoryTheory.MonoOver (β€_ C)} (f : Xβ βΆ Yβ) : (CategoryTheory.subterminalsEquivMonoOverTerminal C).inverse.map f = CategoryTheory.ObjectProperty.homMk f.hom.left - CategoryTheory.subterminalsEquivMonoOverTerminal_unitIso π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl X) β― - CategoryTheory.subterminalsEquivMonoOverTerminal_counitIso π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.MonoOver.isoMk (CategoryTheory.Iso.refl (({ obj := fun X => { obj := X.obj.left, property := β― }, map := fun {X Y} f => CategoryTheory.ObjectProperty.homMk f.hom.left, map_id := β―, map_comp := β― }.comp { obj := fun X => { obj := CategoryTheory.Over.mk (CategoryTheory.Limits.terminal.from X.obj), property := β― }, map := fun {X Y} f => CategoryTheory.MonoOver.homMk f.hom β―, map_id := β―, map_comp := β― }).obj X).obj.left) β―) β― - CategoryTheory.isEventuallyConstant_of_isArtinianObject π Mathlib.CategoryTheory.Subobject.ArtinianObject
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} [CategoryTheory.IsArtinianObject X] (F : CategoryTheory.Functor β (CategoryTheory.MonoOver X)α΅α΅) : CategoryTheory.IsFiltered.IsEventuallyConstant F - CategoryTheory.isArtinianObject_iff_isEventuallyConstant π Mathlib.CategoryTheory.Subobject.ArtinianObject
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.IsArtinianObject X β β (F : CategoryTheory.Functor β (CategoryTheory.MonoOver X)α΅α΅), CategoryTheory.IsFiltered.IsEventuallyConstant F - CategoryTheory.isEventuallyConstant_of_isNoetherianObject π Mathlib.CategoryTheory.Subobject.NoetherianObject
{C : Type u} [CategoryTheory.Category.{v, u} C] {X : C} [CategoryTheory.IsNoetherianObject X] (F : CategoryTheory.Functor β (CategoryTheory.MonoOver X)) : CategoryTheory.IsFiltered.IsEventuallyConstant F - CategoryTheory.isNoetherianObject_iff_isEventuallyConstant π Mathlib.CategoryTheory.Subobject.NoetherianObject
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.IsNoetherianObject X β β (F : CategoryTheory.Functor β (CategoryTheory.MonoOver X)), CategoryTheory.IsFiltered.IsEventuallyConstant F - CategoryTheory.Subfunctor.equivalenceMonoOver π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Subfunctor F β CategoryTheory.MonoOver F - CategoryTheory.Subfunctor.equivalenceMonoOver_functor_obj π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (A : CategoryTheory.Subfunctor F) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).functor.obj A = CategoryTheory.MonoOver.mk A.ΞΉ - CategoryTheory.Subfunctor.equivalenceMonoOver_inverse_obj π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.MonoOver F) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).inverse.obj X = CategoryTheory.Subfunctor.range X.arrow - CategoryTheory.Subfunctor.equivalenceMonoOver_functor_map π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {A B : CategoryTheory.Subfunctor F} (f : A βΆ B) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).functor.map f = CategoryTheory.MonoOver.homMk (CategoryTheory.Subfunctor.homOfLe β―) β― - CategoryTheory.Subfunctor.equivalenceMonoOver_inverse_map π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X Y : CategoryTheory.MonoOver F} (f : X βΆ Y) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).inverse.map f = CategoryTheory.homOfLE β― - CategoryTheory.Subfunctor.equivalenceMonoOver_unitIso π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.eqToIso β―) β― - CategoryTheory.Subfunctor.equivalenceMonoOver_counitIso π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.MonoOver.isoMk (CategoryTheory.asIso (CategoryTheory.Subfunctor.toRange X.arrow)).symm β―) β― - CategoryTheory.SubobjectRepresentableBy.iso π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.MonoOver.mk m β CategoryTheory.Subobject.representative.obj ((CategoryTheory.Subobject.pullback (h.Ο m)).obj h.Ξ©β) - CategoryTheory.Classifier.SubobjectRepresentableBy.iso π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.MonoOver.mk m β CategoryTheory.Subobject.representative.obj ((CategoryTheory.Subobject.pullback (h.Ο m)).obj h.Ξ©β) - CategoryTheory.SubobjectRepresentableBy.iso_inv_hom_left_comp π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) m = ((CategoryTheory.Subobject.pullback (h.Ο m)).obj h.Ξ©β).arrow - CategoryTheory.Classifier.SubobjectRepresentableBy.iso_inv_hom_left_comp π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) m = ((CategoryTheory.Subobject.pullback (h.Ο m)).obj h.Ξ©β).arrow - CategoryTheory.SubobjectRepresentableBy.iso_inv_left_Ο π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) (h.Ο m) = CategoryTheory.Subobject.pullbackΟ (h.Ο m) h.Ξ©β - CategoryTheory.Classifier.SubobjectRepresentableBy.iso_inv_left_Ο π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) (h.Ο m) = CategoryTheory.Subobject.pullbackΟ (h.Ο m) h.Ξ©β - CategoryTheory.SubobjectRepresentableBy.iso_inv_hom_left_comp_assoc π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] {Z : C} (hβ : X βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) (CategoryTheory.CategoryStruct.comp m hβ) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Subobject.pullback (h.Ο m)).obj h.Ξ©β).arrow hβ - CategoryTheory.SubobjectRepresentableBy.iso_inv_left_Ο_assoc π Mathlib.CategoryTheory.Subobject.Classifier.Defs
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasPullbacks C] {Ξ© : C} (h : CategoryTheory.SubobjectRepresentableBy Ξ©) {U X : C} (m : U βΆ X) [CategoryTheory.Mono m] {Z : C} (hβ : CategoryTheory.Subobject.underlying.obj h.Ξ©β βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Over.Hom.left (h.iso m).inv.hom) (CategoryTheory.CategoryStruct.comp (h.Ο m) hβ) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.pullbackΟ (h.Ο m) h.Ξ©β) hβ - Types.monoOverEquivalenceSet π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) : CategoryTheory.MonoOver Ξ± β Set Ξ± - Types.monoOverEquivalenceSet_inverse_obj π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) (s : Set Ξ±) : (Types.monoOverEquivalenceSet Ξ±).inverse.obj s = CategoryTheory.MonoOver.mk (TypeCat.ofHom Subtype.val) - Types.monoOverEquivalenceSet_functor_obj π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) (f : CategoryTheory.MonoOver Ξ±) : (Types.monoOverEquivalenceSet Ξ±).functor.obj f = Set.range β(CategoryTheory.ConcreteCategory.hom f.obj.hom) - Types.monoOverEquivalenceSet_inverse_map π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) {s t : Set Ξ±} (b : s βΆ t) : (Types.monoOverEquivalenceSet Ξ±).inverse.map b = CategoryTheory.MonoOver.homMk (TypeCat.ofHom fun w => β¨βw, β―β©) β― - Types.monoOverEquivalenceSet_functor_map π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) {f g : CategoryTheory.MonoOver Ξ±} (t : f βΆ g) : (Types.monoOverEquivalenceSet Ξ±).functor.map t = CategoryTheory.homOfLE β― - Types.monoOverEquivalenceSet_counitIso π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) : (Types.monoOverEquivalenceSet Ξ±).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - Types.monoOverEquivalenceSet_unitIso π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) : (Types.monoOverEquivalenceSet Ξ±).unitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.MonoOver.isoMk (Equiv.ofInjective β(CategoryTheory.ConcreteCategory.hom f.obj.hom) β―).toIso β―) β―
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