Loogle!
Result
Found 460 declarations mentioning CategoryTheory.LocallySmall. Of these, only the first 200 are shown.
- CategoryTheory.LocallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] : Prop - CategoryTheory.locallySmall_max 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.LocallySmall.{max v w, v, u} C - CategoryTheory.locallySmall_self 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] : CategoryTheory.LocallySmall.{v, v, u} C - CategoryTheory.locallySmall_of_univLE 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [UnivLE.{v, w}] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.locallySmall_of_essentiallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.EssentiallySmall.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.ShrinkHoms.instCategory 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Category.{w, u} (CategoryTheory.ShrinkHoms.{u} C) - CategoryTheory.essentiallySmall_of_small_of_locallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.EssentiallySmall.{w, v, u} C - CategoryTheory.instLocallySmallOpposite 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, u} Cᵒᵖ - CategoryTheory.instSmallArrowOfLocallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : Small.{w, max u v} (CategoryTheory.Arrow C) - CategoryTheory.locallySmall_of_thin 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} [CategoryTheory.Category.{v, u} C] [Quiver.IsThin C] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.essentiallySmall_iff 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] : CategoryTheory.EssentiallySmall.{w, v, u} C ↔ Small.{w, u} (CategoryTheory.Skeleton C) ∧ CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.ShrinkHoms.equivalence 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : C ≌ CategoryTheory.ShrinkHoms.{u} C - CategoryTheory.ShrinkHoms.functor 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Functor C (CategoryTheory.ShrinkHoms.{u} C) - CategoryTheory.ShrinkHoms.inverse 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Functor (CategoryTheory.ShrinkHoms.{u} C) C - CategoryTheory.Shrink.instLocallySmallShrink 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w', u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, w'} (Shrink.{w', u} C) - CategoryTheory.instLocallySmallSmallModel 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.EssentiallySmall.{w, v, u} C] [CategoryTheory.LocallySmall.{w', v, u} C] : CategoryTheory.LocallySmall.{w', w, w} (CategoryTheory.SmallModel.{w, v, u} C) - CategoryTheory.instSmallHomOfLocallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X Y : C) : Small.{w, v} (X ⟶ Y) - CategoryTheory.locallySmall_congr 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (e : C ≌ D) : CategoryTheory.LocallySmall.{w, v, u} C ↔ CategoryTheory.LocallySmall.{w, v', u'} D - CategoryTheory.LocallySmall.hom_small 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} [self : CategoryTheory.LocallySmall.{w, v, u} C] (X Y : C) : Small.{w, v} (X ⟶ Y) - CategoryTheory.ShrinkHoms.instIsEquivalenceFunctor 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.functor C).IsEquivalence - CategoryTheory.ShrinkHoms.instIsEquivalenceInverse 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.inverse C).IsEquivalence - CategoryTheory.instLocallySmallFunctor 📋 Mathlib.CategoryTheory.EssentiallySmall
{A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.LocallySmall.{w, v', u'} A] (C : Type w) [CategoryTheory.SmallCategory C] : CategoryTheory.LocallySmall.{w, max v' w, max (max (max u' w) v') w} (CategoryTheory.Functor C A) - CategoryTheory.locallySmall_fullSubcategory 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (P : CategoryTheory.ObjectProperty C) : CategoryTheory.LocallySmall.{w, v, u} P.FullSubcategory - CategoryTheory.LocallySmall.mk 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} [CategoryTheory.Category.{v, u} C] (hom_small : ∀ (X Y : C), Small.{w, v} (X ⟶ Y) := by infer_instance) : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.instSmallFunctorOfLocallySmall 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [Small.{w, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] [Small.{w, u'} D] [CategoryTheory.LocallySmall.{w, v', u'} D] : Small.{w, max (max (max u' u) v') v} (CategoryTheory.Functor C D) - CategoryTheory.locallySmall_of_faithful 📋 Mathlib.CategoryTheory.EssentiallySmall
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor C D) [F.Faithful] [CategoryTheory.LocallySmall.{w, v', u'} D] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.ShrinkHoms.functor_obj 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : (CategoryTheory.ShrinkHoms.functor C).obj X = CategoryTheory.ShrinkHoms.toShrinkHoms X - CategoryTheory.ShrinkHoms.inverse_obj 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : CategoryTheory.ShrinkHoms.{u} C) : (CategoryTheory.ShrinkHoms.inverse C).obj X = X.fromShrinkHoms - CategoryTheory.ShrinkHoms.equivalence_functor 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).functor = CategoryTheory.ShrinkHoms.functor C - CategoryTheory.ShrinkHoms.equivalence_inverse 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).inverse = CategoryTheory.ShrinkHoms.inverse C - CategoryTheory.essentiallySmall_fullSubcategory_mem 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] (s : Set C) [Small.{w, u} ↑s] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.EssentiallySmall.{w, v, u} (CategoryTheory.ObjectProperty.FullSubcategory fun x => x ∈ s) - CategoryTheory.ShrinkHoms.equivalence_unitIso 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id C).obj x)) ⋯ - CategoryTheory.ShrinkHoms.equivalence_counitIso 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.ShrinkHoms.inverse C).comp (CategoryTheory.ShrinkHoms.functor C)).obj x)) ⋯ - CategoryTheory.ShrinkHoms.functor_map 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : (CategoryTheory.ShrinkHoms.functor C).map f = (equivShrink (X ⟶ Y)) f - CategoryTheory.ShrinkHoms.id_def 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : CategoryTheory.ShrinkHoms.{u} C) : CategoryTheory.CategoryStruct.id X = (equivShrink (X.fromShrinkHoms ⟶ X.fromShrinkHoms)) (CategoryTheory.CategoryStruct.id X.fromShrinkHoms) - CategoryTheory.ShrinkHoms.inverse_map 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : CategoryTheory.ShrinkHoms.{u} C} (f : X ⟶ Y) : (CategoryTheory.ShrinkHoms.inverse C).map f = (equivShrink (X.fromShrinkHoms ⟶ Y.fromShrinkHoms)).symm f - CategoryTheory.ShrinkHoms.comp_def 📋 Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X✝ Y✝ Z✝ : CategoryTheory.ShrinkHoms.{u} C} (f : Shrink.{w, v} (X✝.fromShrinkHoms ⟶ Y✝.fromShrinkHoms)) (g : Shrink.{w, v} (Y✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)) : CategoryTheory.CategoryStruct.comp f g = (equivShrink (X✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)) (CategoryTheory.CategoryStruct.comp ((equivShrink (X✝.fromShrinkHoms ⟶ Y✝.fromShrinkHoms)).symm f) ((equivShrink (Y✝.fromShrinkHoms ⟶ Z✝.fromShrinkHoms)).symm g)) - CategoryTheory.Limits.HasColimitsOfShape.of_small 📋 Mathlib.CategoryTheory.Limits.HasLimits
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimitsOfSize.{v₁, u₁, v, u} C] (J : Type u₂) [CategoryTheory.Category.{v₂, u₂} J] [Small.{u₁, u₂} J] [CategoryTheory.LocallySmall.{v₁, v₂, u₂} J] : CategoryTheory.Limits.HasColimitsOfShape J C - CategoryTheory.Limits.HasLimitsOfShape.of_small 📋 Mathlib.CategoryTheory.Limits.HasLimits
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfSize.{v₁, u₁, v, u} C] (J : Type u₂) [CategoryTheory.Category.{v₂, u₂} J] [Small.{u₁, u₂} J] [CategoryTheory.LocallySmall.{v₁, v₂, u₂} J] : CategoryTheory.Limits.HasLimitsOfShape J C - CategoryTheory.Limits.HasColimitsOfShape.of_essentiallySmall 📋 Mathlib.CategoryTheory.Limits.HasLimits
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimitsOfSize.{v₁, u₁, v, u} C] (J : Type u₂) [CategoryTheory.Category.{v₂, u₂} J] [CategoryTheory.EssentiallySmall.{u₁, v₂, u₂} J] [CategoryTheory.LocallySmall.{v₁, v₂, u₂} J] : CategoryTheory.Limits.HasColimitsOfShape J C - CategoryTheory.Limits.HasLimitsOfShape.of_essentiallySmall 📋 Mathlib.CategoryTheory.Limits.HasLimits
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfSize.{v₁, u₁, v, u} C] (J : Type u₂) [CategoryTheory.Category.{v₂, u₂} J] [CategoryTheory.EssentiallySmall.{u₁, v₂, u₂} J] [CategoryTheory.LocallySmall.{v₁, v₂, u₂} J] : CategoryTheory.Limits.HasLimitsOfShape J C - CategoryTheory.shrinkCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Functor Cᵒᵖ (CategoryTheory.Functor C (Type w)) - CategoryTheory.shrinkYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Functor C (CategoryTheory.Functor Cᵒᵖ (Type w)) - CategoryTheory.fullyFaithfulShrinkCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkCoyoneda.{w, v, u}.FullyFaithful - CategoryTheory.instFaithfulOppositeFunctorTypeShrinkCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkCoyoneda.{w, v, u}.Faithful - CategoryTheory.instFullOppositeFunctorTypeShrinkCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkCoyoneda.{w, v, u}.Full - CategoryTheory.fullyFaithfulShrinkYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkYoneda.{w, v, u}.FullyFaithful - CategoryTheory.instFaithfulFunctorOppositeTypeShrinkYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkYoneda.{w, v, u}.Faithful - CategoryTheory.instFullFunctorOppositeTypeShrinkYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.shrinkYoneda.{w, v, u}.Full - CategoryTheory.instSmallObjOppositeFunctorTypeCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : Cᵒᵖ) : CategoryTheory.FunctorToTypes.Small.{w, v, v, u} (CategoryTheory.coyoneda.obj X) - CategoryTheory.instIsCorepresentableObjOppositeFunctorTypeShrinkCoyoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : Cᵒᵖ) : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).IsCorepresentable - CategoryTheory.instIsRepresentableObjFunctorOppositeTypeShrinkYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).IsRepresentable - CategoryTheory.shrinkCoyonedaCorepresentableBy 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : Cᵒᵖ) : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).CorepresentableBy (Opposite.unop X) - CategoryTheory.shrinkYonedaRepresentableBy 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).RepresentableBy X - CategoryTheory.instSmallOppositeObjFunctorTypeYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : CategoryTheory.FunctorToTypes.Small.{w, v, v, u} (CategoryTheory.yoneda.obj X) - CategoryTheory.shrinkCoyonedaObjObjEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {Y : C} : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y ≃ (Opposite.unop X ⟶ Y) - CategoryTheory.shrinkYonedaObjObjEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y : Cᵒᵖ} : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y ≃ (Opposite.unop Y ⟶ X) - CategoryTheory.shrinkCoyoneda_obj 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X = CategoryTheory.FunctorToTypes.shrink.{w, v, v, u} (CategoryTheory.coyoneda.obj X) - CategoryTheory.shrinkCoyonedaEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {P : CategoryTheory.Functor C (Type w)} : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ⟶ P) ≃ P.obj (Opposite.unop X) - CategoryTheory.shrinkYoneda_obj 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : CategoryTheory.shrinkYoneda.{w, v, u}.obj X = CategoryTheory.FunctorToTypes.shrink.{w, v, v, u} (CategoryTheory.yoneda.obj X) - CategoryTheory.shrinkYonedaEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {P : CategoryTheory.Functor Cᵒᵖ (Type w)} : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X ⟶ P) ≃ P.obj (Opposite.op X) - CategoryTheory.shrinkCoyonedaCorepresentableBy_homEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : Cᵒᵖ) {Y✝ : C} : (CategoryTheory.shrinkCoyonedaCorepresentableBy X).homEquiv = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm - CategoryTheory.shrinkCoyonedaCompEvaluationCompUliftFunctorIsoUliftFunctor 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (Y : C) : CategoryTheory.shrinkCoyoneda.{w, v, u}.comp (((CategoryTheory.evaluation C (Type w)).obj Y).comp CategoryTheory.uliftFunctor.{v, w}) ≅ (CategoryTheory.yoneda.obj Y).comp CategoryTheory.uliftFunctor.{w, v} - CategoryTheory.shrinkYonedaCompEvaluationCompUliftFunctorIsoUliftFunctor 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (Y : Cᵒᵖ) : CategoryTheory.shrinkYoneda.{w, v, u}.comp (((CategoryTheory.evaluation Cᵒᵖ (Type w)).obj Y).comp CategoryTheory.uliftFunctor.{v, w}) ≅ (CategoryTheory.coyoneda.obj Y).comp CategoryTheory.uliftFunctor.{w, v} - CategoryTheory.shrinkYonedaRepresentableBy_homEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) {X✝ : C} : (CategoryTheory.shrinkYonedaRepresentableBy X).homEquiv = CategoryTheory.shrinkYonedaObjObjEquiv.symm - CategoryTheory.shrinkYonedaUliftFunctorIso 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.LocallySmall.{max w w', v, u} C] : CategoryTheory.shrinkYoneda.{w, v, u}.comp ((CategoryTheory.Functor.whiskeringRight Cᵒᵖ (Type w) (Type (max w w'))).obj CategoryTheory.uliftFunctor.{w', w}) ≅ CategoryTheory.shrinkYoneda.{max w w', v, u} - CategoryTheory.shrinkCoyoneda_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} {f : X ⟶ Y} : CategoryTheory.shrinkCoyoneda.{w, v, u}.map f = CategoryTheory.FunctorToTypes.shrinkMap (CategoryTheory.coyoneda.map f) - CategoryTheory.shrinkCoyonedaUliftFunctorIso 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.LocallySmall.{max w w', v, u} C] : CategoryTheory.shrinkCoyoneda.{w, v, u}.comp ((CategoryTheory.Functor.whiskeringRight Cᵒᵖ (Type w) (Type (max w w'))).obj CategoryTheory.uliftFunctor.{w', w}) ≅ CategoryTheory.shrinkCoyoneda.{max w w', v, u} - CategoryTheory.shrinkYoneda_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) : CategoryTheory.shrinkYoneda.{w, v, u}.map f = CategoryTheory.FunctorToTypes.shrinkMap (CategoryTheory.yoneda.map f) - CategoryTheory.shrinkCoyonedaObjObjEquiv_obj_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {Y Y' : C} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) : CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).map g)) f) = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv f) g - CategoryTheory.shrinkCoyonedaObjObjEquiv_obj_map_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {Y Y' : C} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) {Z : C} (h : Y' ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).map g)) f)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv f) (CategoryTheory.CategoryStruct.comp g h) - CategoryTheory.shrinkCoyoneda_obj_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {Y Y' : C} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).map g)) f = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv f) g) - CategoryTheory.shrinkCoyoneda_obj_map_shrinkCoyonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {Y Y' : C} (g : Y ⟶ Y') (f : Opposite.unop X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).map g)) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f) = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp f g) - CategoryTheory.shrinkCoyonedaObjObjEquiv_map_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cᵒᵖ} {Y : C} (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) (g : X ⟶ X') : CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) f) = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkCoyonedaObjObjEquiv f) - CategoryTheory.shrinkCoyonedaObjObjEquiv_map_app_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cᵒᵖ} {Y : C} (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) (g : X ⟶ X') {Z : C} (h : Y ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) f)) h = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv f) h) - CategoryTheory.shrinkCoyonedaEquiv_comp 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {P Q : CategoryTheory.Functor C (Type w)} (α : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ⟶ P) (β : P ⟶ Q) : CategoryTheory.shrinkCoyonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = (CategoryTheory.ConcreteCategory.hom (β.app (Opposite.unop X))) (CategoryTheory.shrinkCoyonedaEquiv α) - CategoryTheory.shrinkCoyoneda_map_app_shrinkCoyonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cᵒᵖ} {Y : C} (f : Opposite.unop X ⟶ Y) (g : X ⟶ X') : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f) = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkCoyonedaEquiv_shrinkCoyoneda_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} (f : X ⟶ Y) : CategoryTheory.shrinkCoyonedaEquiv (CategoryTheory.shrinkCoyoneda.{w, v, u}.map f) = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f.unop - CategoryTheory.shrinkCoyonedaObjObjEquiv_symm_comp 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y Y' : C} (g : Y' ⟶ Y) (f : Y ⟶ X) : CategoryTheory.shrinkCoyonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g f) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.obj (Opposite.op Y')).map f)) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm g) - CategoryTheory.shrinkCoyonedaEquiv_naturality 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} {P : CategoryTheory.Functor C (Type w)} (f : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ⟶ P) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.unop)) (CategoryTheory.shrinkCoyonedaEquiv f) = CategoryTheory.shrinkCoyonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyoneda.{w, v, u}.map g) f) - CategoryTheory.shrinkYonedaObjObjEquiv_obj_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) : CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f) = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkYonedaObjObjEquiv f) - CategoryTheory.shrinkYonedaObjObjEquiv_obj_map_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) {Z : C} (h : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f)) h = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv f) h) - CategoryTheory.shrinkYonedaObjObjEquiv_map_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : C} {Y : Cᵒᵖ} (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) (g : X ⟶ X') : CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.map g).app Y)) f) = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv f) g - CategoryTheory.shrinkCoyonedaEquiv_symm_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} (f : X ⟶ Y) {P : CategoryTheory.Functor C (Type w)} (t : P.obj X) : CategoryTheory.shrinkCoyonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyoneda.{w, v, u}.map f.op) (CategoryTheory.shrinkCoyonedaEquiv.symm t) - CategoryTheory.shrinkYoneda_obj_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f = CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkYonedaObjObjEquiv f)) - CategoryTheory.shrinkYoneda_obj_map_shrinkYonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cᵒᵖ} (g : Y ⟶ Y') (f : Opposite.unop Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) (CategoryTheory.shrinkYonedaObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkYonedaObjObjEquiv_map_app_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : C} {Y : Cᵒᵖ} (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) (g : X ⟶ X') {Z : C} (h : X' ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.map g).app Y)) f)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv f) (CategoryTheory.CategoryStruct.comp g h) - CategoryTheory.shrinkCoyonedaEquiv_symm_app_shrinkCoyonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cᵒᵖ} {P : CategoryTheory.Functor C (Type w)} (s : P.obj (Opposite.unop X)) {Y : Cᵒᵖ} (f : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyonedaEquiv.symm s).app (Opposite.unop Y))) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f.unop) = (CategoryTheory.ConcreteCategory.hom (P.map f.unop)) s - CategoryTheory.map_shrinkCoyonedaEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} {P : CategoryTheory.Functor C (Type w)} (f : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ⟶ P) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.unop)) (CategoryTheory.shrinkCoyonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.unop Y))) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm g.unop) - CategoryTheory.shrinkYoneda_map_app_shrinkYonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : C} {Y : Cᵒᵖ} (f : Opposite.unop Y ⟶ X) (g : X ⟶ X') : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.map g).app Y)) (CategoryTheory.shrinkYonedaObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp f g) - CategoryTheory.shrinkYonedaObjObjEquiv_symm_comp 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y Y' : C} (g : Y' ⟶ Y) (f : Y ⟶ X) : CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g f) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g.op)) (CategoryTheory.shrinkYonedaObjObjEquiv.symm f) - CategoryTheory.shrinkCoyonedaEquiv_symm_map_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} (f : X ⟶ Y) {P : CategoryTheory.Functor C (Type w)} (t : P.obj X) {Z : CategoryTheory.Functor C (Type w)} (h : P ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyoneda.{w, v, u}.map f.op) (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaEquiv.symm t) h) - CategoryTheory.shrinkYonedaEquiv_shrinkYoneda_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.shrinkYonedaEquiv (CategoryTheory.shrinkYoneda.{w, v, u}.map f) = CategoryTheory.shrinkYonedaObjObjEquiv.symm f - CategoryTheory.shrinkYonedaEquiv_comp 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {P Q : CategoryTheory.Functor Cᵒᵖ (Type w)} (α : CategoryTheory.shrinkYoneda.{w, v, u}.obj X ⟶ P) (β : P ⟶ Q) : CategoryTheory.shrinkYonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = (CategoryTheory.ConcreteCategory.hom (β.app (Opposite.op X))) (CategoryTheory.shrinkYonedaEquiv α) - CategoryTheory.shrinkYonedaEquiv_naturality 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : CategoryTheory.shrinkYoneda.{w, v, u}.obj X ⟶ P) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.op)) (CategoryTheory.shrinkYonedaEquiv f) = CategoryTheory.shrinkYonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYoneda.{w, v, u}.map g) f) - CategoryTheory.shrinkYonedaEquiv_symm_app_shrinkYonedaObjObjEquiv_symm 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (s : P.obj (Opposite.op X)) {Y : C} (f : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYonedaEquiv.symm s).app (Opposite.op Y))) (CategoryTheory.shrinkYonedaObjObjEquiv.symm f) = (CategoryTheory.ConcreteCategory.hom (P.map f.op)) s - CategoryTheory.map_shrinkYonedaEquiv 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : C} {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (f : CategoryTheory.shrinkYoneda.{w, v, u}.obj X ⟶ P) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.op)) (CategoryTheory.shrinkYonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op Y))) (CategoryTheory.shrinkYonedaObjObjEquiv.symm g) - CategoryTheory.shrinkYonedaEquiv_symm_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} (f : X ⟶ Y) {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (t : P.obj X) : CategoryTheory.shrinkYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYoneda.{w, v, u}.map f.unop) (CategoryTheory.shrinkYonedaEquiv.symm t) - CategoryTheory.shrinkYonedaEquiv_symm_map_assoc 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cᵒᵖ} (f : X ⟶ Y) {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (t : P.obj X) {Z : CategoryTheory.Functor Cᵒᵖ (Type w)} (h : P ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYoneda.{w, v, u}.map f.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaEquiv.symm t) h) - CategoryTheory.instPreservesLimitsOfSizeFunctorOppositeTypeShrinkYoneda 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w', v, u} C] : CategoryTheory.Limits.PreservesLimitsOfSize.{t, w, v, max u w', u, max (max u v) (w' + 1)} CategoryTheory.shrinkYoneda.{w', v, u} - CategoryTheory.ObjectProperty.instEssentiallySmallFullSubcategoryOfLocallySmallOfEssentiallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] : CategoryTheory.EssentiallySmall.{w, v, u} P.FullSubcategory - CategoryTheory.ObjectProperty.instEssentiallySmallFullSubcategoryOfLocallySmallOfEssentiallySmall_1 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] : CategoryTheory.EssentiallySmall.{w, v, u} P.FullSubcategory - CategoryTheory.essentiallySmall_iff_objectPropertyEssentiallySmall_top 📋 Mathlib.CategoryTheory.ObjectProperty.Small
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.EssentiallySmall.{w, v, u} C ↔ CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} ⊤ - CategoryTheory.essentiallySmall_iff_objectPropertyEssentiallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] : CategoryTheory.EssentiallySmall.{w, v_1, u_1} C ↔ CategoryTheory.LocallySmall.{w, v_1, u_1} C ∧ CategoryTheory.ObjectProperty.EssentiallySmall.{w, v_1, u_1} ⊤ - CategoryTheory.ObjectProperty.exists_equivalence_iff 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.LocallySmall.{w', v, u} C] : (∃ J x, Nonempty (P.FullSubcategory ≌ J)) ↔ CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P - CategoryTheory.exists_equivalence_iff_of_locallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w', v_1, u_1} C] : (∃ J x, Nonempty (C ≌ J)) ↔ CategoryTheory.ObjectProperty.EssentiallySmall.{w, v_1, u_1} ⊤ - CategoryTheory.EssentiallySmall.of_functor 📋 Mathlib.CategoryTheory.ObjectProperty.Small
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (F : CategoryTheory.Functor C D) [CategoryTheory.LocallySmall.{w, v_1, u_1} C] (H₁ : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v_2, u_2} F.essImage) (H₂ : ∀ (Y : D), CategoryTheory.ObjectProperty.EssentiallySmall.{w, v_1, u_1} fun x => Nonempty (F.obj x ≅ Y)) : CategoryTheory.EssentiallySmall.{w, v_1, u_1} C - CategoryTheory.CategoryOfElements.instLocallySmallElements 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.LocallySmall.{w, v, max u w} F.Elements - CategoryTheory.ObjectProperty.instEssentiallySmallLimitsOfShapeOfSmallOfSmallOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsOfShape
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.ObjectProperty C) (J : Type u') [CategoryTheory.Category.{v', u'} J] [CategoryTheory.ObjectProperty.Small.{w, v_1, u_1} P] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [Small.{w, u'} J] [CategoryTheory.LocallySmall.{w, v', u'} J] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v_1, u_1} (P.limitsOfShape J) - CategoryTheory.ObjectProperty.instSmallStrictLimitsOfShapeOfSmallOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsOfShape
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.ObjectProperty C) (J : Type u') [CategoryTheory.Category.{v', u'} J] [CategoryTheory.ObjectProperty.Small.{w, v_1, u_1} P] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [Small.{w, u'} J] [CategoryTheory.LocallySmall.{w, v', u'} J] : CategoryTheory.ObjectProperty.Small.{w, v_1, u_1} (P.strictLimitsOfShape J) - CategoryTheory.ObjectProperty.instEssentiallySmallRetractClosureOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.Retract
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P.retractClosure - CategoryTheory.ObjectProperty.instSmallStrictColimitsOfShapeOfSmallOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.ColimitsOfShape
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P : CategoryTheory.ObjectProperty C) (J : Type u') [CategoryTheory.Category.{v', u'} J] [CategoryTheory.ObjectProperty.Small.{w, v_1, u_1} P] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [Small.{w, u'} J] [CategoryTheory.LocallySmall.{w, v', u'} J] : CategoryTheory.ObjectProperty.Small.{w, v_1, u_1} (P.strictColimitsOfShape J) - CategoryTheory.WellPowered 📋 Mathlib.CategoryTheory.Subobject.WellPowered
(C : Type u₁) [CategoryTheory.Category.{v, u₁} C] [CategoryTheory.LocallySmall.{w, v, u₁} C] : Prop - 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.instWellPoweredShrinkHoms 📋 Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] [CategoryTheory.LocallySmall.{w, v, u₁} C] [CategoryTheory.WellPowered.{w, v, u₁} C] : CategoryTheory.WellPowered.{w, w, u₁} (CategoryTheory.ShrinkHoms.{u₁} C) - CategoryTheory.wellPowered_of_equiv 📋 Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (e : C ≌ D) [CategoryTheory.LocallySmall.{w, v, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] [CategoryTheory.WellPowered.{w, v, u₁} C] : CategoryTheory.WellPowered.{w, v₂, u₂} D - CategoryTheory.wellPowered_congr 📋 Mathlib.CategoryTheory.Subobject.WellPowered
{C : Type u₁} [CategoryTheory.Category.{v, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (e : C ≌ D) [CategoryTheory.LocallySmall.{w, v, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : CategoryTheory.WellPowered.{w, v, u₁} C ↔ CategoryTheory.WellPowered.{w, v₂, u₂} D - 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.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.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.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.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.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.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.le_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)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, f ≤ g) : f ≤ CategoryTheory.Subobject.sInf s - CategoryTheory.Subobject.sSup_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.HasCoproducts C] [CategoryTheory.Limits.HasImages C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, g ≤ f) : CategoryTheory.Subobject.sSup s ≤ f - CategoryTheory.Subobject.wideCospan 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) : CategoryTheory.Functor (CategoryTheory.Limits.WidePullbackShape ↑(⇑(equivShrink (CategoryTheory.Subobject A)) '' s)) C - CategoryTheory.Subobject.leInfCone 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, f ≤ g) : CategoryTheory.Limits.Cone (CategoryTheory.Subobject.wideCospan s) - CategoryTheory.Subobject.smallCoproductDesc 📋 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] {A : C} (s : Set (CategoryTheory.Subobject A)) : (∐ fun j => CategoryTheory.Subobject.underlying.obj ((equivShrink (CategoryTheory.Subobject A)).symm ↑j)) ⟶ A - CategoryTheory.Subobject.wideCospan_map_term 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (j : ↑(⇑(equivShrink (CategoryTheory.Subobject A)) '' s)) : (CategoryTheory.Subobject.wideCospan s).map (CategoryTheory.Limits.WidePullbackShape.Hom.term j) = ((equivShrink (CategoryTheory.Subobject A)).symm ↑j).arrow - CategoryTheory.Subobject.leInfCone_π_app_none 📋 Mathlib.CategoryTheory.Subobject.Lattice
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] {A : C} (s : Set (CategoryTheory.Subobject A)) (f : CategoryTheory.Subobject A) (k : ∀ g ∈ s, f ≤ g) : (CategoryTheory.Subobject.leInfCone s f k).π.app none = f.arrow - CategoryTheory.Functor.Elements.instHasInitialObjOppositeTypeFlipShrinkYonedaOp 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (X : C) : CategoryTheory.Limits.HasInitial (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip.obj (Opposite.op X)).Elements - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : CategoryTheory.Limits.Cocone ((CategoryTheory.CategoryOfElements.π F).op.comp (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.obj X)) - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaFlip 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Limits.Cocone ((CategoryTheory.CategoryOfElements.π F).op.comp CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip) - CategoryTheory.Functor.Elements.isColimitCoconeπOpCompShrinkYonedaObj 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : CategoryTheory.Limits.IsColimit (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X) - CategoryTheory.Functor.Elements.isColimitCoconeπOpCompShrinkYonedaFlip 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Limits.IsColimit (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaFlip F) - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj_pt 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X).pt = F.obj X - CategoryTheory.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasColimitsOfShape F.Elementsᵒᵖ (Type w)] : CategoryTheory.shrinkYoneda.{w, v₁, u₁}.comp (((CategoryTheory.Functor.whiskeringLeft F.Elementsᵒᵖ Cᵒᵖ (Type w)).obj (CategoryTheory.CategoryOfElements.π F).op).comp CategoryTheory.Limits.colim) ≅ F - CategoryTheory.Functor.Elements.isInitialElementsMkShrinkYonedaObjObjEquivId 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (X : C) : CategoryTheory.Limits.IsInitial ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip.obj (Opposite.op X)).elementsMk X (CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.id X))) - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj_ι_app 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) (u : F.Elementsᵒᵖ) : (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X).ι.app u = TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) (Opposite.unop u).snd - CategoryTheory.Functor.Elements.shrinkYoneda_map_app_coconeπOpCompShrinkYonedaObj_ι_app 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) {X₁ X₂ : C} (f : X₁ ⟶ X₂) (u : F.Elements) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.map f).app (Opposite.op u.fst)) (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) = CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) (F.map f) - CategoryTheory.Functor.Elements.shrinkYoneda_map_app_coconeπOpCompShrinkYonedaObj_ι_app_assoc 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) {X₁ X₂ : C} (f : X₁ ⟶ X₂) (u : F.Elements) {Z : Type w} (h : F.obj X₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.map f).app (Opposite.op u.fst)) (CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) h) = CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) (CategoryTheory.CategoryStruct.comp (F.map f) h) - CategoryTheory.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso_inv_app_apply 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasColimitsOfShape F.Elementsᵒᵖ (Type w)] (u : F.Elements) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso F).inv.app u.fst)) u.snd = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.colimit.ι ((CategoryTheory.CategoryOfElements.π F).op.comp (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.obj u.fst)) (Opposite.op u))) (CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.id (Opposite.unop ((CategoryTheory.CategoryOfElements.π F).op.obj (Opposite.op u))))) - CategoryTheory.CountableCategory.instLocallySmallObjAsType 📋 Mathlib.CategoryTheory.Countable
(α : Type u) [CategoryTheory.Category.{v, u} α] [CategoryTheory.CountableCategory α] : CategoryTheory.LocallySmall.{0, v, 0} (CategoryTheory.CountableCategory.ObjAsType α) - CategoryTheory.Abelian.wellPowered_opposite 📋 Mathlib.CategoryTheory.Abelian.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.WellPowered.{w, v, u} C] : CategoryTheory.WellPowered.{w, v, u} Cᵒᵖ - CategoryTheory.ShrinkHoms.abelian 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [CategoryTheory.Abelian C] : CategoryTheory.Abelian (CategoryTheory.ShrinkHoms.{u_1} C) - CategoryTheory.ShrinkHoms.hasFiniteLimits 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [CategoryTheory.Limits.HasFiniteLimits C] : CategoryTheory.Limits.HasFiniteLimits (CategoryTheory.ShrinkHoms.{u_1} C) - CategoryTheory.ShrinkHoms.preadditive 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [CategoryTheory.Preadditive C] : CategoryTheory.Preadditive (CategoryTheory.ShrinkHoms.{u_1} C) - CategoryTheory.ShrinkHoms.hasLimitsOfShape 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] (J : Type u_2) [CategoryTheory.Category.{v_2, u_2} J] [CategoryTheory.Limits.HasLimitsOfShape J C] : CategoryTheory.Limits.HasLimitsOfShape J (CategoryTheory.ShrinkHoms.{u_1} C) - CategoryTheory.ShrinkHoms.instAdditiveFunctor 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [CategoryTheory.Preadditive C] : (CategoryTheory.ShrinkHoms.functor C).Additive - CategoryTheory.ShrinkHoms.instAdditiveInverse 📋 Mathlib.CategoryTheory.Abelian.Transfer
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.LocallySmall.{w, v_1, u_1} C] [CategoryTheory.Preadditive C] : (CategoryTheory.ShrinkHoms.inverse C).Additive - CategoryTheory.CostructuredArrow.instSmallOfLocallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : CategoryTheory.Functor C D} {T : D} [Small.{w, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : Small.{w, max u₁ v₂} (CategoryTheory.CostructuredArrow S T) - CategoryTheory.StructuredArrow.instSmallOfLocallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : D} {T : CategoryTheory.Functor C D} [Small.{w, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : Small.{w, max u₁ v₂} (CategoryTheory.StructuredArrow S T) - CategoryTheory.CostructuredArrow.essentiallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : CategoryTheory.Functor C D} {T : D} [CategoryTheory.EssentiallySmall.{w, v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : CategoryTheory.EssentiallySmall.{w, v₁, max u₁ v₂} (CategoryTheory.CostructuredArrow S T) - CategoryTheory.StructuredArrow.essentiallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : D} {T : CategoryTheory.Functor C D} [CategoryTheory.EssentiallySmall.{w, v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : CategoryTheory.EssentiallySmall.{w, v₁, max u₁ v₂} (CategoryTheory.StructuredArrow S T) - CategoryTheory.CostructuredArrow.small_inverseImage_proj_of_locallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : CategoryTheory.Functor C D} {T : D} {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} P] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : CategoryTheory.ObjectProperty.Small.{w, v₁, max u₁ v₂} (P.inverseImage (CategoryTheory.CostructuredArrow.proj S T)) - CategoryTheory.StructuredArrow.small_inverseImage_proj_of_locallySmall 📋 Mathlib.CategoryTheory.Comma.StructuredArrow.Small
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : D} {T : CategoryTheory.Functor C D} {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} P] [CategoryTheory.LocallySmall.{w, v₂, u₂} D] : CategoryTheory.ObjectProperty.Small.{w, v₁, max u₁ v₂} (P.inverseImage (CategoryTheory.StructuredArrow.proj S T)) - CategoryTheory.wellPowered_of_isDetecting 📋 Mathlib.CategoryTheory.Generator.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasPullbacks C] {𝒢 : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} 𝒢] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (h𝒢 : 𝒢.IsDetecting) : CategoryTheory.WellPowered.{w, v₁, u₁} C - CategoryTheory.hasInitial_of_isCoseparating 📋 Mathlib.CategoryTheory.Generator.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] [CategoryTheory.Limits.HasLimitsOfSize.{w, w, v₁, u₁} C] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} P] (hP : P.IsCoseparating) : CategoryTheory.Limits.HasInitial C - CategoryTheory.hasTerminal_of_isSeparating 📋 Mathlib.CategoryTheory.Generator.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} Cᵒᵖ] [CategoryTheory.WellPowered.{w, v₁, u₁} Cᵒᵖ] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v₁, u₁} C] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} P] (hP : P.IsSeparating) : CategoryTheory.Limits.HasTerminal C - CategoryTheory.hasInitial_of_weakly_initial_and_hasWideEqualizers 📋 Mathlib.CategoryTheory.Limits.Constructions.WeaklyInitial
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasWideEqualizers C] {T : C} [CategoryTheory.LocallySmall.{w, v, u} C] (hT : ∀ (X : C), Nonempty (T ⟶ X)) : CategoryTheory.Limits.HasInitial C - CategoryTheory.Over.locallySmall 📋 Mathlib.CategoryTheory.Comma.LocallySmall
{T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] (X : T) [CategoryTheory.LocallySmall.{w, v₃, u₃} T] : CategoryTheory.LocallySmall.{w, v₃, max u₃ v₃} (CategoryTheory.Over X) - CategoryTheory.Under.locallySmall 📋 Mathlib.CategoryTheory.Comma.LocallySmall
{T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] (X : T) [CategoryTheory.LocallySmall.{w, v₃, u₃} T] : CategoryTheory.LocallySmall.{w, v₃, max u₃ v₃} (CategoryTheory.Under X) - CategoryTheory.CostructuredArrow.locallySmall 📋 Mathlib.CategoryTheory.Comma.LocallySmall
{A : Type u₁} {T : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₃, u₃} T] (S : CategoryTheory.Functor A T) (X : T) [CategoryTheory.LocallySmall.{w, v₁, u₁} A] : CategoryTheory.LocallySmall.{w, v₁, max u₁ v₃} (CategoryTheory.CostructuredArrow S X) - CategoryTheory.StructuredArrow.locallySmall 📋 Mathlib.CategoryTheory.Comma.LocallySmall
{B : Type u₂} {T : Type u₃} [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} T] (S : T) (T✝ : CategoryTheory.Functor B T) [CategoryTheory.LocallySmall.{w, v₂, u₂} B] : CategoryTheory.LocallySmall.{w, v₂, max u₂ v₃} (CategoryTheory.StructuredArrow S T✝) - CategoryTheory.Comma.locallySmall 📋 Mathlib.CategoryTheory.Comma.LocallySmall
{A : Type u₁} {B : Type u₂} {T : Type u₃} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Category.{v₂, u₂} B] [CategoryTheory.Category.{v₃, u₃} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) [CategoryTheory.LocallySmall.{w, v₁, u₁} A] [CategoryTheory.LocallySmall.{w, v₂, u₂} B] : CategoryTheory.LocallySmall.{w, max v₁ v₂, max (max u₂ u₁) v₃} (CategoryTheory.Comma L R) - CategoryTheory.StructuredArrow.wellPowered_structuredArrow 📋 Mathlib.CategoryTheory.Subobject.Comma
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : D} {T : CategoryTheory.Functor C D} [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} C] [CategoryTheory.Limits.HasFiniteLimits C] [CategoryTheory.Limits.PreservesFiniteLimits T] : CategoryTheory.WellPowered.{w, v₁, max u₁ v₂} (CategoryTheory.StructuredArrow S T) - CategoryTheory.CostructuredArrow.well_copowered_costructuredArrow 📋 Mathlib.CategoryTheory.Subobject.Comma
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {S : CategoryTheory.Functor C D} {T : D} [CategoryTheory.LocallySmall.{w, v₁, u₁} C] [CategoryTheory.WellPowered.{w, v₁, u₁} Cᵒᵖ] [CategoryTheory.Limits.HasFiniteColimits C] [CategoryTheory.Limits.PreservesFiniteColimits S] : CategoryTheory.WellPowered.{w, v₁, max u₁ v₂} (CategoryTheory.CostructuredArrow S T)ᵒᵖ - CategoryTheory.Limits.hasColimits_of_hasLimits_of_hasCoseparator 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfSize.{w, w, v, u} C] [CategoryTheory.HasCoseparator C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.WellPowered.{w, v, u} C] : CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C - CategoryTheory.Limits.hasLimits_of_hasColimits_of_hasSeparator 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C] [CategoryTheory.HasSeparator C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.WellPowered.{w, v, u} Cᵒᵖ] : CategoryTheory.Limits.HasLimitsOfSize.{w, w, v, u} C - CategoryTheory.Limits.hasColimits_of_hasLimits_of_isCoseparating 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfSize.{w, w, v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.WellPowered.{w, v, u} C] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v, u} P] (hP : P.IsCoseparating) : CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C - CategoryTheory.isRightAdjoint_of_preservesLimits_of_solutionSetCondition 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₁} [CategoryTheory.Category.{v₁, u₁} D] (G : CategoryTheory.Functor D C) [CategoryTheory.Limits.HasLimitsOfSize.{w, w, v₁, u₁} D] [CategoryTheory.Limits.PreservesLimitsOfSize.{w, w, v₁, v, u₁, u} G] (hG : CategoryTheory.SolutionSetCondition G) [CategoryTheory.LocallySmall.{w, v₁, u₁} D] : G.IsRightAdjoint - CategoryTheory.Limits.hasLimits_of_hasColimits_of_isSeparating 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.WellPowered.{w, v, u} Cᵒᵖ] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v, u} P] (hP : P.IsSeparating) : CategoryTheory.Limits.HasLimitsOfSize.{w, w, v, u} C - CategoryTheory.isRightAdjoint_of_preservesLimits_of_isCoseparating 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₁} [CategoryTheory.Category.{v₁, u₁} D] [CategoryTheory.Limits.HasLimitsOfSize.{w, w, v₁, u₁} D] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} D] [CategoryTheory.WellPowered.{w, v₁, u₁} D] {P : CategoryTheory.ObjectProperty D} [CategoryTheory.ObjectProperty.Small.{w, v₁, u₁} P] (hP : P.IsCoseparating) (G : CategoryTheory.Functor D C) [CategoryTheory.Limits.PreservesLimitsOfSize.{w, w, v₁, v, u₁, u} G] : G.IsRightAdjoint - CategoryTheory.isLeftAdjoint_of_preservesColimits_of_isSeparating 📋 Mathlib.CategoryTheory.Adjunction.AdjointFunctorTheorems
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₁} [CategoryTheory.Category.{v₁, u₁} D] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} D] [CategoryTheory.WellPowered.{w, v, u} Cᵒᵖ] {P : CategoryTheory.ObjectProperty C} [CategoryTheory.ObjectProperty.Small.{w, v, u} P] (h𝒢 : P.IsSeparating) (F : CategoryTheory.Functor C D) [CategoryTheory.Limits.PreservesColimitsOfSize.{w, w, v, v₁, u, u₁} F] : F.IsLeftAdjoint - CategoryTheory.IsGrothendieckAbelian.locallySmall 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} {inst✝ : CategoryTheory.Category.{v, u} C} {inst✝¹ : CategoryTheory.Abelian C} [self : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C] : CategoryTheory.LocallySmall.{w, v, u} C - CategoryTheory.IsGrothendieckAbelian.mk 📋 Mathlib.CategoryTheory.Abelian.GrothendieckCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] (locallySmall : CategoryTheory.LocallySmall.{w, v, u} C := by infer_instance) (hasFilteredColimitsOfSize : CategoryTheory.Limits.HasFilteredColimitsOfSize.{w, w, v, u} C := by infer_instance) (ab5OfSize : CategoryTheory.AB5OfSize.{w, w, v, u} C := by infer_instance) (hasSeparator : CategoryTheory.HasSeparator C := by infer_instance) : CategoryTheory.IsGrothendieckAbelian.{w, v, u} C - CategoryTheory.Limits.WalkingMultispan.instLocallySmall 📋 Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{J : CategoryTheory.Limits.MultispanShape} : CategoryTheory.LocallySmall.{t, max w w', max w' w} (CategoryTheory.Limits.WalkingMultispan J) - CategoryTheory.ObjectProperty.instEssentiallySmallLimitsClosureOfSmallOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] [Small.{w, t} α] [∀ (a : α), Small.{w, u'} (J a)] [∀ (a : α), CategoryTheory.LocallySmall.{w, v', u'} (J a)] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} (P.limitsClosure J) - CategoryTheory.ObjectProperty.isEssentiallySmall_limitsClosure 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] (κ : Cardinal.{w}) [Fact κ.IsRegular] (h : ∀ (a : α), HasCardinalLT (J a) κ) [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] [Small.{w, t} α] [∀ (a : α), Small.{w, u'} (J a)] [∀ (a : α), CategoryTheory.LocallySmall.{w, v', u'} (J a)] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} (P.limitsClosure J) - CategoryTheory.ObjectProperty.instSmallStrictLimitsClosureIterOfLocallySmallOfSmallElemIio 📋 Mathlib.CategoryTheory.ObjectProperty.LimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] {β : Type w'} [LinearOrder β] [OrderBot β] [SuccOrder β] [WellFoundedLT β] [CategoryTheory.ObjectProperty.Small.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] [Small.{w, t} α] [∀ (a : α), Small.{w, u'} (J a)] [∀ (a : α), CategoryTheory.LocallySmall.{w, v', u'} (J a)] (b : β) [hb₀ : Small.{w, w'} ↑(Set.Iio b)] : CategoryTheory.ObjectProperty.Small.{w, v, u} (P.strictLimitsClosureIter J b) - CategoryTheory.ObjectProperty.instEssentiallySmallColimitsClosureOfSmallOfLocallySmall 📋 Mathlib.CategoryTheory.ObjectProperty.ColimitsClosure
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) {α : Type t} (J : α → Type u') [(a : α) → CategoryTheory.Category.{v', u'} (J a)] [CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} P] [CategoryTheory.LocallySmall.{w, v, u} C] [Small.{w, t} α] [∀ (a : α), Small.{w, u'} (J a)] [∀ (a : α), CategoryTheory.LocallySmall.{w, v', u'} (J a)] : CategoryTheory.ObjectProperty.EssentiallySmall.{w, v, u} (P.colimitsClosure J) - CategoryTheory.hasExt_of_enoughProjectives 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.EnoughProjectives
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.EnoughProjectives C] : CategoryTheory.HasExt C - CategoryTheory.hasExt_of_enoughInjectives 📋 Mathlib.Algebra.Homology.DerivedCategory.Ext.EnoughInjectives
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.EnoughInjectives C] : CategoryTheory.HasExt C - CategoryTheory.instInitiallySmallOverOfLocallySmall 📋 Mathlib.CategoryTheory.Limits.FinallySmall
{J : Type u} [CategoryTheory.Category.{v, u} J] [CategoryTheory.LocallySmall.{w, v, u} J] [CategoryTheory.InitiallySmall J] (X : J) : CategoryTheory.InitiallySmall (CategoryTheory.Over X) - CategoryTheory.FinallySmall.FilteredFinalModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsFiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.FinallySmall C] : Type w - CategoryTheory.InitiallySmall.CofilteredInitialModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.InitiallySmall C] : Type w - CategoryTheory.FinallySmall.instCategoryFilteredFinalModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsFiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.FinallySmall C] : CategoryTheory.Category.{w, w} (CategoryTheory.FinallySmall.FilteredFinalModel C) - CategoryTheory.InitiallySmall.instCategoryCofilteredInitialModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.InitiallySmall C] : CategoryTheory.Category.{w, w} (CategoryTheory.InitiallySmall.CofilteredInitialModel C) - CategoryTheory.FinallySmall.instIsFilteredFilteredFinalModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsFiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.FinallySmall C] : CategoryTheory.IsFiltered (CategoryTheory.FinallySmall.FilteredFinalModel C) - CategoryTheory.InitiallySmall.instIsCofilteredCofilteredInitialModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.InitiallySmall C] : CategoryTheory.IsCofiltered (CategoryTheory.InitiallySmall.CofilteredInitialModel C) - CategoryTheory.FinallySmall.fromFilteredFinalModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsFiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.FinallySmall C] : CategoryTheory.Functor (CategoryTheory.FinallySmall.FilteredFinalModel C) C - CategoryTheory.InitiallySmall.fromCofilteredInitialModel 📋 Mathlib.CategoryTheory.Filtered.FinallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.IsCofiltered C] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.InitiallySmall C] : CategoryTheory.Functor (CategoryTheory.InitiallySmall.CofilteredInitialModel C) C
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