Loogle!
Result
Found 159 declarations mentioning CategoryTheory.Functor.mapCone.
- CategoryTheory.Functor.mapCone 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : CategoryTheory.Limits.Cone (F.comp H) - CategoryTheory.Functor.mapCone_pt 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : (H.mapCone c).pt = H.obj c.pt - CategoryTheory.Functor.mapConeInvMapCone 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J D} (H : CategoryTheory.Functor D C) [H.IsEquivalence] (c : CategoryTheory.Limits.Cone F) : H.mapConeInv (H.mapCone c) ≅ c - CategoryTheory.Functor.mapConeMapConeInv 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J D} (H : CategoryTheory.Functor D C) [H.IsEquivalence] (c : CategoryTheory.Limits.Cone (F.comp H)) : H.mapCone (H.mapConeInv c) ≅ c - CategoryTheory.Functor.mapConeMapCone 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] {F : CategoryTheory.Functor J C} {H : CategoryTheory.Functor C D} {H' : CategoryTheory.Functor D E} (c : CategoryTheory.Limits.Cone F) : H'.mapCone (H.mapCone c) ≅ (H.comp H').mapCone c - CategoryTheory.Functor.mapConeWhisker 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} {E : CategoryTheory.Functor K J} {c : CategoryTheory.Limits.Cone F} : H.mapCone (CategoryTheory.Limits.Cone.whisker E c) ≅ CategoryTheory.Limits.Cone.whisker E (H.mapCone c) - CategoryTheory.Functor.mapCoconeOp 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (G.mapCocone t).op ≅ G.op.mapCone t.op - CategoryTheory.Functor.mapConeOp 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (G.mapCone t).op ≅ G.op.mapCocone t.op - CategoryTheory.Functor.mapConeMorphism 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} {c c' : CategoryTheory.Limits.Cone F} (f : c ⟶ c') : H.mapCone c ⟶ H.mapCone c' - CategoryTheory.Functor.mapCone_π_app 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) (j : J) : (H.mapCone c).π.app j = H.map (c.π.app j) - CategoryTheory.Functor.postcomposeWhiskerLeftMapCone 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} {H H' : CategoryTheory.Functor C D} (α : H ≅ H') (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Limits.Cone.postcompose (F.whiskerLeft α.hom)).obj (H.mapCone c) ≅ H'.mapCone c - CategoryTheory.Functor.mapConePostcompose 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ⟶ G} {c : CategoryTheory.Limits.Cone F} : H.mapCone ((CategoryTheory.Limits.Cone.postcompose α).obj c) ≅ (CategoryTheory.Limits.Cone.postcompose (CategoryTheory.Functor.whiskerRight α H)).obj (H.mapCone c) - CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ≅ G} {c : CategoryTheory.Limits.Cone F} : H.mapCone ((CategoryTheory.Limits.Cone.postcomposeEquivalence α).functor.obj c) ≅ (CategoryTheory.Limits.Cone.postcomposeEquivalence (CategoryTheory.Functor.isoWhiskerRight α H)).functor.obj (H.mapCone c) - CategoryTheory.Functor.mapConeMapCone_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] {F : CategoryTheory.Functor J C} {H : CategoryTheory.Functor C D} {H' : CategoryTheory.Functor D E} (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeMapCone c).hom.hom = CategoryTheory.CategoryStruct.id (H'.obj (H.obj c.pt)) - CategoryTheory.Functor.mapConeMapCone_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {E : Type u₅} [CategoryTheory.Category.{v₅, u₅} E] {F : CategoryTheory.Functor J C} {H : CategoryTheory.Functor C D} {H' : CategoryTheory.Functor D E} (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeMapCone c).inv.hom = CategoryTheory.CategoryStruct.id (H'.obj (H.obj c.pt)) - CategoryTheory.Functor.mapConeWhisker_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} {E : CategoryTheory.Functor K J} {c : CategoryTheory.Limits.Cone F} : H.mapConeWhisker.hom.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Functor.mapConeWhisker_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F : CategoryTheory.Functor J C} {E : CategoryTheory.Functor K J} {c : CategoryTheory.Limits.Cone F} : H.mapConeWhisker.inv.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Functor.mapCoconeOp_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Functor.mapCoconeOp G t).hom.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapCoconeOp_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Functor.mapCoconeOp G t).inv.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapConeOp_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeOp G t).hom.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapConeOp_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeOp G t).inv.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapConePostcompose_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ⟶ G} {c : CategoryTheory.Limits.Cone F} : H.mapConePostcompose.hom.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Functor.mapConePostcompose_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ⟶ G} {c : CategoryTheory.Limits.Cone F} : H.mapConePostcompose.inv.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Functor.postcomposeWhiskerLeftMapCone_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} {H H' : CategoryTheory.Functor C D} (α : H ≅ H') (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.postcomposeWhiskerLeftMapCone α c).hom.hom = α.hom.app c.pt - CategoryTheory.Functor.postcomposeWhiskerLeftMapCone_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {F : CategoryTheory.Functor J C} {H H' : CategoryTheory.Functor C D} (α : H ≅ H') (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.postcomposeWhiskerLeftMapCone α c).inv.hom = α.inv.app c.pt - CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor_hom_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ≅ G} {c : CategoryTheory.Limits.Cone F} : H.mapConePostcomposeEquivalenceFunctor.hom.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Functor.mapConePostcomposeEquivalenceFunctor_inv_hom 📋 Mathlib.CategoryTheory.Limits.Cones
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (H : CategoryTheory.Functor C D) {F G : CategoryTheory.Functor J C} {α : F ≅ G} {c : CategoryTheory.Limits.Cone F} : H.mapConePostcomposeEquivalenceFunctor.inv.hom = CategoryTheory.CategoryStruct.id (H.obj c.pt) - CategoryTheory.Limits.IsLimit.mapConeEquiv 📋 Mathlib.CategoryTheory.Limits.IsLimit
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {K : CategoryTheory.Functor J C} {F G : CategoryTheory.Functor C D} (h : F ≅ G) {c : CategoryTheory.Limits.Cone K} (t : CategoryTheory.Limits.IsLimit (F.mapCone c)) : CategoryTheory.Limits.IsLimit (G.mapCone c) - CategoryTheory.Limits.IsLimit.ofFaithful 📋 Mathlib.CategoryTheory.Limits.IsLimit
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cone F} {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] (G : CategoryTheory.Functor C D) [G.Faithful] (ht : CategoryTheory.Limits.IsLimit (G.mapCone t)) (lift : (s : CategoryTheory.Limits.Cone F) → s.pt ⟶ t.pt) (h : ∀ (s : CategoryTheory.Limits.Cone F), G.map (lift s) = ht.lift (G.mapCone s)) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.limit.lift_post 📋 Mathlib.CategoryTheory.Limits.HasLimits
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u'} [CategoryTheory.Category.{v', u'} D] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F] (G : CategoryTheory.Functor C D) [CategoryTheory.Limits.HasLimit (F.comp G)] (c : CategoryTheory.Limits.Cone F) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.limit.lift F c)) (CategoryTheory.Limits.limit.post F G) = CategoryTheory.Limits.limit.lift (F.comp G) (G.mapCone c) - CategoryTheory.Limits.Fan.isLimitMapConeEquiv 📋 Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (F : CategoryTheory.Functor C D) {ι : Type u_1} (X : ι → C) (c : CategoryTheory.Limits.Fan X) : CategoryTheory.Limits.IsLimit (F.mapCone c) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fan.mk (F.obj c.pt) fun i => F.map (c.proj i)) - CategoryTheory.Limits.BinaryFan.isLimitMapConeEquiv 📋 Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts.BinaryFan
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F : CategoryTheory.Functor C D} {X Y : C} {s : CategoryTheory.Limits.BinaryFan X Y} : CategoryTheory.Limits.IsLimit (F.mapCone s) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.BinaryFan.map F s) - CategoryTheory.Limits.isLimitOfPreserves 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} (F : CategoryTheory.Functor C D) {c : CategoryTheory.Limits.Cone K} (t : CategoryTheory.Limits.IsLimit c) [CategoryTheory.Limits.PreservesLimit K F] : CategoryTheory.Limits.IsLimit (F.mapCone c) - CategoryTheory.Limits.isLimitOfReflects 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} (F : CategoryTheory.Functor C D) {c : CategoryTheory.Limits.Cone K} (t : CategoryTheory.Limits.IsLimit (F.mapCone c)) [CategoryTheory.Limits.ReflectsLimit K F] : CategoryTheory.Limits.IsLimit c - CategoryTheory.Limits.preservesLimit_of_preserves_limit_cone 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} {t : CategoryTheory.Limits.Cone K} (h : CategoryTheory.Limits.IsLimit t) (hF : CategoryTheory.Limits.IsLimit (F.mapCone t)) : CategoryTheory.Limits.PreservesLimit K F - CategoryTheory.Limits.PreservesLimit.mk 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} (preserves : ∀ {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit c), Nonempty (CategoryTheory.Limits.IsLimit (F.mapCone c))) : CategoryTheory.Limits.PreservesLimit K F - CategoryTheory.Limits.PreservesLimit.preserves 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {J : Type w} {inst✝² : CategoryTheory.Category.{w', w} J} {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [self : CategoryTheory.Limits.PreservesLimit K F] {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit c) : Nonempty (CategoryTheory.Limits.IsLimit (F.mapCone c)) - CategoryTheory.Limits.ReflectsLimit.mk 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} (reflects : ∀ {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit (F.mapCone c)), Nonempty (CategoryTheory.Limits.IsLimit c)) : CategoryTheory.Limits.ReflectsLimit K F - CategoryTheory.Limits.ReflectsLimit.reflects 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} {inst✝ : CategoryTheory.Category.{v₁, u₁} C} {D : Type u₂} {inst✝¹ : CategoryTheory.Category.{v₂, u₂} D} {J : Type w} {inst✝² : CategoryTheory.Category.{w', w} J} {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [self : CategoryTheory.Limits.ReflectsLimit K F] {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit (F.mapCone c)) : Nonempty (CategoryTheory.Limits.IsLimit c) - CategoryTheory.Limits.preservesLimit_iff_isLimit_mapCone 📋 Mathlib.CategoryTheory.Limits.Preserves.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} {t : CategoryTheory.Limits.Cone K} (h : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Limits.PreservesLimit K F ↔ Nonempty (CategoryTheory.Limits.IsLimit (F.mapCone t)) - CategoryTheory.Limits.isLimitMapConeEmptyConeEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Terminal
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) (X : C) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.asEmptyCone X)) ≃ CategoryTheory.Limits.IsTerminal (G.obj X) - CategoryTheory.Limits.isLimitMapConeBinaryFanEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.BinaryProducts
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {P X Y : C} (f : P ⟶ X) (g : P ⟶ Y) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.BinaryFan.mk f g)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.BinaryFan.mk (G.map f) (G.map g)) - CategoryTheory.Limits.isLimitMapConeFanMkEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Products
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {J : Type w} (f : J → C) {P : C} (g : (j : J) → P ⟶ f j) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.Fan.mk P g)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fan.mk (G.obj P) fun j => G.map (g j)) - CategoryTheory.preserves_lift_mapCone 📋 Mathlib.CategoryTheory.Limits.Preserves.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {J : Type w} [CategoryTheory.Category.{w', w} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.PreservesLimit F G] (c₁ c₂ : CategoryTheory.Limits.Cone F) (t : CategoryTheory.Limits.IsLimit c₁) : (CategoryTheory.Limits.isLimitOfPreserves G t).lift (G.mapCone c₂) = G.map (t.lift c₂) - CategoryTheory.lift_comp_preservesLimitIso_hom 📋 Mathlib.CategoryTheory.Limits.Preserves.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {J : Type w} [CategoryTheory.Category.{w', w} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.PreservesLimit F G] [CategoryTheory.Limits.HasLimit F] (t : CategoryTheory.Limits.Cone F) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.limit.lift F t)) (CategoryTheory.preservesLimitIso G F).hom = CategoryTheory.Limits.limit.lift (F.comp G) (G.mapCone t) - CategoryTheory.lift_comp_preservesLimitIso_hom_assoc 📋 Mathlib.CategoryTheory.Limits.Preserves.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {J : Type w} [CategoryTheory.Category.{w', w} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.PreservesLimit F G] [CategoryTheory.Limits.HasLimit F] (t : CategoryTheory.Limits.Cone F) {Z : D} (h : CategoryTheory.Limits.limit (F.comp G) ⟶ Z) : CategoryTheory.CategoryStruct.comp (G.map (CategoryTheory.Limits.limit.lift F t)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.preservesLimitIso G F).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.lift (F.comp G) (G.mapCone t)) h - CategoryTheory.Limits.evaluationJointlyReflectsLimits 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] {F : CategoryTheory.Functor J (CategoryTheory.Functor K C)} (c : CategoryTheory.Limits.Cone F) (t : (k : K) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation K C).obj k).mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Limits.evaluateCombinedCones 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {K : Type u₂} [CategoryTheory.Category.{v₂, u₂} K] (F : CategoryTheory.Functor J (CategoryTheory.Functor K C)) (c : (k : K) → CategoryTheory.Limits.LimitCone (F.flip.obj k)) (k : K) : ((CategoryTheory.evaluation K C).obj k).mapCone (CategoryTheory.Limits.combineCones F c) ≅ (c k).cone - CategoryTheory.LiftableCone.mk 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} {c : CategoryTheory.Limits.Cone (K.comp F)} (liftedCone : CategoryTheory.Limits.Cone K) (validLift : F.mapCone liftedCone ≅ c) : CategoryTheory.LiftableCone K F c - CategoryTheory.LiftableCone.validLift 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} {c : CategoryTheory.Limits.Cone (K.comp F)} (self : CategoryTheory.LiftableCone K F c) : F.mapCone self.liftedCone ≅ c - CategoryTheory.liftedLimitMapsToOriginal 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [CategoryTheory.CreatesLimit K F] {c : CategoryTheory.Limits.Cone (K.comp F)} (t : CategoryTheory.Limits.IsLimit c) : F.mapCone (CategoryTheory.liftLimit t) ≅ c - CategoryTheory.createsLimitOfFullyFaithfulOfLift 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [F.Full] [F.Faithful] [CategoryTheory.Limits.HasLimit (K.comp F)] (c : CategoryTheory.Limits.Cone K) (i : F.mapCone c ≅ CategoryTheory.Limits.limit.cone (K.comp F)) : CategoryTheory.CreatesLimit K F - CategoryTheory.createsLimitOfFullyFaithfulOfLift' 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [F.Full] [F.Faithful] {l : CategoryTheory.Limits.Cone (K.comp F)} (hl : CategoryTheory.Limits.IsLimit l) (c : CategoryTheory.Limits.Cone K) (i : F.mapCone c ≅ l) : CategoryTheory.CreatesLimit K F - CategoryTheory.liftedLimitMapsToOriginal_inv_map_π 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [CategoryTheory.CreatesLimit K F] {c : CategoryTheory.Limits.Cone (K.comp F)} (t : CategoryTheory.Limits.IsLimit c) (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.liftedLimitMapsToOriginal t).inv.hom (F.map ((CategoryTheory.liftLimit t).π.app j)) = c.π.app j - CategoryTheory.liftedLimitMapsToOriginal_hom_π 📋 Mathlib.CategoryTheory.Limits.Creates
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type w} [CategoryTheory.Category.{w', w} J] {K : CategoryTheory.Functor J C} {F : CategoryTheory.Functor C D} [CategoryTheory.CreatesLimit K F] {c : CategoryTheory.Limits.Cone (K.comp F)} (t : CategoryTheory.Limits.IsLimit c) (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.liftedLimitMapsToOriginal t).hom.hom (c.π.app j) = F.map ((CategoryTheory.liftLimit t).π.app j) - CategoryTheory.coyonedaJointlyReflectsLimits 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [CategoryTheory.Category.{t, w} J] (F : CategoryTheory.Functor J C) (c : CategoryTheory.Limits.Cone F) (hc : (X : Cᵒᵖ) → CategoryTheory.Limits.IsLimit ((CategoryTheory.coyoneda.obj X).mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Limits.Cone.isLimitCoyonedaEquiv 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [CategoryTheory.Category.{t, w} J] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : CategoryTheory.Limits.IsLimit c ≃ ((X : Cᵒᵖ) → CategoryTheory.Limits.IsLimit ((CategoryTheory.coyoneda.obj X).mapCone c)) - CategoryTheory.yonedaJointlyReflectsLimits 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [CategoryTheory.Category.{t, w} J] (F : CategoryTheory.Functor J Cᵒᵖ) (c : CategoryTheory.Limits.Cone F) (hc : (X : C) → CategoryTheory.Limits.IsLimit ((CategoryTheory.yoneda.obj X).mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Limits.Cocone.isColimitYonedaEquiv 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type w} [CategoryTheory.Category.{t, w} J] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cocone F) : CategoryTheory.Limits.IsColimit c ≃ ((X : C) → CategoryTheory.Limits.IsLimit ((CategoryTheory.yoneda.obj X).mapCone c.op)) - AddCommGrpCat.forget₂AddCommMon_preservesLimitsAux 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J AddCommGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget AddCommGrpCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ AddCommGrpCat AddCommMonCat).mapCone (AddCommGrpCat.limitCone F)) - CommGrpCat.forget₂CommMon_preservesLimitsAux 📋 Mathlib.Algebra.Category.Grp.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommGrpCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget CommGrpCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ CommGrpCat CommMonCat).mapCone (CommGrpCat.limitCone F)) - ModuleCat.forget₂AddCommGroup_preservesLimitsAux 📋 Mathlib.Algebra.Category.ModuleCat.Limits
{R : Type u} [Ring R] {J : Type v} [CategoryTheory.Category.{t, v} J] (F : CategoryTheory.Functor J (ModuleCat R)) [Small.{w, max v w} ↑(F.comp (CategoryTheory.forget (ModuleCat R))).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ (ModuleCat R) AddCommGrpCat).mapCone (ModuleCat.HasLimits.limitCone F)) - SemiRingCat.forget₂MonPreservesLimitsAux 📋 Mathlib.Algebra.Category.Ring.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J SemiRingCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget SemiRingCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ SemiRingCat MonCat).mapCone (SemiRingCat.HasLimits.limitCone F)) - SemiRingCat.forget₂AddCommMonPreservesLimitsAux 📋 Mathlib.Algebra.Category.Ring.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J SemiRingCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget SemiRingCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ SemiRingCat AddCommMonCat).mapCone (SemiRingCat.HasLimits.limitCone F)) - CommRingCat.forget₂CommSemiRingPreservesLimitsAux 📋 Mathlib.Algebra.Category.Ring.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J CommRingCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget CommRingCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ CommRingCat CommSemiRingCat).mapCone (CommRingCat.limitCone F)) - RingCat.forget₂AddCommGroupPreservesLimitsAux 📋 Mathlib.Algebra.Category.Ring.Limits
{J : Type v} [CategoryTheory.Category.{w, v} J] (F : CategoryTheory.Functor J RingCat) [Small.{u, max u v} ↑(F.comp (CategoryTheory.forget RingCat)).sections] : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget₂ RingCat AddCommGrpCat).mapCone (RingCat.limitCone F)) - CategoryTheory.Limits.PullbackCone.isLimitMapConeEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} (c : CategoryTheory.Limits.PullbackCone f g) (G : CategoryTheory.Functor C D) : CategoryTheory.Limits.IsLimit (G.mapCone c) ≃ CategoryTheory.Limits.IsLimit (c.map G) - CategoryTheory.Limits.isLimitMapConePullbackConeEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {W X Y Z : C} {f : X ⟶ Z} {g : Y ⟶ Z} {h : W ⟶ X} {k : W ⟶ Y} (comm : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp k g) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.PullbackCone.mk h k comm)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.PullbackCone.mk (G.map h) (G.map k) ⋯) - CategoryTheory.Comma.fstSndJointlyReflectLimit 📋 Mathlib.CategoryTheory.Limits.Comma
{J : Type w} [CategoryTheory.Category.{w', w} J] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] {B : Type u₂} [CategoryTheory.Category.{v₂, u₂} B] {T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} {F : CategoryTheory.Functor J (CategoryTheory.Comma L R)} {c : CategoryTheory.Limits.Cone F} [CategoryTheory.Limits.PreservesLimit (F.comp (CategoryTheory.Comma.snd L R)) R] (h₁ : CategoryTheory.Limits.IsLimit ((CategoryTheory.Comma.fst L R).mapCone c)) (h₂ : CategoryTheory.Limits.IsLimit ((CategoryTheory.Comma.snd L R).mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Comma.coneOfPreserves_pt_hom 📋 Mathlib.CategoryTheory.Limits.Comma
{J : Type w} [CategoryTheory.Category.{w', w} J] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] {B : Type u₂} [CategoryTheory.Category.{v₂, u₂} B] {T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} (F : CategoryTheory.Functor J (CategoryTheory.Comma L R)) [CategoryTheory.Limits.PreservesLimit (F.comp (CategoryTheory.Comma.snd L R)) R] (c₁ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.fst L R))) {c₂ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.snd L R))} (t₂ : CategoryTheory.Limits.IsLimit c₂) : (CategoryTheory.Comma.coneOfPreserves F c₁ t₂).pt.hom = (CategoryTheory.Limits.isLimitOfPreserves R t₂).lift (CategoryTheory.Comma.limitAuxiliaryCone F c₁) - CategoryTheory.Comma.limitAuxiliaryCone_π_app 📋 Mathlib.CategoryTheory.Limits.Comma
{J : Type w} [CategoryTheory.Category.{w', w} J] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] {B : Type u₂} [CategoryTheory.Category.{v₂, u₂} B] {T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} (F : CategoryTheory.Functor J (CategoryTheory.Comma L R)) (c₁ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.fst L R))) (X : J) : (CategoryTheory.Comma.limitAuxiliaryCone F c₁).π.app X = CategoryTheory.CategoryStruct.comp (L.map (c₁.π.app X)) (F.obj X).hom - CategoryTheory.Comma.coneOfPreserves_π_app_left 📋 Mathlib.CategoryTheory.Limits.Comma
{J : Type w} [CategoryTheory.Category.{w', w} J] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] {B : Type u₂} [CategoryTheory.Category.{v₂, u₂} B] {T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} (F : CategoryTheory.Functor J (CategoryTheory.Comma L R)) [CategoryTheory.Limits.PreservesLimit (F.comp (CategoryTheory.Comma.snd L R)) R] (c₁ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.fst L R))) {c₂ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.snd L R))} (t₂ : CategoryTheory.Limits.IsLimit c₂) (j : J) : ((CategoryTheory.Comma.coneOfPreserves F c₁ t₂).π.app j).left = c₁.π.app j - CategoryTheory.Comma.coneOfPreserves_π_app_right 📋 Mathlib.CategoryTheory.Limits.Comma
{J : Type w} [CategoryTheory.Category.{w', w} J] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] {B : Type u₂} [CategoryTheory.Category.{v₂, u₂} B] {T : Type u₃} [CategoryTheory.Category.{v₃, u₃} T] {L : CategoryTheory.Functor A T} {R : CategoryTheory.Functor B T} (F : CategoryTheory.Functor J (CategoryTheory.Comma L R)) [CategoryTheory.Limits.PreservesLimit (F.comp (CategoryTheory.Comma.snd L R)) R] (c₁ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.fst L R))) {c₂ : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Comma.snd L R))} (t₂ : CategoryTheory.Limits.IsLimit c₂) (j : J) : ((CategoryTheory.Comma.coneOfPreserves F c₁ t₂).π.app j).right = c₂.π.app j - CategoryTheory.Limits.Cone.mapConeToUnder 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.Under.forget c.pt).mapCone c.toUnder ≅ c - CategoryTheory.Limits.Cone.toStructuredArrowCone 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {K : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone K) (F : CategoryTheory.Functor C D) {X : D} (f : X ⟶ F.obj c.pt) : CategoryTheory.Limits.Cone ((F.mapCone c).toStructuredArrow.comp ((CategoryTheory.StructuredArrow.map f).comp (CategoryTheory.StructuredArrow.pre X K F))) - CategoryTheory.Limits.Cone.toStructuredArrowCone_pt 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {K : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone K) (F : CategoryTheory.Functor C D) {X : D} (f : X ⟶ F.obj c.pt) : (c.toStructuredArrowCone F f).pt = CategoryTheory.StructuredArrow.mk f - CategoryTheory.Limits.Cone.mapConeToUnder_hom_hom 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : c.mapConeToUnder.hom.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.Limits.Cone.mapConeToUnder_inv_hom 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : c.mapConeToUnder.inv.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.Limits.Cone.toStructuredArrowCone_π_app 📋 Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u₃} [CategoryTheory.Category.{v₃, u₃} C] {D : Type u₄} [CategoryTheory.Category.{v₄, u₄} D] {K : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone K) (F : CategoryTheory.Functor C D) {X : D} (f : X ⟶ F.obj c.pt) (j : J) : (c.toStructuredArrowCone F f).π.app j = CategoryTheory.StructuredArrow.homMk (c.π.app j) ⋯ - CategoryTheory.Limits.isLimitMapConeForkEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Equalizers
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] (G : CategoryTheory.Functor C D) {X Y Z : C} {f g : X ⟶ Y} {h : Z ⟶ X} (w : CategoryTheory.CategoryStruct.comp h f = CategoryTheory.CategoryStruct.comp h g) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.Fork.ofι h w)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fork.ofι (G.map h) ⋯) - CategoryTheory.Limits.KernelFork.isLimitMapConeEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Kernels
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasZeroMorphisms C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Limits.HasZeroMorphisms D] {X Y : C} {f : X ⟶ Y} (c : CategoryTheory.Limits.KernelFork f) (G : CategoryTheory.Functor C D) [G.PreservesZeroMorphisms] : CategoryTheory.Limits.IsLimit (G.mapCone c) ≃ CategoryTheory.Limits.IsLimit (c.map G) - CategoryTheory.Limits.isLimitMapConeForkEquiv' 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Kernels
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Limits.HasZeroMorphisms C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Limits.HasZeroMorphisms D] (G : CategoryTheory.Functor C D) [G.PreservesZeroMorphisms] {X Y Z : C} {f : X ⟶ Y} {h : Z ⟶ X} (w : CategoryTheory.CategoryStruct.comp h f = 0) : CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Limits.KernelFork.ofι h w)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.KernelFork.ofι (G.map h) ⋯) - CategoryTheory.Abelian.isLimitMapConeOfKernelForkOfι 📋 Mathlib.CategoryTheory.Abelian.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Abelian C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] [CategoryTheory.Limits.HasZeroMorphisms D] {X Y : D} (i : X ⟶ Y) [CategoryTheory.Limits.HasCokernel i] (F : CategoryTheory.Functor D C) [F.PreservesZeroMorphisms] [CategoryTheory.Mono (F.map i)] [CategoryTheory.Limits.PreservesColimit (CategoryTheory.Limits.parallelPair i 0) F] : CategoryTheory.Limits.IsLimit (F.mapCone (CategoryTheory.Limits.KernelFork.ofι i ⋯)) - CategoryTheory.ShortComplex.isLimitπ₁MapConeLimitCone 📋 Mathlib.Algebra.Homology.ShortComplex.Limits
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Limits.HasZeroMorphisms C] (F : CategoryTheory.Functor J (CategoryTheory.ShortComplex C)) [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₁)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₂)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₃)] : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₁.mapCone (CategoryTheory.ShortComplex.limitCone F)) - CategoryTheory.ShortComplex.isLimitπ₂MapConeLimitCone 📋 Mathlib.Algebra.Homology.ShortComplex.Limits
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Limits.HasZeroMorphisms C] (F : CategoryTheory.Functor J (CategoryTheory.ShortComplex C)) [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₁)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₂)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₃)] : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₂.mapCone (CategoryTheory.ShortComplex.limitCone F)) - CategoryTheory.ShortComplex.isLimitπ₃MapConeLimitCone 📋 Mathlib.Algebra.Homology.ShortComplex.Limits
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Limits.HasZeroMorphisms C] (F : CategoryTheory.Functor J (CategoryTheory.ShortComplex C)) [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₁)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₂)] [CategoryTheory.Limits.HasLimit (F.comp CategoryTheory.ShortComplex.π₃)] : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₃.mapCone (CategoryTheory.ShortComplex.limitCone F)) - CategoryTheory.ShortComplex.isLimitOfIsLimitπ 📋 Mathlib.Algebra.Homology.ShortComplex.Limits
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] [CategoryTheory.Limits.HasZeroMorphisms C] {F : CategoryTheory.Functor J (CategoryTheory.ShortComplex C)} (c : CategoryTheory.Limits.Cone F) (h₁ : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₁.mapCone c)) (h₂ : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₂.mapCone c)) (h₃ : CategoryTheory.Limits.IsLimit (CategoryTheory.ShortComplex.π₃.mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Functor.isLimitMapConeBinaryFanOfPreservesKernels 📋 Mathlib.CategoryTheory.Preadditive.LeftExact
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Preadditive C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] [CategoryTheory.Preadditive D] (F : CategoryTheory.Functor C D) [F.PreservesZeroMorphisms] {X Y Z : C} (π₁ : Z ⟶ X) (π₂ : Z ⟶ Y) [CategoryTheory.Limits.PreservesLimit (CategoryTheory.Limits.parallelPair π₂ 0) F] (i : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.BinaryFan.mk π₁ π₂)) : CategoryTheory.Limits.IsLimit (F.mapCone (CategoryTheory.Limits.BinaryFan.mk π₁ π₂)) - CategoryTheory.Comonad.ForgetCreatesLimits'.lambda 📋 Mathlib.CategoryTheory.Monad.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type u} [CategoryTheory.Category.{v, u} J] {T : CategoryTheory.Comonad C} {D : CategoryTheory.Functor J T.Coalgebra} (c : CategoryTheory.Limits.Cone (D.comp T.forget)) (t : CategoryTheory.Limits.IsLimit c) [CategoryTheory.Limits.PreservesLimit (D.comp T.forget) T.toFunctor] : c.pt ⟶ (T.mapCone c).pt - CategoryTheory.Comonad.ForgetCreatesLimits'.conePoint_a 📋 Mathlib.CategoryTheory.Monad.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type u} [CategoryTheory.Category.{v, u} J] {T : CategoryTheory.Comonad C} {D : CategoryTheory.Functor J T.Coalgebra} (c : CategoryTheory.Limits.Cone (D.comp T.forget)) (t : CategoryTheory.Limits.IsLimit c) [CategoryTheory.Limits.PreservesLimit (D.comp T.forget) T.toFunctor] [CategoryTheory.Limits.PreservesLimit ((D.comp T.forget).comp T.toFunctor) T.toFunctor] : (CategoryTheory.Comonad.ForgetCreatesLimits'.conePoint c t).a = CategoryTheory.Comonad.ForgetCreatesLimits'.lambda c t - CategoryTheory.Monad.ForgetCreatesLimits.liftedConeIsLimit_lift_f 📋 Mathlib.CategoryTheory.Monad.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {T : CategoryTheory.Monad C} {J : Type u} [CategoryTheory.Category.{v, u} J] (D : CategoryTheory.Functor J T.Algebra) (c : CategoryTheory.Limits.Cone (D.comp T.forget)) (t : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone D) : ((CategoryTheory.Monad.ForgetCreatesLimits.liftedConeIsLimit D c t).lift s).f = t.lift (T.forget.mapCone s) - CategoryTheory.Comonad.ForgetCreatesLimits'.liftedConeIsLimit_lift_f 📋 Mathlib.CategoryTheory.Monad.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type u} [CategoryTheory.Category.{v, u} J] {T : CategoryTheory.Comonad C} {D : CategoryTheory.Functor J T.Coalgebra} (c : CategoryTheory.Limits.Cone (D.comp T.forget)) (t : CategoryTheory.Limits.IsLimit c) [CategoryTheory.Limits.PreservesLimit (D.comp T.forget) T.toFunctor] [CategoryTheory.Limits.PreservesLimit ((D.comp T.forget).comp T.toFunctor) T.toFunctor] (s : CategoryTheory.Limits.Cone D) : ((CategoryTheory.Comonad.ForgetCreatesLimits'.liftedConeIsLimit c t).lift s).f = t.lift (T.forget.mapCone s) - CategoryTheory.Comonad.ForgetCreatesLimits'.commuting 📋 Mathlib.CategoryTheory.Monad.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {J : Type u} [CategoryTheory.Category.{v, u} J] {T : CategoryTheory.Comonad C} {D : CategoryTheory.Functor J T.Coalgebra} (c : CategoryTheory.Limits.Cone (D.comp T.forget)) (t : CategoryTheory.Limits.IsLimit c) [CategoryTheory.Limits.PreservesLimit (D.comp T.forget) T.toFunctor] (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Comonad.ForgetCreatesLimits'.lambda c t) (T.map (c.π.app j)) = CategoryTheory.CategoryStruct.comp (c.π.app j) (D.obj j).a - HomologicalComplex.isLimitOfEval 📋 Mathlib.Algebra.Homology.HomologicalComplexLimits
{C : Type u_1} {ι : Type u_2} {J : Type u_3} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_3} J] {c : ComplexShape ι} [CategoryTheory.Limits.HasZeroMorphisms C] (F : CategoryTheory.Functor J (HomologicalComplex C c)) (s : CategoryTheory.Limits.Cone F) (hs : (i : ι) → CategoryTheory.Limits.IsLimit ((HomologicalComplex.eval C c i).mapCone s)) : CategoryTheory.Limits.IsLimit s - PresheafOfModules.evaluationJointlyReflectsLimits 📋 Mathlib.Algebra.Category.ModuleCat.Presheaf.Limits
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {R : CategoryTheory.Functor Cᵒᵖ RingCat} {J : Type u₂} [CategoryTheory.Category.{v₂, u₂} J] (F : CategoryTheory.Functor J (PresheafOfModules R)) [∀ (X : Cᵒᵖ), Small.{v, max u₂ v} ↑((F.comp (PresheafOfModules.evaluation R X)).comp (CategoryTheory.forget (ModuleCat ↑(R.obj X)))).sections] (c : CategoryTheory.Limits.Cone F) (hc : (X : Cᵒᵖ) → CategoryTheory.Limits.IsLimit ((PresheafOfModules.evaluation R X).mapCone c)) : CategoryTheory.Limits.IsLimit c - CategoryTheory.Presheaf.isLimit_iff_isSheafFor 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (P : CategoryTheory.Functor Cᵒᵖ A) {X : C} (S : CategoryTheory.Sieve X) : Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone S.arrows.cocone.op)) ↔ ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSheafFor (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows - CategoryTheory.Presheaf.isSheaf_iff_isLimit 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (J : CategoryTheory.GrothendieckTopology C) (P : CategoryTheory.Functor Cᵒᵖ A) : CategoryTheory.Presheaf.IsSheaf J P ↔ ∀ ⦃X : C⦄, ∀ S ∈ J X, Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone S.arrows.cocone.op)) - CategoryTheory.Presheaf.isLimit_iff_isSheafFor_presieve 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (P : CategoryTheory.Functor Cᵒᵖ A) {X : C} (R : CategoryTheory.Presieve X) : Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.generate R).arrows.cocone.op)) ↔ ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSheafFor (P.comp (CategoryTheory.coyoneda.obj E)) R - CategoryTheory.Presheaf.isSheaf_iff_isLimit_pretopology 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (P : CategoryTheory.Functor Cᵒᵖ A) [CategoryTheory.Limits.HasPullbacks C] (K : CategoryTheory.Pretopology C) : CategoryTheory.Presheaf.IsSheaf K.toGrothendieck P ↔ ∀ ⦃X : C⦄, ∀ R ∈ K.coverings X, Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.generate R).arrows.cocone.op)) - CategoryTheory.Presheaf.isSheafForIsSheafFor' 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] [CategoryTheory.Limits.HasProducts A] [CategoryTheory.Limits.HasPullbacks C] (P : CategoryTheory.Functor Cᵒᵖ A) (s : CategoryTheory.Functor A (Type (max v₁ u₁))) [∀ (J : Type (max v₁ u₁)), CategoryTheory.Limits.PreservesLimitsOfShape (CategoryTheory.Discrete J) s] (U : C) (R : CategoryTheory.Presieve U) : CategoryTheory.Limits.IsLimit (s.mapCone (CategoryTheory.Limits.Fork.ofι (CategoryTheory.Presheaf.forkMap R P) ⋯)) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fork.ofι (CategoryTheory.Equalizer.forkMap (P.comp s) R) ⋯) - CategoryTheory.Presheaf.subsingleton_iff_isSeparatedFor 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (P : CategoryTheory.Functor Cᵒᵖ A) {X : C} (S : CategoryTheory.Sieve X) : (∀ (c : CategoryTheory.Limits.Cone (S.arrows.diagram.op.comp P)), Subsingleton (c ⟶ P.mapCone S.arrows.cocone.op)) ↔ ∀ (E : Aᵒᵖ), CategoryTheory.Presieve.IsSeparatedFor (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows - CategoryTheory.Presheaf.homEquivAmalgamation 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] {P : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} {E : Aᵒᵖ} {x : CategoryTheory.Presieve.FamilyOfElements (P.comp (CategoryTheory.coyoneda.obj E)) S.arrows} (hx : x.SieveCompatible) : (hx.cone ⟶ P.mapCone S.arrows.cocone.op) ≃ { t // x.IsAmalgamation t } - CategoryTheory.Presheaf.isSeparated_iff_subsingleton 📋 Mathlib.CategoryTheory.Sites.Sheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] (J : CategoryTheory.GrothendieckTopology C) (P : CategoryTheory.Functor Cᵒᵖ A) : (∀ (E : A), CategoryTheory.Presieve.IsSeparated J (P.comp (CategoryTheory.coyoneda.obj (Opposite.op E)))) ↔ ∀ ⦃X : C⦄, ∀ S ∈ J X, ∀ (c : CategoryTheory.Limits.Cone (S.arrows.diagram.op.comp P)), Subsingleton (c ⟶ P.mapCone S.arrows.cocone.op) - CategoryTheory.GrothendieckTopology.Cover.mapMultifork 📋 Mathlib.CategoryTheory.Sites.Whiskering
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {A : Type u₂} [CategoryTheory.Category.{v₂, u₂} A] {B : Type u₃} [CategoryTheory.Category.{v₃, u₃} B] {J : CategoryTheory.GrothendieckTopology C} (F : CategoryTheory.Functor A B) (P : CategoryTheory.Functor Cᵒᵖ A) {X : C} (S : J.Cover X) : F.mapCone (S.multifork P) ≅ (CategoryTheory.Limits.Cone.postcompose (CategoryTheory.GrothendieckTopology.Cover.multicospanComp F P S).hom).obj (S.multifork (P.comp F)) - CategoryTheory.Limits.colimitLimitToLimitColimitCone 📋 Mathlib.CategoryTheory.Limits.ColimitLimit
{J : Type u₁} {K : Type u₂} [CategoryTheory.Category.{v₁, u₁} J] [CategoryTheory.Category.{v₂, u₂} K] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfShape J C] [CategoryTheory.Limits.HasColimitsOfShape K C] (G : CategoryTheory.Functor J (CategoryTheory.Functor K C)) [CategoryTheory.Limits.HasLimit G] : CategoryTheory.Limits.colim.mapCone (CategoryTheory.Limits.limit.cone G) ⟶ CategoryTheory.Limits.limit.cone (G.comp CategoryTheory.Limits.colim) - CategoryTheory.Limits.colimitLimitToLimitColimitCone_hom 📋 Mathlib.CategoryTheory.Limits.ColimitLimit
{J : Type u₁} {K : Type u₂} [CategoryTheory.Category.{v₁, u₁} J] [CategoryTheory.Category.{v₂, u₂} K] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfShape J C] [CategoryTheory.Limits.HasColimitsOfShape K C] (G : CategoryTheory.Functor J (CategoryTheory.Functor K C)) [CategoryTheory.Limits.HasLimit G] : (CategoryTheory.Limits.colimitLimitToLimitColimitCone G).hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colim.map (CategoryTheory.Limits.limitIsoSwapCompLim G).hom) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimitLimitToLimitColimit (CategoryTheory.Functor.uncurry.obj G)) (CategoryTheory.Limits.lim.map (CategoryTheory.Functor.whiskerRight (CategoryTheory.Functor.currying.unitIso.app G).inv CategoryTheory.Limits.colim))) - CategoryTheory.Limits.colimitLimitToLimitColimitCone_iso 📋 Mathlib.CategoryTheory.Limits.FilteredColimitCommutesFiniteLimit
{J : Type u₁} {K : Type u₂} [CategoryTheory.SmallCategory J] [CategoryTheory.Category.{v₂, u₂} K] [Small.{v, u₂} K] [CategoryTheory.FinCategory J] [CategoryTheory.IsFiltered K] (F : CategoryTheory.Functor J (CategoryTheory.Functor K (Type v))) : CategoryTheory.IsIso (CategoryTheory.Limits.colimitLimitToLimitColimitCone F) - TopCat.nonempty_isLimit_iff_eq_induced 📋 Mathlib.Topology.Category.TopCat.Limits.Basic
{J : Type v} [CategoryTheory.Category.{w, v} J] {F : CategoryTheory.Functor J TopCat} (c : CategoryTheory.Limits.Cone F) (hc : CategoryTheory.Limits.IsLimit ((CategoryTheory.forget TopCat).mapCone c)) : Nonempty (CategoryTheory.Limits.IsLimit c) ↔ c.pt.str = ⨅ j, TopologicalSpace.induced (⇑(CategoryTheory.ConcreteCategory.hom (c.π.app j))) (F.obj j).str - CategoryTheory.PreservesFiniteLimitsOfFlat.fac 📋 Mathlib.CategoryTheory.Functor.Flat
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type v₁} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] {K : CategoryTheory.Functor J C} (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone (K.comp F)) (x : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PreservesFiniteLimitsOfFlat.lift F hc s) ((F.mapCone c).π.app x) = s.π.app x - CategoryTheory.PreservesFiniteLimitsOfFlat.uniq 📋 Mathlib.CategoryTheory.Functor.Flat
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {J : Type v₁} [CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {K : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cone K} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone (K.comp F)) (f₁ f₂ : s.pt ⟶ F.obj c.pt) (h₁ : ∀ (j : J), CategoryTheory.CategoryStruct.comp f₁ ((F.mapCone c).π.app j) = s.π.app j) (h₂ : ∀ (j : J), CategoryTheory.CategoryStruct.comp f₂ ((F.mapCone c).π.app j) = s.π.app j) : f₁ = f₂ - CategoryTheory.Functor.RightExtension.coneAtWhiskerRightIso 📋 Mathlib.CategoryTheory.Functor.KanExtension.Preserves
{A : Type u_1} {B : Type u_2} {C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_2, u_2} B] [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (G : CategoryTheory.Functor B D) (F : CategoryTheory.Functor A B) (L : CategoryTheory.Functor A C) (E : L.RightExtension F) (c : C) : ((CategoryTheory.Functor.RightExtension.postcompose₂ L F G).obj E).coneAt c ≅ G.mapCone (E.coneAt c) - CategoryTheory.Functor.RightExtension.coneAtWhiskerRightIso_hom_hom 📋 Mathlib.CategoryTheory.Functor.KanExtension.Preserves
{A : Type u_1} {B : Type u_2} {C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_2, u_2} B] [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (G : CategoryTheory.Functor B D) (F : CategoryTheory.Functor A B) (L : CategoryTheory.Functor A C) (E : L.RightExtension F) (c : C) : (CategoryTheory.Functor.RightExtension.coneAtWhiskerRightIso G F L E c).hom.hom = CategoryTheory.CategoryStruct.id (G.obj (E.left.obj c)) - CategoryTheory.Functor.RightExtension.coneAtWhiskerRightIso_inv_hom 📋 Mathlib.CategoryTheory.Functor.KanExtension.Preserves
{A : Type u_1} {B : Type u_2} {C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_1, u_1} A] [CategoryTheory.Category.{v_2, u_2} B] [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] (G : CategoryTheory.Functor B D) (F : CategoryTheory.Functor A B) (L : CategoryTheory.Functor A C) (E : L.RightExtension F) (c : C) : (CategoryTheory.Functor.RightExtension.coneAtWhiskerRightIso G F L E c).inv.hom = CategoryTheory.CategoryStruct.id (G.obj (E.left.obj c)) - CategoryTheory.Presheaf.isSheaf_iff_isLimit_coverage 📋 Mathlib.CategoryTheory.Sites.Coverage
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (K : CategoryTheory.Coverage C) (P : CategoryTheory.Functor Cᵒᵖ D) : CategoryTheory.Presheaf.IsSheaf K.toGrothendieck P ↔ ∀ ⦃X : C⦄, ∀ R ∈ K.coverings X, Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.generate R).arrows.cocone.op)) - CategoryTheory.CostructuredArrow.CreatesConnected.mapCone_raiseCone 📋 Mathlib.CategoryTheory.Limits.Constructions.Over.Connected
{J : Type u'} [CategoryTheory.Category.{v', u'} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {K : CategoryTheory.Functor C D} [CategoryTheory.IsConnected J] {B : D} {F : CategoryTheory.Functor J (CategoryTheory.CostructuredArrow K B)} (c : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.CostructuredArrow.proj K B))) : (CategoryTheory.CostructuredArrow.proj K B).mapCone (CategoryTheory.CostructuredArrow.CreatesConnected.raiseCone c) = c - TopCat.Presheaf.IsSheaf.isSheafOpensLeCover 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} {F : TopCat.Presheaf C X} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (h : F.IsSheaf) : Nonempty (CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op)) - TopCat.Presheaf.isLimitOpensLeEquivGenerate₁ 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {Y : TopologicalSpace.Opens ↑X} (hY : Y = iSup U) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Sieve.generate (TopCat.Presheaf.presieveOfCoveringAux U Y)).arrows.cocone.op) - TopCat.Presheaf.isLimitOpensLeEquivGenerate₂ 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {Y : TopologicalSpace.Opens ↑X} (R : CategoryTheory.Presieve Y) (hR : CategoryTheory.Sieve.generate R ∈ (Opens.grothendieckTopology ↑X) Y) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone (TopCat.Presheaf.coveringOfPresieve Y R)).op) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Sieve.generate R).arrows.cocone.op) - TopCat.Presheaf.whiskerIsoMapGenerateCocone 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {Y : TopologicalSpace.Opens ↑X} (hY : Y = iSup U) : CategoryTheory.Limits.Cone.whisker (TopCat.Presheaf.generateEquivalenceOpensLe U hY).op.functor (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op) ≅ CategoryTheory.Functor.mapCone F (CategoryTheory.Sieve.generate (TopCat.Presheaf.presieveOfCoveringAux U Y)).arrows.cocone.op - TopCat.Presheaf.whiskerIsoMapGenerateCocone_hom_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {Y : TopologicalSpace.Opens ↑X} (hY : Y = iSup U) : (F.whiskerIsoMapGenerateCocone U hY).hom.hom = F.map (CategoryTheory.eqToHom ⋯) - TopCat.Presheaf.whiskerIsoMapGenerateCocone_inv_hom 📋 Mathlib.Topology.Sheaves.SheafCondition.OpensLeCover
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) {Y : TopologicalSpace.Opens ↑X} (hY : Y = iSup U) : (F.whiskerIsoMapGenerateCocone U hY).inv.hom = F.map (CategoryTheory.eqToHom ⋯) - TopCat.Presheaf.IsSheaf.isSheafPairwiseIntersections 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} {F : TopCat.Presheaf C X} {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) (h : F.IsSheaf) : Nonempty (CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op)) - TopCat.Presheaf.isLimitOpensLeCoverEquivPairwise 📋 Mathlib.Topology.Sheaves.SheafCondition.PairwiseIntersections
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type u_2} (U : ι → TopologicalSpace.Opens ↑X) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (TopCat.Presheaf.SheafCondition.opensLeCoverCocone U).op) ≃ CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op) - TopCat.Presheaf.isGluing_iff_pairwise 📋 Mathlib.Topology.Sheaves.SheafCondition.UniqueGluing
{X : TopCat} {F : TopCat.Presheaf (Type u_4) X} {ι : Type u_5} {U : ι → TopologicalSpace.Opens ↑X} {sf : (i : ι) → CategoryTheory.ToType (F.obj (Opposite.op (U i)))} {s : CategoryTheory.ToType (F.obj (Opposite.op (iSup U)))} : F.IsGluing U sf s ↔ ∀ (i : (CategoryTheory.Pairwise ι)ᵒᵖ), (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op).π.app i)) s = TopCat.Presheaf.objPairwiseOfFamily sf i - CommRingCat.Under.piFanTensorProductIsLimit 📋 Mathlib.Algebra.Category.Ring.Under.Limits
{R S : CommRingCat} [Algebra ↑R ↑S] {ι : Type u} (P : ι → CategoryTheory.Under R) [Finite ι] : CategoryTheory.Limits.IsLimit ((R.tensorProd S).mapCone (CommRingCat.Under.piFan P)) - CommRingCat.Under.tensorProdMapEqualizerForkIsLimit 📋 Mathlib.Algebra.Category.Ring.Under.Limits
{R S : CommRingCat} [Algebra ↑R ↑S] [Module.Flat ↑R ↑S] {A B : CategoryTheory.Under R} (f g : A ⟶ B) : CategoryTheory.Limits.IsLimit ((R.tensorProd S).mapCone (CommRingCat.Under.equalizerFork f g)) - CategoryTheory.Functor.regularEpiOfPreserves_isColimit 📋 Mathlib.CategoryTheory.EffectiveEpi.Preserves
{C : Type u_3} {D : Type u_4} [CategoryTheory.Category.{v_3, u_3} C] [CategoryTheory.Category.{v_4, u_4} D] {X Y : C} (f : X ⟶ Y) [CategoryTheory.EffectiveEpi f] (F : CategoryTheory.Functor C D) [F.PreservesEffectiveEpis] [CategoryTheory.Limits.PreservesLimitsOfShape CategoryTheory.Limits.WalkingCospan F] (c : CategoryTheory.Limits.PullbackCone f f) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Functor.regularEpiOfPreserves f F c hc).isColimit = CategoryTheory.isColimitCoforkOfEffectiveEpi (F.map f) (CategoryTheory.Limits.PullbackCone.mk (F.map c.fst) (F.map c.snd) ⋯) ((CategoryTheory.Limits.IsLimit.equivOfNatIsoOfIso (CategoryTheory.Limits.cospanIsoMk (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.one)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.left)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.right)) ⋯ ⋯) (F.mapCone c) (CategoryTheory.Limits.PullbackCone.mk (F.map c.fst) (F.map c.snd) ⋯) (CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Limits.Cone.postcompose (CategoryTheory.Limits.cospanIsoMk (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.one)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.left)) (CategoryTheory.Iso.refl (((CategoryTheory.Limits.cospan f f).comp F).obj CategoryTheory.Limits.WalkingCospan.right)) ⋯ ⋯).hom).obj (F.mapCone c)).pt) ⋯)) (CategoryTheory.Limits.isLimitOfPreserves F hc)) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.isValidLift 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : (CategoryTheory.CategoryOfElements.π A).mapCone (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F) ≅ CategoryTheory.Limits.limit.cone (F.comp (CategoryTheory.CategoryOfElements.π A)) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.map_lift_mapCone 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.ConcreteCategory.hom (A.map (CategoryTheory.Limits.limit.lift (F.comp (CategoryTheory.CategoryOfElements.π A)) ((CategoryTheory.CategoryOfElements.π A).mapCone c)))) c.pt.snd = CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement F - FundamentalGroupoidFunctor.coneDiscreteComp_obj_mapCone 📋 Mathlib.AlgebraicTopology.FundamentalGroupoid.Product
{I : Type u} (X : I → TopCat) : (FundamentalGroupoidFunctor.coneDiscreteComp X).functor.obj (FundamentalGroupoid.fundamentalGroupoidFunctor.mapCone (TopCat.piFan X)) = CategoryTheory.Limits.Fan.mk (FundamentalGroupoid.fundamentalGroupoidFunctor.obj (TopCat.of ((i : I) → ↑(X i)))) (FundamentalGroupoidFunctor.proj X) - CategoryTheory.Limits.Multifork.isLimitMapEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Multiequalizer
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {J : CategoryTheory.Limits.MulticospanShape} {d : CategoryTheory.Limits.MulticospanIndex J C} (c : CategoryTheory.Limits.Multifork d) (F : CategoryTheory.Functor C D) : CategoryTheory.Limits.IsLimit (F.mapCone c) ≃ CategoryTheory.Limits.IsLimit (c.map F) - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) : CategoryTheory.Limits.IsColimit (c.pt.mapCocone cX) - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone.surjective 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) (x : c.pt.obj cX.pt) : ∃ j x', x = (CategoryTheory.ConcreteCategory.hom ((c.pt.mapCocone cX).ι.app j)) x' - CategoryTheory.Functor.Accessible.Limits.isColimitMapCocone.injective 📋 Mathlib.CategoryTheory.Presentable.Limits
{C : Type u} [CategoryTheory.Category.{v, u} C] {K : Type u'} [CategoryTheory.Category.{v', u'} K] {F : CategoryTheory.Functor K (CategoryTheory.Functor C (Type w'))} (c : CategoryTheory.Limits.Cone F) (hc : (Y : C) → CategoryTheory.Limits.IsLimit (((CategoryTheory.evaluation C (Type w')).obj Y).mapCone c)) (κ : Cardinal.{w}) [Fact κ.IsRegular] (hK : HasCardinalLT (CategoryTheory.Arrow K) κ) {J : Type w} [CategoryTheory.SmallCategory J] [CategoryTheory.IsCardinalFiltered J κ] {X : CategoryTheory.Functor J C} (cX : CategoryTheory.Limits.Cocone X) (hF : (k : K) → CategoryTheory.Limits.IsColimit ((F.obj k).mapCocone cX)) (j : J) (x₁ x₂ : c.pt.obj (X.obj j)) (h : (CategoryTheory.ConcreteCategory.hom (c.pt.map (cX.ι.app j))) x₁ = (CategoryTheory.ConcreteCategory.hom (c.pt.map (cX.ι.app j))) x₂) : ∃ j' α, (CategoryTheory.ConcreteCategory.hom (c.pt.map (X.map α))) x₁ = (CategoryTheory.ConcreteCategory.hom (c.pt.map (X.map α))) x₂ - CategoryTheory.JointlyReflectIsomorphisms.jointlyReflectsLimit 📋 Mathlib.CategoryTheory.Functor.ReflectsIso.Limits
{C : Type u_1} [CategoryTheory.Category.{u_5, u_1} C] {I : Type u_2} {D : I → Type u_3} [(i : I) → CategoryTheory.Category.{u_6, u_3} (D i)] {F : (i : I) → CategoryTheory.Functor C (D i)} (hF : CategoryTheory.JointlyReflectIsomorphisms F) {J : Type u_4} [CategoryTheory.Category.{v_1, u_4} J] {G : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.Cone G} (hc : (i : I) → CategoryTheory.Limits.IsLimit ((F i).mapCone c)) [CategoryTheory.Limits.HasLimit G] [∀ (i : I), CategoryTheory.Limits.PreservesLimit G (F i)] : CategoryTheory.Limits.IsLimit c - CategoryTheory.Limits.FormalCoproduct.isLimitEvalMapConeCofanOp 📋 Mathlib.CategoryTheory.Limits.FormalCoproducts.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u₁} [CategoryTheory.Category.{v₁, u₁} A] [CategoryTheory.Limits.HasProducts A] (J : Type w) (f : J → CategoryTheory.Limits.FormalCoproduct C) (F : CategoryTheory.Functor Cᵒᵖ A) : CategoryTheory.Limits.IsLimit (((CategoryTheory.Limits.FormalCoproduct.evalOp C A).obj F).mapCone (CategoryTheory.Limits.FormalCoproduct.cofan J f).op) - CategoryTheory.Limits.pointwiseBinaryBicone.isBilimit_isLimit 📋 Mathlib.CategoryTheory.Limits.FunctorCategory.BinaryBiproducts
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasZeroMorphisms C] [CategoryTheory.Limits.HasBinaryBiproducts C] {D : Type u_2} [CategoryTheory.Category.{v_2, u_2} D] (F G : CategoryTheory.Functor D C) : (CategoryTheory.Limits.pointwiseBinaryBicone.isBilimit F G).isLimit = CategoryTheory.Limits.evaluationJointlyReflectsLimits (CategoryTheory.Limits.pointwiseBinaryBicone F G).toCone fun d => (CategoryTheory.Limits.IsLimit.equivOfNatIsoOfIso (CategoryTheory.Limits.pairComp F G ((CategoryTheory.evaluation D C).obj d)).symm (CategoryTheory.Limits.BinaryBiproduct.bicone (F.obj d) (G.obj d)).toCone (((CategoryTheory.evaluation D C).obj d).mapCone (CategoryTheory.Limits.pointwiseBinaryBicone F G).toCone) (CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Limits.Cone.postcompose (CategoryTheory.Limits.pairComp F G ((CategoryTheory.evaluation D C).obj d)).symm.hom).obj (CategoryTheory.Limits.BinaryBiproduct.bicone (F.obj d) (G.obj d)).toCone).pt) ⋯)) (CategoryTheory.Limits.BinaryBiproduct.isLimit (F.obj d) (G.obj d)) - CategoryTheory.Presheaf.nonempty_isLimit_mapCone_iff 📋 Mathlib.CategoryTheory.Limits.Types.PreservesLimit
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u'} [CategoryTheory.Category.{v', u'} J] [CategoryTheory.LocallySmall.{w, v, u} C] {F : CategoryTheory.Functor J Cᵒᵖ} (c : CategoryTheory.Limits.Cone F) {c' : CategoryTheory.Limits.Cocone (F.leftOp.comp CategoryTheory.shrinkYoneda.{w, v, u})} (hc' : CategoryTheory.Limits.IsColimit c') (P : CategoryTheory.Functor Cᵒᵖ (Type w)) : Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone c)) ↔ (CategoryTheory.MorphismProperty.single (CategoryTheory.Presheaf.coconePtToShrinkYoneda c hc')).isLocal P - CategoryTheory.Presheaf.coconePtToShrinkYoneda_comp 📋 Mathlib.CategoryTheory.Limits.Types.PreservesLimit
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u'} [CategoryTheory.Category.{v', u'} J] [CategoryTheory.LocallySmall.{w, v, u} C] {F : CategoryTheory.Functor J Cᵒᵖ} (c : CategoryTheory.Limits.Cone F) {c' : CategoryTheory.Limits.Cocone (F.leftOp.comp CategoryTheory.shrinkYoneda.{w, v, u})} (hc' : CategoryTheory.Limits.IsColimit c') {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (x : P.obj c.pt) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.coconePtToShrinkYoneda c hc') (CategoryTheory.shrinkYonedaEquiv.symm x) = (CategoryTheory.Presheaf.coconeCompShrinkYonedaHomEquiv hc').symm (CategoryTheory.Limits.Types.sectionOfCone (P.mapCone c) x) - CategoryTheory.Presheaf.coconePtToShrinkYoneda_comp_assoc 📋 Mathlib.CategoryTheory.Limits.Types.PreservesLimit
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : Type u'} [CategoryTheory.Category.{v', u'} J] [CategoryTheory.LocallySmall.{w, v, u} C] {F : CategoryTheory.Functor J Cᵒᵖ} (c : CategoryTheory.Limits.Cone F) {c' : CategoryTheory.Limits.Cocone (F.leftOp.comp CategoryTheory.shrinkYoneda.{w, v, u})} (hc' : CategoryTheory.Limits.IsColimit c') {P : CategoryTheory.Functor Cᵒᵖ (Type w)} (x : P.obj c.pt) {Z : CategoryTheory.Functor Cᵒᵖ (Type w)} (h : P ⟶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.coconePtToShrinkYoneda c hc') (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaEquiv.symm x) h) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.coconeCompShrinkYonedaHomEquiv hc').symm (CategoryTheory.Limits.Types.sectionOfCone (P.mapCone c) x)) h - CategoryTheory.Localization.HasProductsOfShapeAux.isLimitMapCone 📋 Mathlib.CategoryTheory.Localization.FiniteProducts
{C : Type u₁} {D : Type u₂} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.Category.{v₂, u₂} D] (L : CategoryTheory.Functor C D) (W : CategoryTheory.MorphismProperty C) [L.IsLocalization W] (J : Type) [CategoryTheory.Limits.HasProductsOfShape J C] [W.IsStableUnderProductsOfShape J] [W.ContainsIdentities] [Finite J] (F : CategoryTheory.Functor (CategoryTheory.Discrete J) C) : CategoryTheory.Limits.IsLimit (L.mapCone (CategoryTheory.Limits.limit.cone F)) - CategoryTheory.Mon.forgetMapConeLimitConeIso 📋 Mathlib.CategoryTheory.Monoidal.Internal.Limits
{J : Type w} [CategoryTheory.Category.{v_1, w} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] (F : CategoryTheory.Functor J (CategoryTheory.Mon C)) (c : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Mon.forget C))) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Mon.forget C).mapCone (CategoryTheory.Mon.limitCone F c hc) ≅ c - CategoryTheory.Mon.limitConeIsLimit_lift_hom 📋 Mathlib.CategoryTheory.Monoidal.Internal.Limits
{J : Type w} [CategoryTheory.Category.{v_1, w} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] (F : CategoryTheory.Functor J (CategoryTheory.Mon C)) (c : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Mon.forget C))) (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone F) : ((CategoryTheory.Mon.limitConeIsLimit F c hc).lift s).hom = hc.lift ((CategoryTheory.Mon.forget C).mapCone s) - CategoryTheory.Mon.forgetMapConeLimitConeIso_hom_hom 📋 Mathlib.CategoryTheory.Monoidal.Internal.Limits
{J : Type w} [CategoryTheory.Category.{v_1, w} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] (F : CategoryTheory.Functor J (CategoryTheory.Mon C)) (c : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Mon.forget C))) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Mon.forgetMapConeLimitConeIso F c hc).hom.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.Mon.forgetMapConeLimitConeIso_inv_hom 📋 Mathlib.CategoryTheory.Monoidal.Internal.Limits
{J : Type w} [CategoryTheory.Category.{v_1, w} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] (F : CategoryTheory.Functor J (CategoryTheory.Mon C)) (c : CategoryTheory.Limits.Cone (F.comp (CategoryTheory.Mon.forget C))) (hc : CategoryTheory.Limits.IsLimit c) : (CategoryTheory.Mon.forgetMapConeLimitConeIso F c hc).inv.hom = CategoryTheory.CategoryStruct.id c.pt - CategoryTheory.regularTopology.equalizerConditionMap_iff_nonempty_isLimit 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (P : CategoryTheory.Functor Cᵒᵖ D) ⦃X B : C⦄ (π : X ⟶ B) [CategoryTheory.Limits.HasPullback π π] : CategoryTheory.regularTopology.SingleEqualizerCondition P π ↔ Nonempty (CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.ofArrows (fun x => X) fun x => π).arrows.cocone.op)) - CategoryTheory.regularTopology.isLimit_forkOfι_equiv 📋 Mathlib.CategoryTheory.Sites.Coherent.RegularSheaves
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (P : CategoryTheory.Functor Cᵒᵖ D) {X B : C} (π : X ⟶ B) (c : CategoryTheory.Limits.PullbackCone π π) (hc : CategoryTheory.Limits.IsLimit c) : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.Fork.ofι (P.map π.op) ⋯) ≃ CategoryTheory.Limits.IsLimit (P.mapCone (CategoryTheory.Sieve.ofArrows (fun x => X) fun x => π).arrows.cocone.op) - CategoryTheory.presheafHom_isSheafFor 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] (F G : CategoryTheory.Functor Cᵒᵖ A) {X : C} (S : CategoryTheory.Sieve X) (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) : CategoryTheory.Presieve.IsSheafFor (CategoryTheory.presheafHom F G) S.arrows - CategoryTheory.PresheafHom.IsSheafFor.app 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) {Y : C} (hx : x.Compatible) (g : Y ⟶ X) : F.obj (Opposite.op Y) ⟶ G.obj (Opposite.op Y) - CategoryTheory.PresheafHom.IsSheafFor.app_cond 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) {Y : C} (hx : x.Compatible) (g : Y ⟶ X) {Z : C} (p : Z ⟶ Y) (hp : S.arrows (CategoryTheory.CategoryStruct.comp p g)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.PresheafHom.IsSheafFor.app hG x hx g) (G.map p.op) = CategoryTheory.CategoryStruct.comp (F.map p.op) ((x (CategoryTheory.CategoryStruct.comp p g) hp).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Z)))) - CategoryTheory.PresheafHom.IsSheafFor.exists_app 📋 Mathlib.CategoryTheory.Sites.SheafHom
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : Type u'} [CategoryTheory.Category.{v', u'} A] {F G : CategoryTheory.Functor Cᵒᵖ A} {X : C} {S : CategoryTheory.Sieve X} (hG : ⦃Y : C⦄ → (f : Y ⟶ X) → CategoryTheory.Limits.IsLimit (G.mapCone (CategoryTheory.Sieve.pullback f S).arrows.cocone.op)) (x : CategoryTheory.Presieve.FamilyOfElements (CategoryTheory.presheafHom F G) S.arrows) {Y : C} (hx : x.Compatible) (g : Y ⟶ X) : ∃ φ, ∀ {Z : C} (p : Z ⟶ Y) (hp : S.arrows (CategoryTheory.CategoryStruct.comp p g)), CategoryTheory.CategoryStruct.comp φ (G.map p.op) = CategoryTheory.CategoryStruct.comp (F.map p.op) ((x (CategoryTheory.CategoryStruct.comp p g) hp).app (Opposite.op (CategoryTheory.Over.mk (CategoryTheory.CategoryStruct.id Z)))) - LightProfinite.isoMapCone 📋 Mathlib.Topology.Category.LightProfinite.AsLimit
(S : LightProfinite) : lightToProfinite.mapCone S.asLimitConeAux ≅ S.toLightDiagram.cone - Profinite.Extend.isLimitCone 📋 Mathlib.Topology.Category.Profinite.Extend
{I : Type u} [CategoryTheory.SmallCategory I] [CategoryTheory.IsCofiltered I] {F : CategoryTheory.Functor I FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toProfinite)) {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor Profinite C) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : I), CategoryTheory.Epi (c.π.app i)] (hc' : CategoryTheory.Limits.IsLimit (G.mapCone c)) : CategoryTheory.Limits.IsLimit (Profinite.Extend.cone G c.pt) - LightProfinite.Extend.isLimitCone 📋 Mathlib.Topology.Category.LightProfinite.Extend
{F : CategoryTheory.Functor ℕᵒᵖ FintypeCat} (c : CategoryTheory.Limits.Cone (F.comp FintypeCat.toLightProfinite)) {C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (G : CategoryTheory.Functor LightProfinite C) (hc : CategoryTheory.Limits.IsLimit c) [∀ (i : ℕᵒᵖ), CategoryTheory.Epi (c.π.app i)] (hc' : CategoryTheory.Limits.IsLimit (G.mapCone c)) : CategoryTheory.Limits.IsLimit (LightProfinite.Extend.cone G c.pt) - Condensed.isoFinYoneda_inv_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor Profiniteᵒᵖ (Type (u + 1))) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (a✝ : (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone.pt) : (CategoryTheory.ConcreteCategory.hom ((Condensed.isoFinYoneda F).inv.app X)) a✝ = (CategoryTheory.CategoryStruct.id (F.obj (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt))).hom' ((((CategoryTheory.Limits.IsLimit.postcomposeHomEquiv (CategoryTheory.Discrete.natIso fun j => CategoryTheory.Iso.refl (F.obj (Opposite.op (Profinite.of PUnit.{u + 1})))) (F.mapCone (CategoryTheory.Limits.Fan.mk (Opposite.op (Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).pt) fun a => ((Condensed.fintypeCatAsCofan (Profinite.of (Opposite.unop X).obj)).inj a).op))).symm (CategoryTheory.Limits.isLimitOfPreserves F (CategoryTheory.Limits.Cofan.IsColimit.op (Condensed.fintypeCatAsCofanIsColimit (Profinite.of (Opposite.unop X).obj))))).lift (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (Profinite.of PUnit.{u + 1}))).cone).hom' a✝) - LightCondensed.isoFinYoneda_inv_app_hom_apply 📋 Mathlib.Condensed.Discrete.Colimit
(F : CategoryTheory.Functor LightProfiniteᵒᵖ (Type u)) [CategoryTheory.Limits.PreservesFiniteProducts F] (X : FintypeCatᵒᵖ) (a✝ : (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))).cone.pt) : (CategoryTheory.ConcreteCategory.hom ((LightCondensed.isoFinYoneda F).inv.app X)) a✝ = (CategoryTheory.CategoryStruct.id (F.obj (Opposite.op (LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).pt))).hom' ((((CategoryTheory.Limits.IsLimit.postcomposeHomEquiv (CategoryTheory.Discrete.natIso fun j => CategoryTheory.Iso.refl (F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1})))) (F.mapCone (CategoryTheory.Limits.Fan.mk (Opposite.op (LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).pt) fun a => ((LightCondensed.fintypeCatAsCofan (LightProfinite.of (Opposite.unop X).obj)).inj a).op))).symm (CategoryTheory.Limits.isLimitOfPreserves F (CategoryTheory.Limits.Cofan.IsColimit.op (LightCondensed.fintypeCatAsCofanIsColimit (LightProfinite.of (Opposite.unop X).obj))))).lift (CategoryTheory.Limits.Types.productLimitCone fun x => F.obj (Opposite.op (LightProfinite.of PUnit.{u + 1}))).cone).hom' a✝) - Alexandrov.isLimit 📋 Mathlib.Topology.Sheaves.Alexandrov
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimits C] {X : TopCat} [Preorder ↑X] [Topology.IsUpperSet ↑X] (F : CategoryTheory.Functor (↑X) C) (α : Type v) (Us : α → TopologicalSpace.Opens ↑X) : CategoryTheory.Limits.IsLimit ((Alexandrov.principalsKanExtension F).mapCone (TopCat.Presheaf.SheafCondition.opensLeCoverCocone Us).op) - TopCat.Presheaf.SheafConditionPairwiseIntersections.isLimitMapConeOfIsLimitSheafConditionFork 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (P : CategoryTheory.Limits.IsLimit (TopCat.Presheaf.SheafConditionEqualizerProducts.fork F U)) : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op) - TopCat.Presheaf.SheafConditionPairwiseIntersections.isLimitSheafConditionForkOfIsLimitMapCone 📋 Mathlib.Topology.Sheaves.SheafCondition.EqualizerProducts
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {X : TopCat} (F : TopCat.Presheaf C X) {ι : Type v'} (U : ι → TopologicalSpace.Opens ↑X) (Q : CategoryTheory.Limits.IsLimit (CategoryTheory.Functor.mapCone F (CategoryTheory.Pairwise.cocone U).op)) : CategoryTheory.Limits.IsLimit (TopCat.Presheaf.SheafConditionEqualizerProducts.fork F U)
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