Loogle!
Result
Found 490 declarations mentioning CategoryTheory.Subobject. Of these, only the first 200 are shown.
- CategoryTheory.Subobject π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : Type (max uβ vβ) - CategoryTheory.instPartialOrderSubobject π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : PartialOrder (CategoryTheory.Subobject X) - CategoryTheory.Subobject.instCoeOut π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CoeOut (CategoryTheory.Subobject X) C - CategoryTheory.Subobject.skeletal π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) : CategoryTheory.Skeletal (CategoryTheory.Subobject X) - CategoryTheory.Subobject.mk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X A : C} (f : A βΆ X) [CategoryTheory.Mono f] : CategoryTheory.Subobject X - CategoryTheory.Subobject.underlying π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Functor (CategoryTheory.Subobject X) C - CategoryTheory.Subobject.hasColimitsOfSize π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasStrongEpiMonoFactorisations C] : CategoryTheory.Limits.HasColimitsOfSize.{w, w', max uβ vβ, max uβ vβ} (CategoryTheory.Subobject X) - CategoryTheory.Subobject.hasFiniteLimits π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasFiniteLimits (CategoryTheory.Over X)] : CategoryTheory.Limits.HasFiniteLimits (CategoryTheory.Subobject X) - CategoryTheory.Subobject.hasLimitsOfSize π Mathlib.CategoryTheory.Subobject.Basic
{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', max uβ vβ, max uβ vβ} (CategoryTheory.Subobject X) - CategoryTheory.Subobject.hasLimitsOfShape π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] [CategoryTheory.Limits.HasLimitsOfShape J (CategoryTheory.Over X)] : CategoryTheory.Limits.HasLimitsOfShape J (CategoryTheory.Subobject X) - CategoryTheory.Subobject.ind π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (p : CategoryTheory.Subobject X β Prop) (h : β β¦A : Cβ¦ (f : A βΆ X) [inst : CategoryTheory.Mono f], p (CategoryTheory.Subobject.mk f)) (P : CategoryTheory.Subobject X) : p P - 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.arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (Y : CategoryTheory.Subobject X) : CategoryTheory.Subobject.underlying.obj Y βΆ X - CategoryTheory.Subobject.arrow_mono π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (Y : CategoryTheory.Subobject X) : CategoryTheory.Mono Y.arrow - CategoryTheory.Subobject.instIsEquivalenceMonoOverRepresentative π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : CategoryTheory.Subobject.representative.IsEquivalence - CategoryTheory.Subobject.mapIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (e : A β B) : CategoryTheory.Subobject A β CategoryTheory.Subobject B - CategoryTheory.Subobject.mapIsoToOrderIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (e : X β Y) : CategoryTheory.Subobject X βo CategoryTheory.Subobject Y - CategoryTheory.Subobject.exists π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) : CategoryTheory.Functor (CategoryTheory.Subobject X) (CategoryTheory.Subobject Y) - CategoryTheory.Subobject.mk_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Subobject X) : CategoryTheory.Subobject.mk P.arrow = P - CategoryTheory.Subobject.pullback π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) : CategoryTheory.Functor (CategoryTheory.Subobject Y) (CategoryTheory.Subobject X) - CategoryTheory.Subobject.mk_surjective π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (S : CategoryTheory.Subobject X) : β A i, β (x : CategoryTheory.Mono i), S = CategoryTheory.Subobject.mk i - CategoryTheory.Subobject.underlyingIso π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Subobject.underlying.obj (CategoryTheory.Subobject.mk f) β X - CategoryTheory.Subobject.map π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Functor (CategoryTheory.Subobject X) (CategoryTheory.Subobject Y) - CategoryTheory.Subobject.isoOfMkEqMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f = CategoryTheory.Subobject.mk g) : Aβ β Aβ - CategoryTheory.Subobject.instFaithfulPullback π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) : (CategoryTheory.Subobject.pullback f).Faithful - CategoryTheory.Subobject.isoOfEqMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (h : X = CategoryTheory.Subobject.mk f) : CategoryTheory.Subobject.underlying.obj X β A - CategoryTheory.Subobject.isoOfMkEq π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (f : A βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (h : CategoryTheory.Subobject.mk f = X) : A β CategoryTheory.Subobject.underlying.obj X - CategoryTheory.Subobject.map_id π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.map (CategoryTheory.CategoryStruct.id X)).obj x = x - CategoryTheory.Subobject.ofMkLEMk_refl π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] : CategoryTheory.Subobject.ofMkLEMk f f β― = CategoryTheory.CategoryStruct.id Aβ - CategoryTheory.Subobject.pullback_id π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} [CategoryTheory.Limits.HasPullbacks C] (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.pullback (CategoryTheory.CategoryStruct.id X)).obj x = x - CategoryTheory.Subobject.existsPullbackAdj π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) [CategoryTheory.Limits.HasPullbacks C] : CategoryTheory.Subobject.exists f β£ CategoryTheory.Subobject.pullback f - CategoryTheory.Subobject.indβ π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (p : CategoryTheory.Subobject X β CategoryTheory.Subobject X β Prop) (h : β β¦A B : Cβ¦ (f : A βΆ X) (g : B βΆ X) [inst : CategoryTheory.Mono f] [inst_1 : CategoryTheory.Mono g], p (CategoryTheory.Subobject.mk f) (CategoryTheory.Subobject.mk g)) (P Q : CategoryTheory.Subobject X) : p P Q - CategoryTheory.Subobject.map_obj_injective π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : Function.Injective (CategoryTheory.Subobject.map f).obj - CategoryTheory.Subobject.isoOfEq π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y : CategoryTheory.Subobject B) (h : X = Y) : CategoryTheory.Subobject.underlying.obj X β CategoryTheory.Subobject.underlying.obj Y - CategoryTheory.Subobject.mapPullbackAdj π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Subobject.map f β£ CategoryTheory.Subobject.pullback f - CategoryTheory.Subobject.exists_iso_map π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Subobject.exists f = CategoryTheory.Subobject.map f - CategoryTheory.Subobject.ofMkLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) : Aβ βΆ Aβ - 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.instMonoOfMkLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) : CategoryTheory.Mono (CategoryTheory.Subobject.ofMkLEMk f g h) - CategoryTheory.Subobject.ofLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (h : X β€ CategoryTheory.Subobject.mk f) : CategoryTheory.Subobject.underlying.obj X βΆ A - CategoryTheory.Subobject.ofMkLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (f : A βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (h : CategoryTheory.Subobject.mk f β€ X) : A βΆ CategoryTheory.Subobject.underlying.obj X - CategoryTheory.Subobject.mk_eq_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (i : Aβ β Aβ) (w : CategoryTheory.CategoryStruct.comp i.hom g = f) : CategoryTheory.Subobject.mk f = CategoryTheory.Subobject.mk g - 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.imageFactorisation π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) (x : CategoryTheory.Subobject X) : CategoryTheory.Limits.ImageFactorisation (CategoryTheory.CategoryStruct.comp x.arrow f) - CategoryTheory.Subobject.instMonoOfLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (h : X β€ CategoryTheory.Subobject.mk f) : CategoryTheory.Mono (X.ofLEMk f h) - CategoryTheory.Subobject.instMonoOfMkLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (f : A βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (h : CategoryTheory.Subobject.mk f β€ X) : CategoryTheory.Mono (CategoryTheory.Subobject.ofMkLE f X h) - CategoryTheory.Subobject.ofLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y : CategoryTheory.Subobject B) (h : X β€ Y) : CategoryTheory.Subobject.underlying.obj X βΆ CategoryTheory.Subobject.underlying.obj Y - 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.instMonoOfLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y : CategoryTheory.Subobject B) (h : X β€ Y) : CategoryTheory.Mono (X.ofLE Y h) - CategoryTheory.Subobject.mk_le_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} {fβ : Aβ βΆ B} {fβ : Aβ βΆ B} [CategoryTheory.Mono fβ] [CategoryTheory.Mono fβ] (g : Aβ βΆ Aβ) (w : CategoryTheory.CategoryStruct.comp g fβ = fβ) : CategoryTheory.Subobject.mk fβ β€ CategoryTheory.Subobject.mk fβ - CategoryTheory.Subobject.lift π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Ξ± : Sort u_1} {X : C} (F : β¦A : Cβ¦ β (f : A βΆ X) β [CategoryTheory.Mono f] β Ξ±) (h : β β¦A B : Cβ¦ (f : A βΆ X) (g : B βΆ X) [inst : CategoryTheory.Mono f] [inst_1 : CategoryTheory.Mono g] (i : A β B), CategoryTheory.CategoryStruct.comp i.hom g = f β F f = F g) : CategoryTheory.Subobject X β Ξ± - CategoryTheory.Subobject.ofMkLEMk_comp π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} {f : Aβ βΆ B} {g : Aβ βΆ B} [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g h) g = f - CategoryTheory.Subobject.isoOfMkEqMk_hom π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f = CategoryTheory.Subobject.mk g) : (CategoryTheory.Subobject.isoOfMkEqMk f g h).hom = CategoryTheory.Subobject.ofMkLEMk f g β― - CategoryTheory.Subobject.isoOfMkEqMk_inv π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) (g : Aβ βΆ B) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (h : CategoryTheory.Subobject.mk f = CategoryTheory.Subobject.mk g) : (CategoryTheory.Subobject.isoOfMkEqMk f g h).inv = CategoryTheory.Subobject.ofMkLEMk g f β― - CategoryTheory.Subobject.mk_lt_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Aβ Aβ : C} {iβ : Aβ βΆ X} {iβ : Aβ βΆ X} [CategoryTheory.Mono iβ] [CategoryTheory.Mono iβ] (f : Aβ βΆ Aβ) (fac : CategoryTheory.CategoryStruct.comp f iβ = iβ) (hf : Β¬CategoryTheory.IsIso f) : CategoryTheory.Subobject.mk iβ < CategoryTheory.Subobject.mk iβ - CategoryTheory.Subobject.mk_lt_mk_iff_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Aβ Aβ : C} {iβ : Aβ βΆ X} {iβ : Aβ βΆ X} [CategoryTheory.Mono iβ] [CategoryTheory.Mono iβ] (f : Aβ βΆ Aβ) (fac : CategoryTheory.CategoryStruct.comp f iβ = iβ) : CategoryTheory.Subobject.mk iβ < CategoryTheory.Subobject.mk iβ β Β¬CategoryTheory.IsIso f - CategoryTheory.Subobject.ofMkLE_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {f : A βΆ B} [CategoryTheory.Mono f] {X : CategoryTheory.Subobject B} (h : CategoryTheory.Subobject.mk f β€ X) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X h) X.arrow = f - CategoryTheory.Subobject.map_mk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A X Y : C} (i : A βΆ X) [CategoryTheory.Mono i] (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.Subobject.map f).obj (CategoryTheory.Subobject.mk i) = CategoryTheory.Subobject.mk (CategoryTheory.CategoryStruct.comp i f) - CategoryTheory.Subobject.ofLE_refl π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X : CategoryTheory.Subobject B) : X.ofLE X β― = CategoryTheory.CategoryStruct.id (CategoryTheory.Subobject.underlying.obj X) - CategoryTheory.Subobject.pullback_map_self π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) [CategoryTheory.Mono f] (g : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.pullback f).obj ((CategoryTheory.Subobject.map f).obj g) = g - CategoryTheory.Subobject.pullbackΟ π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (y : CategoryTheory.Subobject Y) : CategoryTheory.Subobject.underlying.obj ((CategoryTheory.Subobject.pullback f).obj y) βΆ CategoryTheory.Subobject.underlying.obj y - CategoryTheory.Subobject.underlyingIso_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlyingIso f).inv (CategoryTheory.Subobject.mk f).arrow = f - 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.Subobject.isoOfEqMk_hom π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (h : X = CategoryTheory.Subobject.mk f) : (X.isoOfEqMk f h).hom = X.ofLEMk f β― - CategoryTheory.Subobject.isoOfEqMk_inv π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (h : X = CategoryTheory.Subobject.mk f) : (X.isoOfEqMk f h).inv = CategoryTheory.Subobject.ofMkLE f X β― - CategoryTheory.Subobject.isoOfMkEq_hom π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (f : A βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (h : CategoryTheory.Subobject.mk f = X) : (CategoryTheory.Subobject.isoOfMkEq f X h).hom = CategoryTheory.Subobject.ofMkLE f X β― - CategoryTheory.Subobject.isoOfMkEq_inv π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (f : A βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (h : CategoryTheory.Subobject.mk f = X) : (CategoryTheory.Subobject.isoOfMkEq f X h).inv = X.ofLEMk f β― - CategoryTheory.Subobject.pullback_obj_mk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B X Y : C} {f : Y βΆ X} {i : A βΆ X} [CategoryTheory.Mono i] {j : B βΆ Y} [CategoryTheory.Mono j] {f' : B βΆ A} (h : CategoryTheory.IsPullback f' j i f) : (CategoryTheory.Subobject.pullback f).obj (CategoryTheory.Subobject.mk i) = CategoryTheory.Subobject.mk j - CategoryTheory.Subobject.ofLEMk_comp π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {X : CategoryTheory.Subobject B} {f : A βΆ B} [CategoryTheory.Mono f] (h : X β€ CategoryTheory.Subobject.mk f) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f h) f = X.arrow - CategoryTheory.Subobject.mk_le_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {X : CategoryTheory.Subobject B} {f : A βΆ B} [CategoryTheory.Mono f] (g : A βΆ CategoryTheory.Subobject.underlying.obj X) (w : CategoryTheory.CategoryStruct.comp g X.arrow = f) : CategoryTheory.Subobject.mk f β€ X - CategoryTheory.Subobject.ofLE_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} {X Y : CategoryTheory.Subobject B} (h : X β€ Y) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h) Y.arrow = X.arrow - CategoryTheory.Subobject.mk_eq_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {X : CategoryTheory.Subobject B} (f : A βΆ B) [CategoryTheory.Mono f] (i : A β CategoryTheory.Subobject.underlying.obj X) (w : CategoryTheory.CategoryStruct.comp i.hom X.arrow = f) : CategoryTheory.Subobject.mk f = X - 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.Subobject.isoOfEq_hom π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y : CategoryTheory.Subobject B) (h : X = Y) : (X.isoOfEq Y h).hom = X.ofLE Y β― - CategoryTheory.Subobject.isoOfEq_inv π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y : CategoryTheory.Subobject B) (h : X = Y) : (X.isoOfEq Y h).inv = Y.ofLE X β― - CategoryTheory.Subobject.underlyingIso_hom_comp_eq_mk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlyingIso f).hom f = (CategoryTheory.Subobject.mk f).arrow - 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.le_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {X : CategoryTheory.Subobject B} {f : A βΆ B} [CategoryTheory.Mono f] (g : CategoryTheory.Subobject.underlying.obj X βΆ A) (w : CategoryTheory.CategoryStruct.comp g f = X.arrow) : X β€ CategoryTheory.Subobject.mk f - 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.eq_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} {X : CategoryTheory.Subobject B} (f : A βΆ B) [CategoryTheory.Mono f] (i : CategoryTheory.Subobject.underlying.obj X β A) (w : CategoryTheory.CategoryStruct.comp i.hom f = X.arrow) : X = CategoryTheory.Subobject.mk f - CategoryTheory.Subobject.underlying_arrow π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {Y Z : CategoryTheory.Subobject X} (f : Y βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlying.map f) Z.arrow = Y.arrow - CategoryTheory.Subobject.pullback_comp π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (g : Y βΆ Z) (x : CategoryTheory.Subobject Z) : (CategoryTheory.Subobject.pullback (CategoryTheory.CategoryStruct.comp f g)).obj x = (CategoryTheory.Subobject.pullback f).obj ((CategoryTheory.Subobject.pullback g).obj x) - CategoryTheory.Subobject.underlyingIso_arrow_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] {Z : C} (h : Y βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlyingIso f).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.mk f).arrow h) = CategoryTheory.CategoryStruct.comp f h - CategoryTheory.Subobject.isPullback π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (y : CategoryTheory.Subobject Y) : CategoryTheory.IsPullback (CategoryTheory.Subobject.pullbackΟ f y) ((CategoryTheory.Subobject.pullback f).obj y).arrow y.arrow f - 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.le_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} {X Y : CategoryTheory.Subobject B} (f : CategoryTheory.Subobject.underlying.obj X βΆ CategoryTheory.Subobject.underlying.obj Y) (w : CategoryTheory.CategoryStruct.comp f Y.arrow = X.arrow) : X β€ Y - CategoryTheory.Subobject.ofMkLE_comp_ofLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (g : Aβ βΆ B) [CategoryTheory.Mono g] (hβ : CategoryTheory.Subobject.mk f β€ X) (hβ : X β€ CategoryTheory.Subobject.mk g) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X hβ) (X.ofLEMk g hβ) = CategoryTheory.Subobject.ofMkLEMk f g β― - CategoryTheory.Subobject.map_comp π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} (f : X βΆ Y) (g : Y βΆ Z) [CategoryTheory.Mono f] [CategoryTheory.Mono g] (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.map (CategoryTheory.CategoryStruct.comp f g)).obj x = (CategoryTheory.Subobject.map g).obj ((CategoryTheory.Subobject.map f).obj x) - CategoryTheory.Subobject.eq_of_comp_arrow_eq π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {P : CategoryTheory.Subobject Y} {f g : X βΆ CategoryTheory.Subobject.underlying.obj P} (h : CategoryTheory.CategoryStruct.comp f P.arrow = CategoryTheory.CategoryStruct.comp g P.arrow) : f = g - 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.eq_of_comp_arrow_eq_iff π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {P : CategoryTheory.Subobject Y} {f g : X βΆ CategoryTheory.Subobject.underlying.obj P} : f = g β CategoryTheory.CategoryStruct.comp f P.arrow = CategoryTheory.CategoryStruct.comp g P.arrow - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (h : Aβ βΆ B) [CategoryTheory.Mono h] (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) (hβ : CategoryTheory.Subobject.mk g β€ CategoryTheory.Subobject.mk h) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g hβ) (CategoryTheory.Subobject.ofMkLEMk g h hβ) = CategoryTheory.Subobject.ofMkLEMk f h β― - CategoryTheory.Subobject.underlyingIso_hom_comp_eq_mk_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] {Z : C} (h : Y βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlyingIso f).hom (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.mk f).arrow h - CategoryTheory.Subobject.arrow_congr π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A : C} (X Y : CategoryTheory.Subobject A) (h : X = Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.eqToHom β―) Y.arrow = X.arrow - CategoryTheory.Subobject.ofLE_comp_ofLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X Y : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (hβ : X β€ Y) (hβ : Y β€ CategoryTheory.Subobject.mk f) : CategoryTheory.CategoryStruct.comp (X.ofLE Y hβ) (Y.ofLEMk f hβ) = X.ofLEMk f β― - CategoryTheory.Subobject.ofMkLE_comp_ofLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (X Y : CategoryTheory.Subobject B) (hβ : CategoryTheory.Subobject.mk f β€ X) (hβ : X β€ Y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X hβ) (X.ofLE Y hβ) = CategoryTheory.Subobject.ofMkLE f Y β― - 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.ofLE_arrow_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} {X Y : CategoryTheory.Subobject B} (h : X β€ Y) {Z : C} (hβ : B βΆ Z) : CategoryTheory.CategoryStruct.comp (X.ofLE Y h) (CategoryTheory.CategoryStruct.comp Y.arrow hβ) = CategoryTheory.CategoryStruct.comp X.arrow hβ - CategoryTheory.Subobject.ofLEMk_comp_ofMkLEMk π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (X : CategoryTheory.Subobject B) (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (hβ : X β€ CategoryTheory.Subobject.mk f) (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f hβ) (CategoryTheory.Subobject.ofMkLEMk f g hβ) = X.ofLEMk g β― - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (X : CategoryTheory.Subobject B) (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) (hβ : CategoryTheory.Subobject.mk g β€ X) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g hβ) (CategoryTheory.Subobject.ofMkLE g X hβ) = CategoryTheory.Subobject.ofMkLE f X β― - CategoryTheory.Subobject.mapIsoToOrderIso_apply π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (e : X β Y) (aβ : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.mapIsoToOrderIso e) aβ = (CategoryTheory.Subobject.map e.hom).obj aβ - CategoryTheory.Subobject.eq_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} {X Y : CategoryTheory.Subobject B} (f : CategoryTheory.Subobject.underlying.obj X β CategoryTheory.Subobject.underlying.obj Y) (w : CategoryTheory.CategoryStruct.comp f.hom Y.arrow = X.arrow) : X = Y - CategoryTheory.Subobject.existsIsoImage π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) (x : CategoryTheory.Subobject X) : CategoryTheory.Subobject.underlying.obj ((CategoryTheory.Subobject.exists f).obj x) β CategoryTheory.Limits.image (CategoryTheory.CategoryStruct.comp x.arrow f) - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLEMk_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (h : Aβ βΆ B) [CategoryTheory.Mono h] (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) (hβ : CategoryTheory.Subobject.mk g β€ CategoryTheory.Subobject.mk h) {Z : C} (hβ : Aβ βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g hβ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk g h hβ) hβ) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f h β―) hβ - 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.Subobject.imageFactorisation_F_I π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.imageFactorisation f x).F.I = CategoryTheory.Subobject.underlying.obj ((CategoryTheory.Subobject.exists f).obj x) - CategoryTheory.Subobject.ofLE_comp_ofLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y Z : CategoryTheory.Subobject B) (hβ : X β€ Y) (hβ : Y β€ Z) : CategoryTheory.CategoryStruct.comp (X.ofLE Y hβ) (Y.ofLE Z hβ) = X.ofLE Z β― - 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.ofLEMk_comp_ofMkLE π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (Y : CategoryTheory.Subobject B) (hβ : X β€ CategoryTheory.Subobject.mk f) (hβ : CategoryTheory.Subobject.mk f β€ Y) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f hβ) (CategoryTheory.Subobject.ofMkLE f Y hβ) = X.ofLE Y β― - CategoryTheory.Subobject.ofMkLE_comp_ofLEMk_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (X : CategoryTheory.Subobject B) (g : Aβ βΆ B) [CategoryTheory.Mono g] (hβ : CategoryTheory.Subobject.mk f β€ X) (hβ : X β€ CategoryTheory.Subobject.mk g) {Z : C} (h : Aβ βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X hβ) (CategoryTheory.CategoryStruct.comp (X.ofLEMk g hβ) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g β―) h - CategoryTheory.Subobject.underlying_arrow_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} {Y Z : CategoryTheory.Subobject X} (f : Y βΆ Z) {Zβ : C} (h : X βΆ Zβ) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlying.map f) (CategoryTheory.CategoryStruct.comp Z.arrow h) = CategoryTheory.CategoryStruct.comp Y.arrow h - CategoryTheory.Subobject.ofLEMk_comp_ofMkLEMk_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (X : CategoryTheory.Subobject B) (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (hβ : X β€ CategoryTheory.Subobject.mk f) (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) {Z : C} (h : Aβ βΆ Z) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f hβ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g hβ) h) = CategoryTheory.CategoryStruct.comp (X.ofLEMk g β―) h - CategoryTheory.Subobject.ofMkLEMk_comp_ofMkLE_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (g : Aβ βΆ B) [CategoryTheory.Mono g] (X : CategoryTheory.Subobject B) (hβ : CategoryTheory.Subobject.mk f β€ CategoryTheory.Subobject.mk g) (hβ : CategoryTheory.Subobject.mk g β€ X) {Z : C} (h : CategoryTheory.Subobject.underlying.obj X βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLEMk f g hβ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE g X hβ) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X β―) h - CategoryTheory.Subobject.imageFactorisation_F_m π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasImages C] (f : X βΆ Y) (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.imageFactorisation f x).F.m = ((CategoryTheory.Subobject.exists f).obj x).arrow - CategoryTheory.Subobject.mapIsoToOrderIso_symm_apply π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (e : X β Y) (aβ : CategoryTheory.Subobject Y) : (RelIso.symm (CategoryTheory.Subobject.mapIsoToOrderIso e)) aβ = (CategoryTheory.Subobject.map e.inv).obj aβ - CategoryTheory.Subobject.ofLE_comp_ofLEMk_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X Y : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (hβ : X β€ Y) (hβ : Y β€ CategoryTheory.Subobject.mk f) {Z : C} (h : A βΆ Z) : CategoryTheory.CategoryStruct.comp (X.ofLE Y hβ) (CategoryTheory.CategoryStruct.comp (Y.ofLEMk f hβ) h) = CategoryTheory.CategoryStruct.comp (X.ofLEMk f β―) h - CategoryTheory.Subobject.ofMkLE_comp_ofLE_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ : C} (f : Aβ βΆ B) [CategoryTheory.Mono f] (X Y : CategoryTheory.Subobject B) (hβ : CategoryTheory.Subobject.mk f β€ X) (hβ : X β€ Y) {Z : C} (h : CategoryTheory.Subobject.underlying.obj Y βΆ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f X hβ) (CategoryTheory.CategoryStruct.comp (X.ofLE Y hβ) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f Y β―) h - CategoryTheory.Subobject.map_pullback π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {X Y Z W : C} {f : X βΆ Y} {g : X βΆ Z} {h : Y βΆ W} {k : Z βΆ W} [CategoryTheory.Mono h] [CategoryTheory.Mono g] (comm : CategoryTheory.CategoryStruct.comp f h = CategoryTheory.CategoryStruct.comp g k) (t : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk f g comm)) (p : CategoryTheory.Subobject Y) : (CategoryTheory.Subobject.map g).obj ((CategoryTheory.Subobject.pullback f).obj p) = (CategoryTheory.Subobject.pullback k).obj ((CategoryTheory.Subobject.map h).obj p) - 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.pullback_obj π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {X Y : C} (f : Y βΆ X) (x : CategoryTheory.Subobject X) : (CategoryTheory.Subobject.pullback f).obj x = CategoryTheory.Subobject.mk (CategoryTheory.Limits.pullback.snd x.arrow f) - CategoryTheory.Subobject.ofLEMk_comp_ofMkLE_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B A : C} (X : CategoryTheory.Subobject B) (f : A βΆ B) [CategoryTheory.Mono f] (Y : CategoryTheory.Subobject B) (hβ : X β€ CategoryTheory.Subobject.mk f) (hβ : CategoryTheory.Subobject.mk f β€ Y) {Z : C} (h : CategoryTheory.Subobject.underlying.obj Y βΆ Z) : CategoryTheory.CategoryStruct.comp (X.ofLEMk f hβ) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.ofMkLE f Y hβ) h) = CategoryTheory.CategoryStruct.comp (X.ofLE Y β―) h - CategoryTheory.Subobject.ofLE_comp_ofLE_assoc π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B : C} (X Y Z : CategoryTheory.Subobject B) (hβ : X β€ Y) (hβ : Y β€ Z) {Zβ : C} (h : CategoryTheory.Subobject.underlying.obj Z βΆ Zβ) : CategoryTheory.CategoryStruct.comp (X.ofLE Y hβ) (CategoryTheory.CategoryStruct.comp (Y.ofLE Z hβ) h) = CategoryTheory.CategoryStruct.comp (X.ofLE Z β―) h - CategoryTheory.Subobject.ofLE_mk_le_mk_of_comm π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {B Aβ Aβ : C} {fβ : Aβ βΆ B} {fβ : Aβ βΆ B} [CategoryTheory.Mono fβ] [CategoryTheory.Mono fβ] (g : Aβ βΆ Aβ) (w : CategoryTheory.CategoryStruct.comp g fβ = fβ) : (CategoryTheory.Subobject.mk fβ).ofLE (CategoryTheory.Subobject.mk fβ) β― = CategoryTheory.CategoryStruct.comp (CategoryTheory.Subobject.underlyingIso fβ).hom (CategoryTheory.CategoryStruct.comp g (CategoryTheory.Subobject.underlyingIso fβ).inv) - CategoryTheory.Subobject.isPullback_aux π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Limits.HasPullbacks C] (f : X βΆ Y) (y : CategoryTheory.Subobject Y) : β Ο, CategoryTheory.IsPullback Ο ((CategoryTheory.Subobject.pullback f).obj y).arrow y.arrow f - CategoryTheory.Subobject.underlyingIso_arrow_apply π Mathlib.CategoryTheory.Subobject.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] {F : C β C β Type uF} {carrier : C β Type w} {instFunLike : (X Y : C) β FunLike (F X Y) (carrier X) (carrier Y)} [inst : CategoryTheory.ConcreteCategory C F] (x : carrier X) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Subobject.mk f).arrow) ((CategoryTheory.ConcreteCategory.hom (CategoryTheory.Subobject.underlyingIso f).inv) x) = (CategoryTheory.ConcreteCategory.hom f) 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.Subobject.Factors π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.Subobject Y) (f : X βΆ Y) : Prop - CategoryTheory.Subobject.factors_self π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Subobject X) : P.Factors P.arrow - CategoryTheory.Subobject.factors_zero π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroMorphisms C] {X Y : C} {P : CategoryTheory.Subobject Y} : P.Factors 0 - CategoryTheory.Subobject.factors_of_factors_right π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} {P : CategoryTheory.Subobject Z} (f : X βΆ Y) {g : Y βΆ Z} (h : P.Factors g) : P.Factors (CategoryTheory.CategoryStruct.comp f g) - CategoryTheory.Subobject.factors_of_le π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y Z : C} {P Q : CategoryTheory.Subobject Y} (f : Z βΆ Y) (h : P β€ Q) : P.Factors f β Q.Factors f - CategoryTheory.Subobject.factorThru π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.Subobject Y) (f : X βΆ Y) (h : P.Factors f) : X βΆ CategoryTheory.Subobject.underlying.obj P - CategoryTheory.Subobject.le_of_factors π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} {P Q : CategoryTheory.Subobject Y} (h : Q.Factors P.arrow) : P β€ Q - 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.Subobject.homOfFactors π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} {P Q : CategoryTheory.Subobject Y} (h : Q.Factors P.arrow) : P βΆ Q - CategoryTheory.Subobject.factorThru_arrow π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.Subobject Y) (f : X βΆ Y) (h : P.Factors f) : CategoryTheory.CategoryStruct.comp (P.factorThru f h) P.arrow = f - CategoryTheory.Subobject.factors_comp_arrow π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {P : CategoryTheory.Subobject Y} (f : X βΆ CategoryTheory.Subobject.underlying.obj P) : P.Factors (CategoryTheory.CategoryStruct.comp f P.arrow) - CategoryTheory.Subobject.factorThru_mk_self π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : (CategoryTheory.Subobject.mk f).factorThru f β― = (CategoryTheory.Subobject.underlyingIso f).inv - CategoryTheory.Subobject.factorThru_arrow_assoc π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (P : CategoryTheory.Subobject Y) (f : X βΆ Y) (h : P.Factors f) {Z : C} (hβ : Y βΆ Z) : CategoryTheory.CategoryStruct.comp (P.factorThru f h) (CategoryTheory.CategoryStruct.comp P.arrow hβ) = CategoryTheory.CategoryStruct.comp f hβ - CategoryTheory.Subobject.factors_add π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (wf : P.Factors f) (wg : P.Factors g) : P.Factors (f + g) - CategoryTheory.Subobject.factors_left_of_factors_add π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (w : P.Factors (f + g)) (wg : P.Factors g) : P.Factors f - CategoryTheory.Subobject.factors_right_of_factors_add π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (w : P.Factors (f + g)) (wf : P.Factors f) : P.Factors g - CategoryTheory.Subobject.factorThru_right π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y Z : C} {P : CategoryTheory.Subobject Z} (f : X βΆ Y) (g : Y βΆ Z) (h : P.Factors g) : CategoryTheory.CategoryStruct.comp f (P.factorThru g h) = P.factorThru (CategoryTheory.CategoryStruct.comp f g) β― - CategoryTheory.Subobject.factorThru_comp_arrow π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} {P : CategoryTheory.Subobject Y} (f : X βΆ CategoryTheory.Subobject.underlying.obj P) (h : P.Factors (CategoryTheory.CategoryStruct.comp f P.arrow)) : P.factorThru (CategoryTheory.CategoryStruct.comp f P.arrow) h = f - CategoryTheory.Subobject.factorThru_self π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (P : CategoryTheory.Subobject X) (h : P.Factors P.arrow) : P.factorThru P.arrow h = CategoryTheory.CategoryStruct.id (CategoryTheory.Subobject.underlying.obj P) - CategoryTheory.Subobject.factorThru_ofLE π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y Z : C} {P Q : CategoryTheory.Subobject Y} {f : Z βΆ Y} (h : P β€ Q) (w : P.Factors f) : Q.factorThru f β― = CategoryTheory.CategoryStruct.comp (P.factorThru f w) (P.ofLE Q h) - CategoryTheory.Subobject.factorThru_eq_zero π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroMorphisms C] {X Y : C} {P : CategoryTheory.Subobject Y} {f : X βΆ Y} {h : P.Factors f} : P.factorThru f h = 0 β f = 0 - CategoryTheory.Subobject.factorThru_zero π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroMorphisms C] {X Y : C} {P : CategoryTheory.Subobject Y} (h : P.Factors 0) : P.factorThru 0 h = 0 - CategoryTheory.Subobject.factorThru_add_sub_factorThru_left π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (w : P.Factors (f + g)) (wf : P.Factors f) : P.factorThru (f + g) w - P.factorThru f wf = P.factorThru g β― - CategoryTheory.Subobject.factorThru_add_sub_factorThru_right π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (w : P.Factors (f + g)) (wg : P.Factors g) : P.factorThru (f + g) w - P.factorThru g wg = P.factorThru f β― - CategoryTheory.Subobject.factorThru_add π Mathlib.CategoryTheory.Subobject.FactorThru
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Preadditive C] {X Y : C} {P : CategoryTheory.Subobject Y} (f g : X βΆ Y) (w : P.Factors (f + g)) (wf : P.Factors f) (wg : P.Factors g) : P.factorThru (f + g) w = P.factorThru f wf + P.factorThru g wg - CategoryTheory.small_subobject π 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) : Small.{w, max uβ v} (CategoryTheory.Subobject X) - CategoryTheory.WellPowered.subobject_small π Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type uβ} {instβ : CategoryTheory.Category.{v, uβ} C} {instβΒΉ : CategoryTheory.LocallySmall.{w, v, uβ} C} [self : CategoryTheory.WellPowered.{w, v, uβ} C] (X : C) : Small.{w, max uβ v} (CategoryTheory.Subobject X) - CategoryTheory.WellPowered.mk π Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type uβ} [CategoryTheory.Category.{v, uβ} C] [CategoryTheory.LocallySmall.{w, v, uβ} C] (subobject_small : β (X : C), Small.{w, max uβ v} (CategoryTheory.Subobject X) := by infer_instance) : CategoryTheory.WellPowered.{w, v, uβ} C - 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.Subobject.instInhabited π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : Inhabited (CategoryTheory.Subobject X) - CategoryTheory.Subobject.semilatticeInf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {B : C} : SemilatticeInf (CategoryTheory.Subobject B) - CategoryTheory.Subobject.subsingleton_of_isInitial π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (hX : CategoryTheory.Limits.IsInitial X) : Subsingleton (CategoryTheory.Subobject X) - CategoryTheory.Subobject.subsingleton_of_isZero π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} (hX : CategoryTheory.Limits.IsZero X) : Subsingleton (CategoryTheory.Subobject X) - CategoryTheory.Subobject.semilatticeSup π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {B : C} : SemilatticeSup (CategoryTheory.Subobject B) - CategoryTheory.Subobject.instLattice π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {B : C} : Lattice (CategoryTheory.Subobject B) - CategoryTheory.Subobject.completeSemilatticeInf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {B : C} : CompleteSemilatticeInf (CategoryTheory.Subobject B) - CategoryTheory.Subobject.nontrivial_of_not_isZero π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasZeroObject C] {X : C} (h : Β¬CategoryTheory.Limits.IsZero X) : Nontrivial (CategoryTheory.Subobject X) - CategoryTheory.Subobject.widePullback π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {A : C} (s : Set (CategoryTheory.Subobject A)) : C - CategoryTheory.Subobject.completeSemilatticeSup π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasImages C] {B : C} : CompleteSemilatticeSup (CategoryTheory.Subobject B) - CategoryTheory.Subobject.orderTop π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X : C} : OrderTop (CategoryTheory.Subobject X) - CategoryTheory.Subobject.sInf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Subobject A - CategoryTheory.Subobject.sSup π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasImages C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Subobject A - CategoryTheory.Subobject.instCompleteLattice π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.InitialMonoClass C] {B : C} : CompleteLattice (CategoryTheory.Subobject B) - CategoryTheory.Subobject.boundedOrder π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {B : C} : BoundedOrder (CategoryTheory.Subobject B) - CategoryTheory.Subobject.functor_obj π Mathlib.CategoryTheory.Subobject.Lattice
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] (X : Cα΅α΅) : (CategoryTheory.Subobject.functor C).obj X = CategoryTheory.Subobject (Opposite.unop X) - CategoryTheory.Subobject.orderBot π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {X : C} : OrderBot (CategoryTheory.Subobject X) - CategoryTheory.Subobject.widePullbackΞΉ π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Subobject.widePullback s βΆ A - CategoryTheory.Subobject.widePullbackΞΉ_mono π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Mono (CategoryTheory.Subobject.widePullbackΞΉ s) - CategoryTheory.Subobject.top_factors π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {A B : C} (f : A βΆ B) : β€.Factors f - CategoryTheory.Subobject.top_eq_id π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (B : C) : β€ = CategoryTheory.Subobject.mk (CategoryTheory.CategoryStruct.id B) - CategoryTheory.Subobject.factors_left_of_inf_factors π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B : C} {X Y : CategoryTheory.Subobject B} {f : A βΆ B} (h : (X β Y).Factors f) : X.Factors f - CategoryTheory.Subobject.factors_right_of_inf_factors π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B : C} {X Y : CategoryTheory.Subobject B} {f : A βΆ B} (h : (X β Y).Factors f) : Y.Factors f - CategoryTheory.Subobject.sup_factors_of_factors_left π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A B : C} {X Y : CategoryTheory.Subobject B} {f : A βΆ B} (P : X.Factors f) : (X β Y).Factors f - CategoryTheory.Subobject.sup_factors_of_factors_right π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasImages C] [CategoryTheory.Limits.HasBinaryCoproducts C] {A B : C} {X Y : CategoryTheory.Subobject B} {f : A βΆ B} (P : Y.Factors f) : (X β Y).Factors f - CategoryTheory.Subobject.inf_factors π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A B : C} {X Y : CategoryTheory.Subobject B} (f : A βΆ B) : (X β Y).Factors f β X.Factors f β§ Y.Factors f - CategoryTheory.Subobject.isIso_iff_mk_eq_top π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.IsIso f β CategoryTheory.Subobject.mk f = β€ - CategoryTheory.Subobject.sInf_le π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasWidePullbacks C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (hf : f β s) : CategoryTheory.Subobject.sInf s β€ f - CategoryTheory.Subobject.bot_eq_initial_to π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {B : C} : β₯ = CategoryTheory.Subobject.mk (CategoryTheory.Limits.initial.to B) - CategoryTheory.Subobject.epi_iff_mk_eq_top π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} [CategoryTheory.Balanced C] (f : X βΆ Y) [CategoryTheory.Mono f] : CategoryTheory.Epi f β CategoryTheory.Subobject.mk f = β€ - CategoryTheory.Subobject.finset_inf_factors π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {I : Type u_1} {A B : C} {s : Finset I} {P : I β CategoryTheory.Subobject B} (f : A βΆ B) : (s.inf P).Factors f β β i β s, (P i).Factors f - CategoryTheory.Subobject.botCoeIsoInitial π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasInitial C] [CategoryTheory.Limits.InitialMonoClass C] {B : C} : CategoryTheory.Subobject.underlying.obj β₯ β β₯_ C - CategoryTheory.Subobject.le_sSup π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.LocallySmall.{w, vβ, uβ} C] [CategoryTheory.WellPowered.{w, vβ, uβ} C] [CategoryTheory.Limits.HasCoproducts C] [CategoryTheory.Limits.HasImages C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (hf : f β s) : f β€ CategoryTheory.Subobject.sSup s - CategoryTheory.Subobject.mk_eq_top_of_isIso π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {X Y : C} (f : X βΆ Y) [CategoryTheory.IsIso f] : CategoryTheory.Subobject.mk f = β€ - CategoryTheory.Subobject.eq_top_of_isIso_arrow π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} (P : CategoryTheory.Subobject Y) [CategoryTheory.IsIso P.arrow] : P = β€ - CategoryTheory.Subobject.isIso_arrow_iff_eq_top π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Y : C} (P : CategoryTheory.Subobject Y) : CategoryTheory.IsIso P.arrow β P = β€ - CategoryTheory.Subobject.botCoeIsoZero π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasZeroObject C] {B : C} : CategoryTheory.Subobject.underlying.obj β₯ β 0 - CategoryTheory.Subobject.prod_eq_inf π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {A : C} {fβ fβ : CategoryTheory.Subobject A} [CategoryTheory.Limits.HasBinaryProduct fβ fβ] : (fβ β¨― fβ) = fβ β fβ - CategoryTheory.Subobject.inf_arrow_factors_left π Mathlib.CategoryTheory.Subobject.Lattice
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasPullbacks C] {B : C} (X Y : CategoryTheory.Subobject B) : X.Factors (X β Y).arrow
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