Loogle!
Result
Found 123 declarations mentioning CategoryTheory.uliftYoneda.
- CategoryTheory.uliftYoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.Functor C (CategoryTheory.Functor Cįµįµ (Type (max w vā))) - CategoryTheory.ULiftYoneda.fullyFaithful š Mathlib.CategoryTheory.Yoneda
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.FullyFaithful - CategoryTheory.ULiftYoneda.instFaithfulFunctorOppositeTypeUliftYoneda š Mathlib.CategoryTheory.Yoneda
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.Faithful - CategoryTheory.ULiftYoneda.instFullFunctorOppositeTypeUliftYoneda š Mathlib.CategoryTheory.Yoneda
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.Full - CategoryTheory.Functor.instIsRepresentableObjOppositeTypeUliftYoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} : (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X).IsRepresentable - CategoryTheory.uliftYonedaIsoYoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{max w vā, uā} C] : CategoryTheory.uliftYoneda.{w, max vā w, uā} ā CategoryTheory.yoneda - CategoryTheory.uliftYoneda_obj_obj š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) (Xā : Cįµįµ) : (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X).obj Xā = ULift.{w, vā} (Opposite.unop Xā ā¶ X) - CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (X : C) : F.RepresentableBy X ā (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā F) - CategoryTheory.Functor.uliftYonedaReprXIso š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (F : CategoryTheory.Functor Cįµįµ (Type (max v vā))) [F.IsRepresentable] : CategoryTheory.uliftYoneda.{v, vā, uā}.obj F.reprX ā F - CategoryTheory.uliftYonedaEquiv š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} : (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā¶ F) ā F.obj (Opposite.op X) - CategoryTheory.Functor.FullyFaithful.homNatIso š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) : F.op.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj (F.obj X)) ā CategoryTheory.uliftYoneda.{vā, vā, uā}.obj X - CategoryTheory.uliftYonedaMap š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X ā¶ F.op.comp (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj (F.obj X)) - CategoryTheory.uliftYoneda_obj_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X).map f = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp f.unop x.down } - CategoryTheory.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) : F.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.comp ((CategoryTheory.Functor.whiskeringLeft Cįµįµ Dįµįµ (Type (max vā vā))).obj F.op)) ā CategoryTheory.uliftYoneda.{vā, vā, uā} - CategoryTheory.uliftYonedaIsoYoneda_hom_app_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{max w vā, uā} C] (X : C) (Xā : Cįµįµ) : (CategoryTheory.uliftYonedaIsoYoneda.hom.app X).app Xā = Equiv.ulift.toIso.hom - CategoryTheory.uliftYonedaIsoYoneda_inv_app_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{max w vā, uā} C] (X : C) (Xā : Cįµįµ) : (CategoryTheory.uliftYonedaIsoYoneda.inv.app X).app Xā = Equiv.ulift.toIso.inv - CategoryTheory.hom_ext_uliftYoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {P Q : CategoryTheory.Functor Cįµįµ (Type (max w vā))} {f g : P ā¶ Q} (h : ā (X : C) (p : CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā¶ P), CategoryTheory.CategoryStruct.comp p f = CategoryTheory.CategoryStruct.comp p g) : f = g - CategoryTheory.uliftYonedaMap_app_apply š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) {Y : C} {X : Cįµįµ} (f : Opposite.unop X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.uliftYonedaMap F Y).app X)) { down := f } = { down := F.map f } - CategoryTheory.uliftYonedaOpCompCoyoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.op.comp CategoryTheory.coyoneda ā (CategoryTheory.evaluation Cįµįµ (Type (max vā w))).comp ((CategoryTheory.Functor.whiskeringRight (CategoryTheory.Functor Cįµįµ (Type (max vā w))) (Type (max vā w)) (Type (max (max w uā) vā))).obj CategoryTheory.uliftFunctor.{uā, max vā w}) - CategoryTheory.uliftYoneda_map_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {Xā Yā : C} (f : Xā ā¶ Yā) (X : Cįµįµ) : (CategoryTheory.uliftYoneda.{w, vā, uā}.map f).app X = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp x.down f } - CategoryTheory.Functor.uliftYonedaReprXIso_hom_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (F : CategoryTheory.Functor Cįµįµ (Type (max v vā))) [F.IsRepresentable] (X : Cįµįµ) (f : ULift.{v, vā} (Opposite.unop X ā¶ F.reprX)) : (CategoryTheory.ConcreteCategory.hom (F.uliftYonedaReprXIso.hom.app X)) f = (CategoryTheory.ConcreteCategory.hom (F.map f.down.op)) F.reprx - CategoryTheory.Functor.FullyFaithful.homNatIso_hom_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) : (hF.homNatIso X).hom.app Xā = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.hom - CategoryTheory.Functor.FullyFaithful.homNatIso_inv_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) : (hF.homNatIso X).inv.app Xā = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.inv - CategoryTheory.uliftYonedaEquiv_apply š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (Ļ : CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā¶ F) : CategoryTheory.uliftYonedaEquiv Ļ = (CategoryTheory.ConcreteCategory.hom (Ļ.app (Opposite.op X))) { down := CategoryTheory.CategoryStruct.id X } - CategoryTheory.uliftYonedaEquiv_uliftYoneda_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : C} (f : X ā¶ Y) : CategoryTheory.uliftYonedaEquiv (CategoryTheory.uliftYoneda.{w, vā, uā}.map f) = { down := f } - CategoryTheory.uliftYonedaEquiv_symm_apply_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (x : F.obj (Opposite.op X)) (Y : Cįµįµ) : (CategoryTheory.uliftYonedaEquiv.symm x).app Y = TypeCat.ofHom fun y => (CategoryTheory.ConcreteCategory.hom (F.map y.down.op)) x - CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso_symm_apply_homEquiv š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (X : C) (e : CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā F) {Xā : C} : ((CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso F X).symm e).homEquiv = Equiv.ulift.symm.trans (equivEquivIso.symm (e.app (Opposite.op Xā))) - CategoryTheory.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft_hom_app_app_hom_apply_down š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) (x : (F.op.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj (F.obj X))).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftYonedaCompWhiskeringLeft.hom.app X).app Xā)) x).down = hF.preimage x.down - CategoryTheory.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft_inv_app_app_hom_apply_down š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) (x : (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj X).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftYonedaCompWhiskeringLeft.inv.app X).app Xā)) x).down = F.map x.down - CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso_apply š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (X : C) (R : F.RepresentableBy X) : (CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso F X) R = CategoryTheory.NatIso.ofComponents (fun X_1 => equivEquivIso (Equiv.ulift.trans R.homEquiv)) ⯠- CategoryTheory.uliftYonedaEquiv_comp š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {F G : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (α : CategoryTheory.uliftYoneda.{w, vā, uā}.obj X ā¶ F) (β : F ā¶ G) : CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = (CategoryTheory.ConcreteCategory.hom (β.app (Opposite.op X))) (CategoryTheory.uliftYonedaEquiv α) - CategoryTheory.uliftYonedaEquiv_naturality š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (f : CategoryTheory.uliftYoneda.{w, vā, uā}.obj (Opposite.unop X) ā¶ F) (g : X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.uliftYonedaEquiv f) = CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map g.unop) f) - CategoryTheory.uliftYonedaEquiv_symm_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (t : F.obj X) : CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map f.unop) (CategoryTheory.uliftYonedaEquiv.symm t) - CategoryTheory.uliftYonedaEquiv_symm_comp š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F G : CategoryTheory.Functor Cįµįµ (Type (max w vā))} {X : Cįµįµ} (x : F.obj X) (f : F ā¶ G) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm x) f = CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op (Opposite.unop X)))) x) - CategoryTheory.uliftYonedaEquiv_symm_comp_assoc š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F G : CategoryTheory.Functor Cįµįµ (Type (max w vā))} {X : Cįµįµ} (x : F.obj X) (f : F ā¶ G) {Z : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (h : G ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm x) (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op (Opposite.unop X)))) x)) h - CategoryTheory.uliftYonedaEquiv_symm_map_assoc š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (t : F.obj X) {Z : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (h : F ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map f.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm t) h) - CategoryTheory.Limits.Cone.extensions š Mathlib.CategoryTheory.Limits.Cones
{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.uliftYoneda.{uā, vā, uā}.obj c.pt ā¶ F.cones - CategoryTheory.Limits.Cone.extensions_app š Mathlib.CategoryTheory.Limits.Cones
{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) (xā : Cįµįµ) : c.extensions.app xā = TypeCat.ofHom fun f => CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.const J).map f.down) c.Ļ - CategoryTheory.uliftYonedaIsoShrinkYoneda š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.uliftYoneda.{w', v, u} ā CategoryTheory.shrinkYoneda.{max w' v, v, u} - CategoryTheory.uliftYonedaFunctor_preservesLimits š Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.Limits.PreservesLimitsOfSize.{t, w, v, max (max u v) w', u, max (max u (v + 1)) (w' + 1)} CategoryTheory.uliftYoneda.{w', v, u} - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) : F.Elementsįµįµ ā CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{w, v, u} F - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalenceFunctorCompProjIso š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).functor.comp (CategoryTheory.CostructuredArrow.proj CategoryTheory.uliftYoneda.{w, v, u} F) ā (CategoryTheory.CategoryOfElements.Ļ F).leftOp - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_functor_obj š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) (x : F.Elementsįµįµ) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).functor.obj x = CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd) - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_inverse_obj š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) (X : CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{w, v, u} F) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).inverse.obj X = Opposite.op (F.elementsMk (Opposite.op X.left) (CategoryTheory.uliftYonedaEquiv X.hom)) - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_functor_map š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) {Xā Yā : F.Elementsįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).functor.map f = CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop ⯠- CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_inverse_map š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) {Xā Yā : CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{w, v, u} F} (f : Xā ā¶ Yā) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).inverse.map f = (CategoryTheory.CategoryOfElements.homMk (F.elementsMk (Opposite.op Yā.left) (CategoryTheory.uliftYonedaEquiv Yā.hom)) (F.elementsMk (Opposite.op Xā.left) (CategoryTheory.uliftYonedaEquiv Xā.hom)) f.left.op āÆ).op - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_counitIso š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl (({ obj := fun X => Opposite.op (F.elementsMk (Opposite.op X.left) (CategoryTheory.uliftYonedaEquiv X.hom)), map := fun {X Y} f => (CategoryTheory.CategoryOfElements.homMk (F.elementsMk (Opposite.op Y.left) (CategoryTheory.uliftYonedaEquiv Y.hom)) (F.elementsMk (Opposite.op X.left) (CategoryTheory.uliftYonedaEquiv X.hom)) f.left.op āÆ).op, map_id := āÆ, map_comp := ⯠}.comp { obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop āÆ, map_id := āÆ, map_comp := ⯠}).obj X).left) āÆ) ⯠- CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_unitIso š Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cįµįµ (Type (max w v))) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).unitIso = CategoryTheory.NatIso.ofComponents (fun x => (CategoryTheory.CategoryOfElements.isoMk (F.elementsMk (Opposite.op ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop āÆ, map_id := āÆ, map_comp := ⯠}.obj x).left) (CategoryTheory.uliftYonedaEquiv ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop āÆ, map_id := āÆ, map_comp := ⯠}.obj x).hom)) (Opposite.unop x) (CategoryTheory.Iso.refl (F.elementsMk (Opposite.op ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop āÆ, map_id := āÆ, map_comp := ⯠}.obj x).left) (CategoryTheory.uliftYonedaEquiv ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (ā(Opposite.unop f)).unop āÆ, map_id := āÆ, map_comp := ⯠}.obj x).hom)).fst) āÆ).op) ⯠- CategoryTheory.Presheaf.instIsLeftKanExtensionOppositeObjFunctorTypeUliftYonedaUliftYonedaMap š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) : (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj (F.obj X)).IsLeftKanExtension (CategoryTheory.uliftYonedaMap F X) - CategoryTheory.Presheaf.preservesColimitsOfSize_leftKanExtension š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] : CategoryTheory.Limits.PreservesColimitsOfSize.{vā, uā, max (max (max vā w) uā) vā, vā, max (max (max (vā + 1) (w + 1)) uā) (vā + 1), uā} (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.leftKanExtension A) - CategoryTheory.Presheaf.functorToRepresentables_obj š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (X : P.Elementsįµįµ) : (CategoryTheory.Presheaf.functorToRepresentables P).obj X = CategoryTheory.uliftYoneda.{w, vā, uā}.obj (Opposite.unop (Opposite.unop X).fst) - CategoryTheory.Presheaf.isExtensionAlongULiftYoneda š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp (CategoryTheory.uliftYoneda.{max vā w, vā, uā}.leftKanExtension A) ā A - CategoryTheory.Presheaf.preservesColimitsOfSize_of_isLeftKanExtension š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] : CategoryTheory.Limits.PreservesColimitsOfSize.{vā, uā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L - CategoryTheory.Presheaf.uliftYonedaAdjunction š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] : L ⣠CategoryTheory.Presheaf.restrictedULiftYoneda A - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp F.op.lan - CategoryTheory.Presheaf.tautologicalCocone' š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) : CategoryTheory.Limits.Cocone ((CategoryTheory.CostructuredArrow.proj CategoryTheory.uliftYoneda.{w, vā, uā} P).comp CategoryTheory.uliftYoneda.{w, vā, uā}) - CategoryTheory.Presheaf.instIsIsoFunctorOfIsLeftKanExtensionOppositeType š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] : CategoryTheory.IsIso α - CategoryTheory.Presheaf.isColimitTautologicalCocone' š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) : CategoryTheory.Limits.IsColimit (CategoryTheory.Presheaf.tautologicalCocone' P) - CategoryTheory.Presheaf.isIso_of_isLeftKanExtension š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] : CategoryTheory.IsIso α - CategoryTheory.Presheaf.instIsIsoFunctorLeftKanExtensionUnitOppositeTypeUliftYoneda š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] : CategoryTheory.IsIso (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.leftKanExtensionUnit A) - CategoryTheory.Presheaf.isLeftKanExtension_of_preservesColimits š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (e : A ā CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [CategoryTheory.Limits.PreservesColimitsOfSize.{vā, max w uā vā vā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L] : L.IsLeftKanExtension e.hom - CategoryTheory.Presheaf.tautologicalCocone'_pt š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) : (CategoryTheory.Presheaf.tautologicalCocone' P).pt = P - CategoryTheory.Presheaf.instIsLeftKanExtensionFunctorOppositeTypeIdCompUliftYonedaOfPreservesColimitsOfSizeOfHasPointwiseLeftKanExtension š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) [CategoryTheory.Limits.PreservesColimitsOfSize.{vā, max w uā vā vā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L] [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L)] : L.IsLeftKanExtension (CategoryTheory.CategoryStruct.id (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L)) - CategoryTheory.Presheaf.isLeftKanExtension_along_uliftYoneda_iff š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) : L.IsLeftKanExtension α ā CategoryTheory.IsIso α ā§ CategoryTheory.Limits.PreservesColimitsOfSize.{vā, max w uā vā vā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L - CategoryTheory.Presheaf.uniqueExtensionAlongULiftYoneda š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (e : A ā CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [CategoryTheory.Limits.PreservesColimitsOfSize.{vā, max w uā vā vā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L] : L ā CategoryTheory.uliftYoneda.{max w vā, vā, uā}.leftKanExtension A - CategoryTheory.Presheaf.isLeftAdjoint_of_preservesColimits š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (L : CategoryTheory.Functor (CategoryTheory.Functor C (Type (max w vā vā))) ā°) [CategoryTheory.Limits.PreservesColimitsOfSize.{vā, max w uā vā vā, max (max (max uā vā) vā) w, vā, max (max (max uā (vā + 1)) (vā + 1)) (w + 1), uā} L] [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp ((CategoryTheory.opOpEquivalence C).congrLeft.functor.comp L))] : L.IsLeftAdjoint - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (E : ā°) : (L.obj P ā¶ E) ā (P ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) - CategoryTheory.Presheaf.instIsLeftKanExtensionFunctorOppositeTypeLanOpHomCompULiftYonedaIsoULiftYonedaCompLan š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] : F.op.lan.IsLeftKanExtension (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).hom - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) : P ā¶ F.op.comp (G.obj P) - CategoryTheory.Presheaf.restrictedULiftYoneda_obj_map š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (X : ā°) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : ((CategoryTheory.Presheaf.restrictedULiftYoneda A).obj X).map f = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp (A.map f.unop) x.down } - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) {P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (x : P.Elements) : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj (Opposite.unop x.fst) ā¶ F.op.comp (G.obj P) - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.natTrans š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] : F.op.lan ā¶ G - CategoryTheory.Presheaf.instUniqueHomLeftExtensionOppositeOpObjFunctorTypeUliftYonedaMkUliftYonedaMap š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) (Y : F.op.LeftExtension (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X)) : Unique (CategoryTheory.Functor.LeftExtension.mk (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj (F.obj X)) (CategoryTheory.uliftYonedaMap F X) ā¶ Y) - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (E : ā°) : ((CategoryTheory.CostructuredArrow.proj CategoryTheory.uliftYoneda.{max w vā, vā, uā} P).comp A ā¶ (CategoryTheory.Functor.const (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P)).obj E) ā (P ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) - CategoryTheory.Presheaf.restrictedULiftYoneda_map_app š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) {Xā Yā : ā°} (f : Xā ā¶ Yā) (X : Cįµįµ) : ((CategoryTheory.Presheaf.restrictedULiftYoneda A).map f).app X = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp x.down f } - CategoryTheory.Presheaf.tautologicalCocone'_ι_app š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (X : CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{w, vā, uā} P) : (CategoryTheory.Presheaf.tautologicalCocone' P).ι.app X = X.hom - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom_naturality š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) {P Q : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (f : P ā¶ Q) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ P) (F.op.whiskerLeft (G.map f)) = CategoryTheory.CategoryStruct.comp f (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ Q) - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom_naturality_assoc š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) {P Q : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (f : P ā¶ Q) {Z : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (h : F.op.comp (G.obj Q) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ P) (CategoryTheory.CategoryStruct.comp (F.op.whiskerLeft (G.map f)) h) = CategoryTheory.CategoryStruct.comp f (CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ Q) h) - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.extensionHom š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] (Φ : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.LeftExtension (F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā})) : CategoryTheory.Functor.LeftExtension.mk F.op.lan (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).hom ⶠΦ - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.natTrans_app_uliftYoneda_obj š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] (X : C) : (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.natTrans Ļ).app (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).inv.app X) (Ļ.app X) - CategoryTheory.Presheaf.functorToRepresentables_map š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) {Xā Yā : P.Elementsįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Presheaf.functorToRepresentables P).map f = CategoryTheory.uliftYoneda.{w, vā, uā}.map (āf.unop).unop - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp_naturality š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) {P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} {x y : P.Elements} (f : x ā¶ y) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{max vā w, vā, uā}.map (āf).unop) (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp Ļ x) = CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp Ļ y - CategoryTheory.Presheaf.instUniqueHomLeftExtensionFunctorOppositeTypeUliftYonedaCompMkLanOpHomCompULiftYonedaIsoULiftYonedaCompLan š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] (Φ : CategoryTheory.StructuredArrow (F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā}) ((CategoryTheory.Functor.whiskeringLeft C (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))).obj CategoryTheory.uliftYoneda.{max w vā, vā, uā})) : Unique (CategoryTheory.Functor.LeftExtension.mk F.op.lan (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).hom ⶠΦ) - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp_naturality_assoc š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) {P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} {x y : P.Elements} (f : x ā¶ y) {Z : CategoryTheory.Functor Cįµįµ (Type (max (max vā w) vā))} (h : F.op.comp (G.obj P) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{max vā w, vā, uā}.map (āf).unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp Ļ x) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.coconeApp Ļ y) h - CategoryTheory.Presheaf.uliftYonedaAdjunction_unit_app_app š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) {Z : Cįµįµ} (z : P.obj Z) : (CategoryTheory.ConcreteCategory.hom (((CategoryTheory.Presheaf.uliftYonedaAdjunction L α).unit.app P).app Z)) z = { down := CategoryTheory.CategoryStruct.comp (α.app (Opposite.unop Z)) (L.map (CategoryTheory.uliftYonedaEquiv.symm z)) } - CategoryTheory.Presheaf.uliftYonedaAdjunction_homEquiv_app š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] {A : CategoryTheory.Functor C ā°} [CategoryTheory.uliftYoneda.{max w vā, vā, uā}.HasPointwiseLeftKanExtension A] (L : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) ā°) (α : A ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp L) [L.IsLeftKanExtension α] {P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} {Y : ā°} (f : L.obj P ā¶ Y) {Z : Cįµįµ} (z : P.obj Z) : (CategoryTheory.ConcreteCategory.hom ((((CategoryTheory.Presheaf.uliftYonedaAdjunction L α).homEquiv P Y) f).app Z)) z = { down := CategoryTheory.CategoryStruct.comp (α.app (Opposite.unop Z)) (CategoryTheory.CategoryStruct.comp (L.map (CategoryTheory.uliftYonedaEquiv.symm z)) f) } - CategoryTheory.Presheaf.map_comp_uliftYonedaEquiv_down š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (E : ā°) {X Y : C} (f : X ā¶ Y) (g : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj Y ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) : CategoryTheory.CategoryStruct.comp (A.map f) (CategoryTheory.uliftYonedaEquiv g).down = (CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{max vā w, vā, uā}.map f) g)).down - CategoryTheory.Presheaf.map_comp_uliftYonedaEquiv_down_assoc š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (E : ā°) {X Y : C} (f : X ā¶ Y) (g : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj Y ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) {Z : ā°} (h : E ā¶ Z) : CategoryTheory.CategoryStruct.comp (A.map f) (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv g).down h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{max vā w, vā, uā}.map f) g)).down h - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan_inv_app_app_apply_eq_id š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] (X : C) : (CategoryTheory.ConcreteCategory.hom (((CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).inv.app X).app (Opposite.op (F.obj X)))) ((CategoryTheory.ConcreteCategory.hom ((F.op.lanUnit.app (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X)).app (Opposite.op X))) { down := CategoryTheory.CategoryStruct.id X }) = { down := CategoryTheory.CategoryStruct.id (F.obj X) } - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.hom_ext š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] {Φ : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.LeftExtension (F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā})} (f g : CategoryTheory.Functor.LeftExtension.mk F.op.lan (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).hom ⶠΦ) : f = g - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.hom_ext_iff š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [ā (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))), F.op.HasLeftKanExtension P] {Φ : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.LeftExtension (F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā})} {f g : CategoryTheory.Functor.LeftExtension.mk F.op.lan (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan F).hom ⶠΦ} : f = g ā True - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.uliftYonedaEquiv_presheafHom_uliftYoneda_obj š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) (X : C) : CategoryTheory.uliftYonedaEquiv (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X)) = (CategoryTheory.ConcreteCategory.hom ((Ļ.app X).app (F.op.obj (Opposite.op X)))) { down := CategoryTheory.CategoryStruct.id (Opposite.unop (F.op.obj (Opposite.op X))) } - CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.uliftYonedaEquiv_ι_presheafHom š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor (CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) (CategoryTheory.Functor Dįµįµ (Type (max w vā vā)))} (Ļ : F.comp CategoryTheory.uliftYoneda.{max w vā, vā, uā} ā¶ CategoryTheory.uliftYoneda.{max w vā, vā, uā}.comp G) (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) {X : C} (f : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X ā¶ P) : CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp f (CategoryTheory.Presheaf.compULiftYonedaIsoULiftYonedaCompLan.presheafHom Ļ P)) = (CategoryTheory.ConcreteCategory.hom ((G.map f).app (Opposite.op (F.obj X)))) ((CategoryTheory.ConcreteCategory.hom ((Ļ.app X).app (Opposite.op (F.obj X)))) { down := CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.op (F.obj X))) }) - CategoryTheory.Presheaf.coconeOfRepresentable_ι_app š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (P : CategoryTheory.Functor Cįµįµ (Type (max w vā))) (x : P.Elementsįµįµ) : (CategoryTheory.Presheaf.coconeOfRepresentable P).ι.app x = CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv'_symm_app_naturality_left š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) {P Q : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (f : P ā¶ Q) (E : ā°) (g : Q ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) (p : CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P) : ((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E).symm (CategoryTheory.CategoryStruct.comp f g)).app p = ((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A Q E).symm g).app ((CategoryTheory.CostructuredArrow.map f).obj p) - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv'_symm_naturality_right š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) {E E' : ā°} (g : E ā¶ E') (f : P ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) : (CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E').symm (CategoryTheory.CategoryStruct.comp f ((CategoryTheory.Presheaf.restrictedULiftYoneda A).map g)) = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E).symm f) ((CategoryTheory.Functor.const (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P)).map g) - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv'_symm_app_naturality_left_assoc š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) {P Q : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))} (f : P ā¶ Q) (E : ā°) (g : Q ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) (p : CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P) {Z : ā°} (h : ((CategoryTheory.Functor.const (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P)).obj E).obj p ā¶ Z) : CategoryTheory.CategoryStruct.comp (((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E).symm (CategoryTheory.CategoryStruct.comp f g)).app p) h = CategoryTheory.CategoryStruct.comp (((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A Q E).symm g).app ((CategoryTheory.CostructuredArrow.map f).obj p)) h - CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv'_symm_naturality_right_assoc š Mathlib.CategoryTheory.Limits.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {ā° : Type uā} [CategoryTheory.Category.{vā, uā} ā°] (A : CategoryTheory.Functor C ā°) (P : CategoryTheory.Functor Cįµįµ (Type (max w vā vā))) {E E' : ā°} (g : E ā¶ E') (f : P ā¶ (CategoryTheory.Presheaf.restrictedULiftYoneda A).obj E) {Z : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P) ā°} (h : (CategoryTheory.Functor.const (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P)).obj E' ā¶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E').symm (CategoryTheory.CategoryStruct.comp f ((CategoryTheory.Presheaf.restrictedULiftYoneda A).map g))) h = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.restrictedULiftYonedaHomEquiv' A P E).symm f) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.const (CategoryTheory.CostructuredArrow CategoryTheory.uliftYoneda.{max w vā, vā, uā} P)).map g) h) - CategoryTheory.Sieve.uliftFunctorInclusion_is_mono š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} (S : CategoryTheory.Sieve X) : CategoryTheory.Mono S.uliftFunctorInclusion - CategoryTheory.Sieve.uliftFunctorInclusion š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} (S : CategoryTheory.Sieve X) : S.uliftFunctor ā¶ CategoryTheory.uliftYoneda.{w, vā, uā}.obj X - CategoryTheory.Sieve.sieveOfUliftSubfunctor š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {R : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (f : R ā¶ CategoryTheory.uliftYoneda.{w, vā, uā}.obj X) : CategoryTheory.Sieve X - CategoryTheory.Sieve.toUliftFunctor š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} (S : CategoryTheory.Sieve X) {Y : C} (f : Y ā¶ X) (hf : S.arrows f) : CategoryTheory.uliftYoneda.{w, vā, uā}.obj Y ā¶ S.uliftFunctor - CategoryTheory.Sieve.uliftNatTransOfLe_comm š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {S T : CategoryTheory.Sieve X} (h : S ⤠T) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Sieve.uliftNatTransOfLe h) T.uliftFunctorInclusion = S.uliftFunctorInclusion - CategoryTheory.Sieve.uliftFunctorInclusion_top_isIso š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} : CategoryTheory.IsIso ā¤.uliftFunctorInclusion - CategoryTheory.Sieve.uliftFunctorInclusion_app š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} (S : CategoryTheory.Sieve X) (Xā : Cįµįµ) : S.uliftFunctorInclusion.app Xā = TypeCat.ofHom fun x => { down := āx.down } - CategoryTheory.Sieve.toUliftFunctor_app š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} (S : CategoryTheory.Sieve X) {Y : C} (f : Y ā¶ X) (hf : S.arrows f) (Z : Cįµįµ) : (S.toUliftFunctor f hf).app Z = TypeCat.ofHom fun g => { down := āØCategoryTheory.CategoryStruct.comp g.down f, āÆā© } - CategoryTheory.Sieve.sieveOfUliftSubfunctor_apply š Mathlib.CategoryTheory.Sites.Sieves.Presheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X : C} {R : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (f : R ā¶ CategoryTheory.uliftYoneda.{w, vā, uā}.obj X) (Y : C) (g : Y ā¶ X) : (CategoryTheory.Sieve.sieveOfUliftSubfunctor f).arrows g = ā t, (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op Y))) t = { down := g } - CategoryTheory.sheafToPresheafCompYonedaCompWhiskeringLeftSheafToPresheaf_inv_app_app_hom_apply š Mathlib.CategoryTheory.Sites.Sheaf
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : CategoryTheory.GrothendieckTopology C} {A : Type uā} [CategoryTheory.Category.{vā, uā} A] (X : CategoryTheory.Sheaf J A) (Xā : (CategoryTheory.Sheaf J A)įµįµ) (aā : (CategoryTheory.yoneda.obj X).obj Xā) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.sheafToPresheafCompYonedaCompWhiskeringLeftSheafToPresheaf.inv.app X).app Xā)) aā = Equiv.ulift.toIso.hom.hom' ((CategoryTheory.CategoryStruct.comp Equiv.ulift.toIso.inv (((CategoryTheory.fullyFaithfulSheafToPresheaf J A).compUliftYonedaCompWhiskeringLeft.inv.app X).app Xā)).hom' aā) - CategoryTheory.GrothendieckTopology.ofArrows_mem_iff_isLocallySurjective_cofanIsColimitDesc_uliftYoneda_map š Mathlib.CategoryTheory.Sites.LocallySurjective
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {S : C} {ι : Type u_2} [Small.{max w v, u_2} ι] {X : ι ā C} (f : (i : ι) ā X i ā¶ S) {c : CategoryTheory.Limits.Cofan fun i => CategoryTheory.uliftYoneda.{w, v, u}.obj (X i)} (hc : CategoryTheory.Limits.IsColimit c) : CategoryTheory.Sieve.ofArrows X f ā J S ā CategoryTheory.Presheaf.IsLocallySurjective J (CategoryTheory.Limits.Cofan.IsColimit.desc hc fun i => CategoryTheory.uliftYoneda.{w, v, u}.map (f i)) - CategoryTheory.GrothendieckTopology.ofArrows_mem_iff_isLocallySurjective_sigmaDesc_uliftYoneda_map š Mathlib.CategoryTheory.Sites.LocallySurjective
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) {S : C} {ι : Type u_2} [Small.{max w v, u_2} ι] {X : ι ā C} (f : (i : ι) ā X i ā¶ S) : CategoryTheory.Sieve.ofArrows X f ā J S ā CategoryTheory.Presheaf.IsLocallySurjective J (CategoryTheory.Limits.Sigma.desc fun i => CategoryTheory.uliftYoneda.{w, v, u}.map (f i)) - CategoryTheory.GrothendieckTopology.uliftYonedaCompSheafToPresheaf š Mathlib.CategoryTheory.Sites.Canonical
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) [J.Subcanonical] : (CategoryTheory.GrothendieckTopology.uliftYoneda.{w, v, u} J).comp (CategoryTheory.sheafToPresheaf J (Type (max v w))) ā CategoryTheory.uliftYoneda.{w, v, u} - CategoryTheory.GrothendieckTopology.uliftYonedaCompSheafToPresheaf_hom_app_app_hom_apply š Mathlib.CategoryTheory.Sites.Canonical
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) [J.Subcanonical] (X : C) (Xā : Cįµįµ) (a : (((CategoryTheory.GrothendieckTopology.uliftYoneda.{w, v, u} J).comp (CategoryTheory.sheafToPresheaf J (Type (max v w)))).obj X).obj Xā) : (CategoryTheory.ConcreteCategory.hom ((J.uliftYonedaCompSheafToPresheaf.hom.app X).app Xā)) a = a - CategoryTheory.GrothendieckTopology.uliftYonedaCompSheafToPresheaf_inv_app_app_hom_apply š Mathlib.CategoryTheory.Sites.Canonical
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) [J.Subcanonical] (X : C) (Xā : Cįµįµ) (a : (((CategoryTheory.GrothendieckTopology.uliftYoneda.{w, v, u} J).comp (CategoryTheory.sheafToPresheaf J (Type (max v w)))).obj X).obj Xā) : (CategoryTheory.ConcreteCategory.hom ((J.uliftYonedaCompSheafToPresheaf.inv.app X).app Xā)) a = a - CategoryTheory.Subfunctor.ofSection_eq_range' š Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cįµįµ (Type (max v w))} {X : Cįµįµ} (x : F.obj X) : CategoryTheory.Subfunctor.ofSection x = CategoryTheory.Subfunctor.range (CategoryTheory.uliftYonedaEquiv.symm x) - CategoryTheory.Subfunctor.range_eq_ofSection' š Mathlib.CategoryTheory.Subfunctor.OfSection
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cįµįµ (Type (max v w))} {X : C} (f : (CategoryTheory.yoneda.obj X).comp CategoryTheory.uliftFunctor.{w, v} ā¶ F) : CategoryTheory.Subfunctor.range f = CategoryTheory.Subfunctor.ofSection (CategoryTheory.uliftYonedaEquiv f) - CategoryTheory.GrothendieckTopology.uliftYonedaOpCompCoyoneda_inv_app_app_hom_apply_hom_app_hom_apply š Mathlib.CategoryTheory.Sites.Subcanonical
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) [J.Subcanonical] (X : Cįµįµ) (Xā : CategoryTheory.Sheaf J (Type (max v' v))) (aā : (((CategoryTheory.evaluation Cįµįµ (Type (max v v'))).comp (((CategoryTheory.Functor.whiskeringRight (CategoryTheory.Functor Cįµįµ (Type (max v v'))) (Type (max v v')) (Type (max (max v v') u))).obj CategoryTheory.uliftFunctor.{u, max v v'}).comp ((CategoryTheory.Functor.whiskeringLeft (CategoryTheory.Sheaf J (Type (max v v'))) (CategoryTheory.Functor Cįµįµ (Type (max v v'))) (Type (max (max v v') u))).obj (CategoryTheory.sheafToPresheaf J (Type (max v v')))))).obj X).obj Xā) (Xā¹ : Cįµįµ) (aā¹ : (Opposite.unop (((CategoryTheory.GrothendieckTopology.uliftYoneda.{v', v, u} J).comp (CategoryTheory.sheafToPresheaf J (Type (max v v')))).op.obj X)).obj Xā¹) : (CategoryTheory.ConcreteCategory.hom (((CategoryTheory.ConcreteCategory.hom ((J.uliftYonedaOpCompCoyoneda.inv.app X).app Xā)) aā).hom.app Xā¹)) aā¹ = ((((CategoryTheory.uliftYonedaOpCompCoyoneda.inv.app X).app Xā.obj).hom' aā).app Xā¹).hom' (((J.uliftYonedaCompSheafToPresheaf.hom.app (Opposite.unop X)).app Xā¹).hom' aā¹) - CategoryTheory.GrothendieckTopology.uliftYonedaOpCompCoyoneda_hom_app_app_hom_apply_down š Mathlib.CategoryTheory.Sites.Subcanonical
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : CategoryTheory.GrothendieckTopology C) [J.Subcanonical] (X : Cįµįµ) (Xā : CategoryTheory.Sheaf J (Type (max v' v))) (aā : (((J.yoneda.op.comp (CategoryTheory.sheafCompose J CategoryTheory.uliftFunctor.{v', v}).op).comp CategoryTheory.coyoneda).obj X).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((J.uliftYonedaOpCompCoyoneda.hom.app X).app Xā)) aā).down = CategoryTheory.uliftYonedaEquiv ((CategoryTheory.CategoryStruct.comp ((CategoryTheory.sheafToPresheafCompCoyonedaCompWhiskeringLeftSheafToPresheaf.inv.app (Opposite.op ((CategoryTheory.sheafCompose J CategoryTheory.uliftFunctor.{v', v}).obj (J.yoneda.obj (Opposite.unop X))))).app Xā) (TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp (J.uliftYonedaCompSheafToPresheaf.inv.app (Opposite.unop X)) g)).hom' aā) - CategoryTheory.instIsDenseFunctorOppositeTypeUliftYoneda š Mathlib.CategoryTheory.Functor.KanExtension.Dense
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.IsDense - CategoryTheory.denseAtUliftYoneda š Mathlib.CategoryTheory.Functor.KanExtension.Dense
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : CategoryTheory.Functor Cįµįµ (Type (max w vā))) : CategoryTheory.uliftYoneda.{w, vā, uā}.DenseAt X - CategoryTheory.Presheaf.instIsCardinalPresentableFunctorOppositeTypeObjUliftYonedaOfHasColimitsOfSize š Mathlib.CategoryTheory.Presentable.Presheaf
{C : Type u} [CategoryTheory.SmallCategory C] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, max u u', max (u + 1) (u' + 1)} (Type (max u u'))] (Īŗ : Cardinal.{w}) [Fact Īŗ.IsRegular] (X : C) : CategoryTheory.IsCardinalPresentable (CategoryTheory.uliftYoneda.{u', u, u}.obj X) Īŗ - CategoryTheory.Functor.IsRepresentedBy.uliftYonedaIso š Mathlib.CategoryTheory.RepresentedBy
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cįµįµ (Type w)} {X : C} {x : F.obj (Opposite.op X)} (h : F.IsRepresentedBy x) : CategoryTheory.uliftYoneda.{w, v, u}.obj X ā F.comp CategoryTheory.uliftFunctor.{v, w} - CategoryTheory.Functor.IsRepresentedBy.iff_isIso_uliftYonedaEquiv š Mathlib.CategoryTheory.RepresentedBy
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cįµįµ (Type w)} {X : C} {x : F.obj (Opposite.op X)} : F.IsRepresentedBy x ā CategoryTheory.IsIso (CategoryTheory.uliftYonedaEquiv.symm { down := x }) - CategoryTheory.Functor.IsRepresentedBy.uliftYonedaIso_hom š Mathlib.CategoryTheory.RepresentedBy
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cįµįµ (Type w)} {X : C} {x : F.obj (Opposite.op X)} (h : F.IsRepresentedBy x) : h.uliftYonedaIso.hom = CategoryTheory.uliftYonedaEquiv.symm { down := x }
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