Loogle!
Result
Found 471 declarations mentioning CategoryTheory.yoneda. Of these, only the first 200 are shown.
- CategoryTheory.yoneda 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.Functor C (CategoryTheory.Functor Cᵒᵖ (Type v₁)) - CategoryTheory.Yoneda.fullyFaithful 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yoneda.FullyFaithful - CategoryTheory.Yoneda.yoneda_faithful 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yoneda.Faithful - CategoryTheory.Yoneda.yoneda_full 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yoneda.Full - CategoryTheory.Functor.instIsRepresentableObjOppositeTypeYoneda 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} : (CategoryTheory.yoneda.obj X).IsRepresentable - CategoryTheory.Functor.RepresentableBy.yoneda 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) : (CategoryTheory.yoneda.obj X).RepresentableBy X - 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.yoneda_obj_obj 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (Y : Cᵒᵖ) : (CategoryTheory.yoneda.obj X).obj Y = (Opposite.unop Y ⟶ X) - CategoryTheory.Functor.IsRepresentable.mk' 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {X : C} (e : CategoryTheory.yoneda.obj X ≅ F) : F.IsRepresentable - CategoryTheory.Functor.RepresentableBy.toIso 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {Y : C} (e : F.RepresentableBy Y) : CategoryTheory.yoneda.obj Y ≅ F - CategoryTheory.Functor.representableByEquiv 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {Y : C} : F.RepresentableBy Y ≃ (CategoryTheory.yoneda.obj Y ≅ F) - CategoryTheory.Functor.reprW 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [F.IsRepresentable] : CategoryTheory.yoneda.obj F.reprX ≅ F - CategoryTheory.Coyoneda.objOpOp 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) : CategoryTheory.coyoneda.obj (Opposite.op (Opposite.op X)) ≅ CategoryTheory.yoneda.obj X - CategoryTheory.yonedaEquiv 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} : (CategoryTheory.yoneda.obj X ⟶ F) ≃ F.obj (Opposite.op X) - CategoryTheory.Functor.RepresentableBy.coyoneda_homEquiv 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X Y : C) : (CategoryTheory.Functor.RepresentableBy.yoneda X).homEquiv = Equiv.refl (Y ⟶ X) - CategoryTheory.Yoneda.isIso 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : X ⟶ Y) [CategoryTheory.IsIso (CategoryTheory.yoneda.map f)] : CategoryTheory.IsIso f - CategoryTheory.yonedaMap 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u_1} [CategoryTheory.Category.{v₁, u_1} D] (F : CategoryTheory.Functor C D) (X : C) : CategoryTheory.yoneda.obj X ⟶ F.op.comp (CategoryTheory.yoneda.obj (F.obj X)) - CategoryTheory.coyonedaCompYonedaObj 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (P : CategoryTheory.Functor C (Type v₁)) : CategoryTheory.coyoneda.rightOp.comp (CategoryTheory.yoneda.obj P) ≅ P.comp CategoryTheory.uliftFunctor.{u₁, v₁} - CategoryTheory.yoneda_obj_map 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : (CategoryTheory.yoneda.obj X).map f = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp f.unop g - CategoryTheory.isIso_iff_isIso_yoneda_map 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.IsIso f ↔ ∀ (c : C), CategoryTheory.IsIso ((CategoryTheory.yoneda.map f).app (Opposite.op c)) - CategoryTheory.yonedaOpCompYonedaObj 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (P : CategoryTheory.Functor Cᵒᵖ (Type v₁)) : CategoryTheory.yoneda.op.comp (CategoryTheory.yoneda.obj P) ≅ P.comp CategoryTheory.uliftFunctor.{u₁, v₁} - CategoryTheory.Coyoneda.opIso 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringLeft C Cᵒᵖᵒᵖ (Type v₁)).obj (CategoryTheory.opOp C)) ≅ CategoryTheory.coyoneda - CategoryTheory.curriedYonedaLemma 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.SmallCategory C] : CategoryTheory.yoneda.op.comp CategoryTheory.coyoneda ≅ CategoryTheory.evaluation Cᵒᵖ (Type u₁) - 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.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.Coyoneda.objOpOp_hom_app 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (X✝ : Cᵒᵖ) : (CategoryTheory.Coyoneda.objOpOp X).hom.app X✝ = (CategoryTheory.opEquiv (Opposite.op X) X✝).toIso.hom - CategoryTheory.Coyoneda.objOpOp_inv_app 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) (X✝ : Cᵒᵖ) : (CategoryTheory.Coyoneda.objOpOp X).inv.app X✝ = (CategoryTheory.opEquiv (Opposite.op X) X✝).toIso.inv - CategoryTheory.curriedCoyonedaLemma' 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.SmallCategory C] : CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringLeft C (CategoryTheory.Functor C (Type u₁))ᵒᵖ (Type u₁)).obj CategoryTheory.coyoneda.rightOp) ≅ CategoryTheory.Functor.id (CategoryTheory.Functor C (Type u₁)) - CategoryTheory.hom_ext_yoneda 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P Q : CategoryTheory.Functor Cᵒᵖ (Type v₁)} {f g : P ⟶ Q} (h : ∀ (X : C) (p : CategoryTheory.yoneda.obj X ⟶ P), CategoryTheory.CategoryStruct.comp p f = CategoryTheory.CategoryStruct.comp p g) : f = g - CategoryTheory.yonedaMap_app_apply 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u_1} [CategoryTheory.Category.{v₁, u_1} D] (F : CategoryTheory.Functor C D) {Y : C} {X : Cᵒᵖ} (f : Opposite.unop X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.yonedaMap F Y).app X)) f = F.map f - CategoryTheory.curriedYonedaLemma' 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.SmallCategory C] : CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringLeft Cᵒᵖ (CategoryTheory.Functor Cᵒᵖ (Type u₁))ᵒᵖ (Type u₁)).obj CategoryTheory.yoneda.op) ≅ CategoryTheory.Functor.id (CategoryTheory.Functor Cᵒᵖ (Type u₁)) - CategoryTheory.largeCurriedYonedaLemma 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] : CategoryTheory.yoneda.op.comp CategoryTheory.coyoneda ≅ (CategoryTheory.evaluation Cᵒᵖ (Type v₁)).comp ((CategoryTheory.Functor.whiskeringRight (CategoryTheory.Functor Cᵒᵖ (Type v₁)) (Type v₁) (Type (max u₁ v₁))).obj CategoryTheory.uliftFunctor.{u₁, v₁}) - 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.Yoneda.fullyFaithful_preimage 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : CategoryTheory.yoneda.obj X ⟶ CategoryTheory.yoneda.obj Y) : CategoryTheory.Yoneda.fullyFaithful.preimage f = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op X))) (CategoryTheory.CategoryStruct.id X) - CategoryTheory.Functor.reprW_hom_app 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) [F.IsRepresentable] (X : Cᵒᵖ) (f : Opposite.unop X ⟶ F.reprX) : (CategoryTheory.ConcreteCategory.hom (F.reprW.hom.app X)) f = (CategoryTheory.ConcreteCategory.hom (F.map f.op)) F.reprx - CategoryTheory.Functor.FullyFaithful.compUliftCoyonedaCompWhiskeringLeft_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.uliftCoyoneda.{v₂, v₁, u₁}.obj (Opposite.op (Opposite.unop X))).obj X✝) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftCoyonedaCompWhiskeringLeft.inv.app X).app X✝)) x).down = F.map x.down - CategoryTheory.yonedaEquiv_yoneda_map 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : X ⟶ Y) : CategoryTheory.yonedaEquiv (CategoryTheory.yoneda.map f) = f - CategoryTheory.yonedaEquiv_symm_app 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (x : F.obj (Opposite.op X)) (Y : Cᵒᵖ) : (CategoryTheory.yonedaEquiv.symm x).app Y = TypeCat.ofHom fun f => (CategoryTheory.ConcreteCategory.hom (F.map (Quiver.Hom.op f))) x - CategoryTheory.yonedaEquiv_apply 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X ⟶ F) : CategoryTheory.yonedaEquiv f = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op X))) (CategoryTheory.CategoryStruct.id X) - CategoryTheory.yoneda_map_app 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) (x✝ : Cᵒᵖ) : (CategoryTheory.yoneda.map f).app x✝ = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g f - CategoryTheory.Functor.CorepresentableBy.equivUliftCoyonedaIso_apply 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (F : CategoryTheory.Functor C (Type (max w v₁))) (X : C) (R : F.CorepresentableBy X) : (CategoryTheory.Functor.CorepresentableBy.equivUliftCoyonedaIso F X) R = CategoryTheory.NatIso.ofComponents (fun X_1 => equivEquivIso (Equiv.ulift.trans R.homEquiv)) ⋯ - 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.yonedaPairing_map 📋 Mathlib.CategoryTheory.Yoneda
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] (P Q : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)) (α : P ⟶ Q) : (CategoryTheory.yonedaPairing C).map α = TypeCat.ofHom fun β => CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map α.1.unop) (CategoryTheory.CategoryStruct.comp β α.2) - CategoryTheory.Yoneda.obj_map_id 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} (f : Opposite.op X ⟶ Opposite.op Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.yoneda.obj X).map f)) (CategoryTheory.CategoryStruct.id X) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.yoneda.map f.unop).app (Opposite.op Y))) (CategoryTheory.CategoryStruct.id Y) - CategoryTheory.map_yonedaEquiv' 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : Cᵒᵖ} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj (Opposite.unop X) ⟶ F) (g : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.yonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app Y)) g.unop - CategoryTheory.map_yonedaEquiv 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X ⟶ F) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (F.map g.op)) (CategoryTheory.yonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op Y))) g - 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.yonedaEquiv_comp 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : C} {F G : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (α : CategoryTheory.yoneda.obj X ⟶ F) (β : F ⟶ G) : CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp α β) = (CategoryTheory.ConcreteCategory.hom (β.app (Opposite.op X))) (CategoryTheory.yonedaEquiv α) - CategoryTheory.yonedaEquiv_naturality 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : C} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj X ⟶ F) (g : Y ⟶ X) : (CategoryTheory.ConcreteCategory.hom (F.map g.op)) (CategoryTheory.yonedaEquiv f) = CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map g) f) - CategoryTheory.yonedaEquiv_symm_naturality_right 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (X : C) {F F' : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : F ⟶ F') (x : F.obj (Opposite.op X)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.yonedaEquiv.symm x) f = CategoryTheory.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op X))) x) - CategoryTheory.yonedaEquiv_naturality' 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : Cᵒᵖ} {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (f : CategoryTheory.yoneda.obj (Opposite.unop X) ⟶ F) (g : X ⟶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.yonedaEquiv f) = CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map g.unop) f) - CategoryTheory.yonedaEquiv_symm_naturality_left 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X X' : C} (f : X' ⟶ X) (F : CategoryTheory.Functor Cᵒᵖ (Type v₁)) (x : F.obj (Opposite.op X)) : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) (CategoryTheory.yonedaEquiv.symm x) = CategoryTheory.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f.op)) x) - CategoryTheory.yonedaEquiv_symm_map 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y : Cᵒᵖ} (f : X ⟶ Y) {F : CategoryTheory.Functor Cᵒᵖ (Type v₁)} (t : F.obj X) : CategoryTheory.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f.unop) (CategoryTheory.yonedaEquiv.symm t) - CategoryTheory.yonedaPairingExt 📋 Mathlib.CategoryTheory.Yoneda
(C : Type u₁) [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)} {x y : (CategoryTheory.yonedaPairing C).obj X} (w : ∀ (Y : Cᵒᵖ), x.app Y = y.app Y) : x = y - CategoryTheory.yonedaPairingExt_iff 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X : Cᵒᵖ × CategoryTheory.Functor Cᵒᵖ (Type v₁)} {x y : (CategoryTheory.yonedaPairing C).obj X} : x = y ↔ ∀ (Y : Cᵒᵖ), x.app Y = y.app Y - CategoryTheory.Functor.RepresentableBy.uniqueUpToIso_hom 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y Y' : C} (e : F.RepresentableBy Y) (e' : F.RepresentableBy Y') : (e.uniqueUpToIso e').hom = CategoryTheory.Yoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (⇑e'.homEquiv.symm ∘ ⇑e.homEquiv), inv := TypeCat.ofHom (⇑e.homEquiv.symm ∘ ⇑e'.homEquiv), hom_inv_id := ⋯, inv_hom_id := ⋯ }) ⋯).hom - CategoryTheory.Functor.RepresentableBy.uniqueUpToIso_inv 📋 Mathlib.CategoryTheory.Yoneda
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {F : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y Y' : C} (e : F.RepresentableBy Y) (e' : F.RepresentableBy Y') : (e.uniqueUpToIso e').inv = CategoryTheory.Yoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (⇑e'.homEquiv.symm ∘ ⇑e.homEquiv), inv := TypeCat.ofHom (⇑e.homEquiv.symm ∘ ⇑e'.homEquiv), hom_inv_id := ⋯, inv_hom_id := ⋯ }) ⋯).inv - CategoryTheory.Adjunction.representableBy 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (Y : D) : (F.op.comp (CategoryTheory.yoneda.obj Y)).RepresentableBy (G.obj Y) - CategoryTheory.Adjunction.representableBy_homEquiv 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₂, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (Y : D) {X✝ : C} : (adj.representableBy Y).homEquiv = (adj.homEquiv X✝ Y).symm - CategoryTheory.Adjunction.compYonedaIso 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) : G.comp CategoryTheory.yoneda ≅ CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringLeft Cᵒᵖ Dᵒᵖ (Type v₁)).obj F.op) - CategoryTheory.Adjunction.compYonedaIso_hom_app_app_hom_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : D) (X✝ : Cᵒᵖ) (x : Opposite.unop X✝ ⟶ G.obj X) : (CategoryTheory.ConcreteCategory.hom ((adj.compYonedaIso.hom.app X).app X✝)) x = CategoryTheory.CategoryStruct.comp (F.map x) (adj.counit.app X) - CategoryTheory.Adjunction.compYonedaIso_inv_app_app_hom_apply 📋 Mathlib.CategoryTheory.Adjunction.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {D : Type u₂} [CategoryTheory.Category.{v₁, u₂} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F ⊣ G) (X : D) (X✝ : Cᵒᵖ) (x : F.obj (Opposite.unop X✝) ⟶ X) : (CategoryTheory.ConcreteCategory.hom ((adj.compYonedaIso.inv.app X).app X✝)) x = CategoryTheory.CategoryStruct.comp (adj.unit.app (Opposite.unop X✝)) (G.map x) - 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.Functor.cones_map 📋 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) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : F.cones.map f = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.const J).map f.unop) g - CategoryTheory.cones_obj_map 📋 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) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : ((CategoryTheory.cones J C).obj F).map f = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.const J).map f.unop) g - CategoryTheory.cones_map_app 📋 Mathlib.CategoryTheory.Limits.Cones
(J : Type u₁) [CategoryTheory.Category.{v₁, u₁} J] (C : Type u₃) [CategoryTheory.Category.{v₃, u₃} C] {X✝ Y✝ : CategoryTheory.Functor J C} (f : X✝ ⟶ Y✝) (X : Cᵒᵖ) : ((CategoryTheory.cones J C).map f).app X = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g f - CategoryTheory.Limits.IsLimit.natIso 📋 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} (h : CategoryTheory.Limits.IsLimit t) : (CategoryTheory.yoneda.obj t.pt).comp CategoryTheory.uliftFunctor.{u₁, v₃} ≅ F.cones - CategoryTheory.Limits.limYoneda 📋 Mathlib.CategoryTheory.Limits.HasLimits
{J : Type u₁} [CategoryTheory.Category.{v₁, u₁} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasLimitsOfShape J C] : CategoryTheory.Limits.lim.comp (CategoryTheory.yoneda.comp ((CategoryTheory.Functor.whiskeringRight Cᵒᵖ (Type v) (Type (max v u₁))).obj CategoryTheory.uliftFunctor.{u₁, v})) ≅ CategoryTheory.cones J C - CategoryTheory.Limits.piConstAdj 📋 Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] (X : C) : (CategoryTheory.Limits.piConst.obj X).rightOp ⊣ CategoryTheory.yoneda.obj X - CategoryTheory.instSmallOppositeObjFunctorTypeYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : CategoryTheory.FunctorToTypes.Small.{w, v, v, u} (CategoryTheory.yoneda.obj X) - CategoryTheory.shrinkYonedaIsoYoneda 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.shrinkYoneda.{v, v, u} ≅ CategoryTheory.yoneda - CategoryTheory.shrinkYoneda_obj 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (X : C) : CategoryTheory.shrinkYoneda.{w, v, u}.obj X = CategoryTheory.FunctorToTypes.shrink.{w, v, v, u} (CategoryTheory.yoneda.obj X) - CategoryTheory.shrinkCoyonedaCompEvaluationCompUliftFunctorIsoUliftFunctor 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (Y : C) : CategoryTheory.shrinkCoyoneda.{w, v, u}.comp (((CategoryTheory.evaluation C (Type w)).obj Y).comp CategoryTheory.uliftFunctor.{v, w}) ≅ (CategoryTheory.yoneda.obj Y).comp CategoryTheory.uliftFunctor.{w, v} - CategoryTheory.shrinkYoneda_map 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X✝ Y✝ : C} (f : X✝ ⟶ Y✝) : CategoryTheory.shrinkYoneda.{w, v, u}.map f = CategoryTheory.FunctorToTypes.shrinkMap (CategoryTheory.yoneda.map f) - CategoryTheory.shrinkYonedaIsoYoneda_hom_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.shrinkYonedaIsoYoneda.hom.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkYonedaObjObjEquiv.toIso) ⋯).hom - CategoryTheory.shrinkYonedaIsoYoneda_inv_app 📋 Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.shrinkYonedaIsoYoneda.inv.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkYonedaObjObjEquiv.toIso) ⋯).inv - CategoryTheory.yonedaFunctor_preservesLimits 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.Limits.PreservesLimitsOfSize.{t, w, v, max u v, u, max u (v + 1)} CategoryTheory.yoneda - CategoryTheory.yonedaFunctor_reflectsLimits 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.Limits.ReflectsLimitsOfSize.{t, w, v, max u v, u, max u (v + 1)} CategoryTheory.yoneda - CategoryTheory.yoneda_preservesLimits 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.Limits.PreservesLimitsOfSize.{t, w, v, v, u, v + 1} (CategoryTheory.yoneda.obj X) - CategoryTheory.yoneda_preservesLimitsOfShape 📋 Mathlib.CategoryTheory.Limits.Yoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (J : Type w) [CategoryTheory.Category.{t, w} J] (X : C) : CategoryTheory.Limits.PreservesLimitsOfShape J (CategoryTheory.yoneda.obj X) - CategoryTheory.yoneda_preservesLimit 📋 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ᵒᵖ) (X : C) : CategoryTheory.Limits.PreservesLimit F (CategoryTheory.yoneda.obj X) - CategoryTheory.Limits.coneOfSectionCompYoneda 📋 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ᵒᵖ) (X : C) (s : ↑(F.comp (CategoryTheory.yoneda.obj X)).sections) : CategoryTheory.Limits.Cone F - 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.coneOfSectionCompYoneda_pt 📋 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ᵒᵖ) (X : C) (s : ↑(F.comp (CategoryTheory.yoneda.obj X)).sections) : (CategoryTheory.Limits.coneOfSectionCompYoneda F X s).pt = Opposite.op X - 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)) - CategoryTheory.Limits.coneOfSectionCompYoneda_π_app 📋 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ᵒᵖ) (X : C) (s : ↑(F.comp (CategoryTheory.yoneda.obj X)).sections) (j : J) : (CategoryTheory.Limits.coneOfSectionCompYoneda F X s).π.app j = Quiver.Hom.op (↑s j) - CategoryTheory.Limits.PushoutCocone.isColimitYonedaEquiv 📋 Mathlib.CategoryTheory.Limits.Preserves.Shapes.Pullbacks
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {X Y Z : C} {f : X ⟶ Y} {g : X ⟶ Z} (c : CategoryTheory.Limits.PushoutCocone f g) : CategoryTheory.Limits.IsColimit c ≃ ((X_1 : C) → CategoryTheory.Limits.IsLimit (c.op.map (CategoryTheory.yoneda.obj X_1))) - CommRingCat.instIsRightAdjointOppositeObjFunctorTypeYoneda 📋 Mathlib.Algebra.Category.Ring.Adjunctions
(R : CommRingCat) : (CategoryTheory.yoneda.obj R).IsRightAdjoint - CommRingCat.coyonedaAdj 📋 Mathlib.Algebra.Category.Ring.Adjunctions
(R : CommRingCat) : (CommRingCat.coyoneda.flip.obj R).rightOp ⊣ CategoryTheory.yoneda.obj R - CategoryTheory.Functor.Elements.initial 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : C) : (CategoryTheory.yoneda.obj A).Elements - CategoryTheory.Functor.Elements.isInitial 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : C) : CategoryTheory.Limits.IsInitial (CategoryTheory.Functor.Elements.initial A) - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : F.Elementsᵒᵖ ≌ CategoryTheory.CostructuredArrow CategoryTheory.yoneda F - CategoryTheory.CategoryOfElements.toCostructuredArrow 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor F.Elementsᵒᵖ (CategoryTheory.CostructuredArrow CategoryTheory.yoneda F) - CategoryTheory.CategoryOfElements.fromCostructuredArrow 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda F)ᵒᵖ F.Elements - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_functor 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).functor = CategoryTheory.CategoryOfElements.toCostructuredArrow F - CategoryTheory.CategoryOfElements.fromCostructuredArrow_obj_fst 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : (CategoryTheory.CostructuredArrow CategoryTheory.yoneda F)ᵒᵖ) : ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj X).fst = Opposite.op (Opposite.unop X).left - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_inverse 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).inverse = (CategoryTheory.CategoryOfElements.fromCostructuredArrow F).rightOp - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceFunctorProj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).functor.comp (CategoryTheory.CostructuredArrow.proj CategoryTheory.yoneda F) ≅ (CategoryTheory.CategoryOfElements.π F).leftOp - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceInverseπ 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).inverse.comp (CategoryTheory.CategoryOfElements.π F).leftOp ≅ CategoryTheory.CostructuredArrow.proj CategoryTheory.yoneda F - CategoryTheory.CategoryOfElements.fromCostructuredArrow_obj_mk 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) {X : C} (f : CategoryTheory.yoneda.obj X ⟶ F) : (CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj (Opposite.op (CategoryTheory.CostructuredArrow.mk f)) = ⟨Opposite.op X, CategoryTheory.yonedaEquiv.toFun f⟩ - CategoryTheory.CategoryOfElements.costructuredArrow_yoneda_equivalence_naturality 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor Cᵒᵖ (Type v)} (α : F₁ ⟶ F₂) : (CategoryTheory.CategoryOfElements.map α).op.comp (CategoryTheory.CategoryOfElements.toCostructuredArrow F₂) = (CategoryTheory.CategoryOfElements.toCostructuredArrow F₁).comp (CategoryTheory.CostructuredArrow.map α) - CategoryTheory.CategoryOfElements.fromCostructuredArrow_obj_snd 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : (CategoryTheory.CostructuredArrow CategoryTheory.yoneda F)ᵒᵖ) : ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj X).snd = CategoryTheory.yonedaEquiv.toFun (Opposite.unop X).hom - CategoryTheory.CategoryOfElements.toCostructuredArrow_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : F.Elementsᵒᵖ) : (CategoryTheory.CategoryOfElements.toCostructuredArrow F).obj X = CategoryTheory.CostructuredArrow.mk (CategoryTheory.yonedaEquiv.symm (Opposite.unop X).snd) - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceFunctorProj_hom_app 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : F.Elementsᵒᵖ) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceFunctorProj F).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.unop X).1) - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceFunctorProj_inv_app 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : F.Elementsᵒᵖ) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceFunctorProj F).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.unop X).1) - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceInverseπ_hom_app 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : CategoryTheory.CostructuredArrow CategoryTheory.yoneda F) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceInverseπ F).hom.app X = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceInverseπ_inv_app 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) (X : CategoryTheory.CostructuredArrow CategoryTheory.yoneda F) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalenceInverseπ F).inv.app X = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_unitIso 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).unitIso = CategoryTheory.NatIso.ofComponents (fun X => (CategoryTheory.CategoryOfElements.isoMk ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj (Opposite.op ((CategoryTheory.CategoryOfElements.toCostructuredArrow F).obj X))) (Opposite.unop X) (CategoryTheory.Iso.refl ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj (Opposite.op ((CategoryTheory.CategoryOfElements.toCostructuredArrow F).obj X))).fst) ⋯).op) ⋯ - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_counitIso 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).rightOp.comp (CategoryTheory.CategoryOfElements.toCostructuredArrow F)).obj X).left) ⋯) ⋯ - CategoryTheory.CategoryOfElements.toCostructuredArrow_map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) {X✝ Y✝ : F.Elementsᵒᵖ} (f : X✝ ⟶ Y✝) : (CategoryTheory.CategoryOfElements.toCostructuredArrow F).map f = CategoryTheory.CostructuredArrow.homMk (↑f.unop).unop ⋯ - CategoryTheory.CategoryOfElements.fromCostructuredArrow_map_coe 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type v)) {X Y : (CategoryTheory.CostructuredArrow CategoryTheory.yoneda F)ᵒᵖ} (f : X ⟶ Y) : ↑((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).map f) = f.unop.left.op - CategoryTheory.Functor.final_of_isTerminal_colimit_comp_yoneda 📋 Mathlib.CategoryTheory.Limits.Final
{C : Type v} [CategoryTheory.Category.{v, v} C] {D : Type u₁} [CategoryTheory.Category.{v, u₁} D] (F : CategoryTheory.Functor C D) (h : CategoryTheory.Limits.IsTerminal (CategoryTheory.Limits.colimit (F.comp CategoryTheory.yoneda))) : F.Final - CategoryTheory.whiskering_preadditiveYoneda 📋 Mathlib.CategoryTheory.Preadditive.Yoneda.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] : CategoryTheory.preadditiveYoneda.comp ((CategoryTheory.Functor.whiskeringRight Cᵒᵖ AddCommGrpCat (Type v)).obj (CategoryTheory.forget AddCommGrpCat)) = CategoryTheory.yoneda - CategoryTheory.whiskering_linearYoneda 📋 Mathlib.CategoryTheory.Linear.Yoneda
(R : Type w) [Ring R] (C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.Preadditive C] [CategoryTheory.Linear R C] : (CategoryTheory.linearYoneda R C).comp ((CategoryTheory.Functor.whiskeringRight Cᵒᵖ (ModuleCat R) (Type v)).obj (CategoryTheory.forget (ModuleCat R))) = CategoryTheory.yoneda - CategoryTheory.Injective.injective_iff_preservesEpimorphisms_yoneda_obj 📋 Mathlib.CategoryTheory.Preadditive.Injective.Basic
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (J : C) : CategoryTheory.Injective J ↔ (CategoryTheory.yoneda.obj J).PreservesEpimorphisms - CategoryTheory.Limits.opCompYonedaSectionsEquiv 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J C) (X : C) : ↑(F.op.comp (CategoryTheory.yoneda.obj X)).sections ≃ (F ⟶ (CategoryTheory.Functor.const J).obj X) - CategoryTheory.Limits.limitCompYonedaIsoCocone 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type v} [CategoryTheory.SmallCategory J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (X : C) : CategoryTheory.Limits.limit (F.op.comp (CategoryTheory.yoneda.obj X)) ≅ F ⟶ (CategoryTheory.Functor.const J).obj X - CategoryTheory.Limits.compYonedaSectionsEquiv 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J Cᵒᵖ) (X : C) : ↑(F.comp (CategoryTheory.yoneda.obj X)).sections ≃ ((CategoryTheory.Functor.const J).obj (Opposite.op X) ⟶ F) - CategoryTheory.Limits.yonedaCompLimIsoCocones 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type v} [CategoryTheory.SmallCategory J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) : CategoryTheory.yoneda.comp (((CategoryTheory.Functor.whiskeringLeft Jᵒᵖ Cᵒᵖ (Type v)).obj F.op).comp CategoryTheory.Limits.lim) ≅ F.cocones - CategoryTheory.Limits.opHomCompWhiskeringLimYonedaIsoCocones 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
(J : Type v) [CategoryTheory.SmallCategory J] (C : Type u) [CategoryTheory.Category.{v, u} C] : (CategoryTheory.Functor.opHom J C).comp ((CategoryTheory.Functor.whiskeringLeft Jᵒᵖ Cᵒᵖ (Type v)).comp (((CategoryTheory.Functor.whiskeringRight (CategoryTheory.Functor Cᵒᵖ (Type v)) (CategoryTheory.Functor Jᵒᵖ (Type v)) (Type v)).obj CategoryTheory.Limits.lim).comp ((CategoryTheory.Functor.whiskeringLeft C (CategoryTheory.Functor Cᵒᵖ (Type v)) (Type v)).obj CategoryTheory.yoneda))) ≅ CategoryTheory.cocones J C - CategoryTheory.Limits.limitCompYonedaIsoCocone_hom 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type v} [CategoryTheory.SmallCategory J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (X : C) : (CategoryTheory.Limits.limitCompYonedaIsoCocone F X).hom = TypeCat.ofHom fun a => { app := fun j => (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.limit.π (F.op.comp (CategoryTheory.yoneda.obj X)) (Opposite.op j))) a, naturality := ⋯ } - CategoryTheory.Limits.compYonedaSectionsEquiv_apply_app 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J Cᵒᵖ) (X : C) (s : ↑(F.comp (CategoryTheory.yoneda.obj X)).sections) (j : J) : ((CategoryTheory.Limits.compYonedaSectionsEquiv F X) s).app j = Quiver.Hom.op (↑s j) - CategoryTheory.Limits.opCompYonedaSectionsEquiv_apply_app 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J C) (X : C) (s : ↑(F.op.comp (CategoryTheory.yoneda.obj X)).sections) (j : J) : ((CategoryTheory.Limits.opCompYonedaSectionsEquiv F X) s).app j = ↑s (Opposite.op j) - CategoryTheory.Limits.opCompYonedaSectionsEquiv_symm_apply_coe 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J C) (X : C) (τ : F ⟶ (CategoryTheory.Functor.const J).obj X) (j : Jᵒᵖ) : ↑((CategoryTheory.Limits.opCompYonedaSectionsEquiv F X).symm τ) j = τ.app (Opposite.unop j) - CategoryTheory.Limits.compYonedaSectionsEquiv_symm_apply_coe 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type u_1} {C : Type u_2} [CategoryTheory.Category.{v_1, u_1} J] [CategoryTheory.Category.{v_2, u_2} C] (F : CategoryTheory.Functor J Cᵒᵖ) (X : C) (τ : (CategoryTheory.Functor.const J).obj (Opposite.op X) ⟶ F) (j : J) : ↑((CategoryTheory.Limits.compYonedaSectionsEquiv F X).symm τ) j = (τ.app j).unop - CategoryTheory.Limits.limitCompYonedaIsoCocone_inv 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
{J : Type v} [CategoryTheory.SmallCategory J] {C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor J C) (X : C) : (CategoryTheory.Limits.limitCompYonedaIsoCocone F X).inv = TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.limit.lift (F.op.comp (CategoryTheory.yoneda.obj X)) (CategoryTheory.Limits.Types.coneOfSection ⋯))) PUnit.unit - CategoryTheory.Limits.opHomCompWhiskeringLimYonedaIsoCocones_hom_app_app_hom_apply_app 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
(J : Type v) [CategoryTheory.SmallCategory J] (C : Type u) [CategoryTheory.Category.{v, u} C] (X : (CategoryTheory.Functor J C)ᵒᵖ) (X✝ : C) (a : CategoryTheory.Limits.limit ((Opposite.unop X).op.comp (CategoryTheory.yoneda.obj X✝))) (j : J) : ((CategoryTheory.ConcreteCategory.hom (((CategoryTheory.Limits.opHomCompWhiskeringLimYonedaIsoCocones J C).hom.app X).app X✝)) a).app j = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.limit.π ((Opposite.unop X).op.comp (CategoryTheory.yoneda.obj X✝)) (Opposite.op j))) a - CategoryTheory.Limits.opHomCompWhiskeringLimYonedaIsoCocones_inv_app_app_hom_apply 📋 Mathlib.CategoryTheory.Limits.Types.Yoneda
(J : Type v) [CategoryTheory.SmallCategory J] (C : Type u) [CategoryTheory.Category.{v, u} C] (X : (CategoryTheory.Functor J C)ᵒᵖ) (X✝ : C) (t : Opposite.unop X ⟶ (CategoryTheory.Functor.const J).obj X✝) : (CategoryTheory.ConcreteCategory.hom (((CategoryTheory.Limits.opHomCompWhiskeringLimYonedaIsoCocones J C).inv.app X).app X✝)) t = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.limit.lift ((Opposite.unop X).op.comp (CategoryTheory.yoneda.obj X✝)) (CategoryTheory.Limits.Types.coneOfSection ⋯))) PUnit.unit - CategoryTheory.IsFiltered.iff_nonempty_limit 📋 Mathlib.CategoryTheory.Limits.Filtered
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.IsFiltered C ↔ ∀ {J : Type v} [inst : CategoryTheory.SmallCategory J] [CategoryTheory.FinCategory J] (F : CategoryTheory.Functor J C), ∃ X, Nonempty (CategoryTheory.Limits.limit (F.op.comp (CategoryTheory.yoneda.obj X))) - CategoryTheory.OverPresheafAux.YonedaCollection 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (X : C) : Type v - CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) : CategoryTheory.Functor Cᵒᵖ (Type v) - CategoryTheory.OverPresheafAux.YonedaCollection.yonedaEquivFst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : A.obj (Opposite.op X) - CategoryTheory.OverPresheafAux.YonedaCollection.map₂ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {X : C} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) {Y : C} (f : X ⟶ Y) (p : CategoryTheory.OverPresheafAux.YonedaCollection F Y) : CategoryTheory.OverPresheafAux.YonedaCollection F X - CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf_obj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (X : Cᵒᵖ) : (CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A F).obj X = CategoryTheory.OverPresheafAux.YonedaCollection F (Opposite.unop X) - CategoryTheory.OverPresheafAux.OverArrows 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : F ⟶ A) {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) : Type v - CategoryTheory.OverPresheafAux.YonedaCollection.map₂_id 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} : CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F (CategoryTheory.CategoryStruct.id X) = id - CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) : CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A F ⟶ A - CategoryTheory.OverPresheafAux.MakesOverArrow 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : F ⟶ A) {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (u : F.obj (Opposite.op X)) : Prop - CategoryTheory.OverPresheafAux.restrictedYonedaObj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : F ⟶ A) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v) - CategoryTheory.OverPresheafAux.OverArrows.val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} : CategoryTheory.OverPresheafAux.OverArrows η s → F.obj (Opposite.op X) - CategoryTheory.OverPresheafAux.YonedaCollection.fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : CategoryTheory.yoneda.obj X ⟶ A - CategoryTheory.OverPresheafAux.YonedaCollection.map₂_comp 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X Y Z : C} (f : X ⟶ Y) (g : Y ⟶ Z) : CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F (CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F f ∘ CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F g - CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA_app 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (x✝ : Cᵒᵖ) : (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F).app x✝ = TypeCat.ofHom CategoryTheory.OverPresheafAux.YonedaCollection.yonedaEquivFst - CategoryTheory.OverPresheafAux.OverArrows.ext 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {u v : CategoryTheory.OverPresheafAux.OverArrows η s} : u.val = v.val → u = v - CategoryTheory.OverPresheafAux.OverArrows.ext_iff 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {u v : CategoryTheory.OverPresheafAux.OverArrows η s} : u = v ↔ u.val = v.val - CategoryTheory.OverPresheafAux.yonedaCollectionFunctor 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor (CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (CategoryTheory.Functor Cᵒᵖ (Type v)) - CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf_map 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) {X✝ Y✝ : Cᵒᵖ} (f : X✝ ⟶ Y✝) : (CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A F).map f = TypeCat.ofHom (CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F f.unop) - CategoryTheory.OverPresheafAux.OverArrows.val_mk 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : F ⟶ A) {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (u : F.obj (Opposite.op X)) (h : CategoryTheory.OverPresheafAux.MakesOverArrow η s u) : CategoryTheory.OverPresheafAux.OverArrows.val ⟨u, h⟩ = u - CategoryTheory.overEquivPresheafCostructuredArrow 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Over A ≌ CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v) - CategoryTheory.OverPresheafAux.costructuredArrowPresheafToOver 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor (CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (CategoryTheory.Over A) - CategoryTheory.OverPresheafAux.restrictedYoneda 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor (CategoryTheory.Over A) (CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) - CategoryTheory.OverPresheafAux.YonedaCollection.snd 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : F.obj (Opposite.op (CategoryTheory.CostructuredArrow.mk p.fst)) - CategoryTheory.OverPresheafAux.counitAux 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) : F ≅ CategoryTheory.OverPresheafAux.restrictedYonedaObj (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F) - CategoryTheory.OverPresheafAux.OverArrows.yonedaCollectionPresheafToA_val_fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (p : CategoryTheory.OverPresheafAux.OverArrows (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F) s) : CategoryTheory.OverPresheafAux.YonedaCollection.fst p.val = s - CategoryTheory.OverPresheafAux.restrictedYonedaObj_obj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : F ⟶ A) (s : (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ) : (CategoryTheory.OverPresheafAux.restrictedYonedaObj η).obj s = CategoryTheory.OverPresheafAux.OverArrows η (Opposite.unop s).hom - CategoryTheory.OverPresheafAux.yonedaCollectionFunctor_obj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) : (CategoryTheory.OverPresheafAux.yonedaCollectionFunctor A).obj F = CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A F - CategoryTheory.OverPresheafAux.counitBackward 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : CategoryTheory.OverPresheafAux.OverArrows (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F) s.hom → F.obj (Opposite.op s) - CategoryTheory.OverPresheafAux.counitForward 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : F.obj (Opposite.op s) → CategoryTheory.OverPresheafAux.OverArrows (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F) s.hom - CategoryTheory.OverPresheafAux.counitAuxAux 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : F.obj (Opposite.op s) ≅ CategoryTheory.OverPresheafAux.OverArrows (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA F) s.hom - CategoryTheory.OverPresheafAux.YonedaCollection.mk 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (x : F.obj (Opposite.op (CategoryTheory.CostructuredArrow.mk s))) : CategoryTheory.OverPresheafAux.YonedaCollection F X - CategoryTheory.OverPresheafAux.OverArrows.costructuredArrowIso 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (s t : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : CategoryTheory.OverPresheafAux.OverArrows s.hom t.hom ≅ t ⟶ s - CategoryTheory.OverPresheafAux.YonedaCollection.map₂_fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X Y : C} (f : X ⟶ Y) (p : CategoryTheory.OverPresheafAux.YonedaCollection F Y) : (CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F f p).fst = CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) p.fst - CategoryTheory.OverPresheafAux.OverArrows.map₁ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F G : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {μ : G ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} (u : CategoryTheory.OverPresheafAux.OverArrows η s) (ε : F ⟶ G) (hε : CategoryTheory.CategoryStruct.comp ε μ = η) : CategoryTheory.OverPresheafAux.OverArrows μ s - CategoryTheory.OverPresheafAux.YonedaCollection.map₂_yonedaEquivFst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X Y : C} (f : X ⟶ Y) (p : CategoryTheory.OverPresheafAux.YonedaCollection F Y) : (CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F f p).yonedaEquivFst = (CategoryTheory.ConcreteCategory.hom (A.map f.op)) p.yonedaEquivFst - CategoryTheory.OverPresheafAux.OverArrows.yonedaArrow 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y : C} {η : CategoryTheory.yoneda.obj Y ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} (f : X ⟶ Y) (hf : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) η = s) : CategoryTheory.OverPresheafAux.OverArrows η s - CategoryTheory.OverPresheafAux.MakesOverArrow.of_yoneda_arrow 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y : C} {η : CategoryTheory.yoneda.obj Y ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {f : X ⟶ Y} (hf : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) η = s) : CategoryTheory.OverPresheafAux.MakesOverArrow η s f - CategoryTheory.OverPresheafAux.restrictedYoneda_obj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (η : CategoryTheory.Over A) : (CategoryTheory.OverPresheafAux.restrictedYoneda A).obj η = CategoryTheory.OverPresheafAux.restrictedYonedaObj η.hom - CategoryTheory.OverPresheafAux.YonedaCollection.map₁_id 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} : CategoryTheory.OverPresheafAux.YonedaCollection.map₁ (CategoryTheory.CategoryStruct.id F) = id - CategoryTheory.OverPresheafAux.YonedaCollection.mk_fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (x : F.obj (Opposite.op (CategoryTheory.CostructuredArrow.mk s))) : (CategoryTheory.OverPresheafAux.YonedaCollection.mk s x).fst = s - CategoryTheory.OverPresheafAux.OverArrows.map₂ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X Y : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {t : CategoryTheory.yoneda.obj Y ⟶ A} (u : CategoryTheory.OverPresheafAux.OverArrows η t) (f : X ⟶ Y) (hst : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) t = s) : CategoryTheory.OverPresheafAux.OverArrows η s - CategoryTheory.OverPresheafAux.OverArrows.map_val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y : C} {η : CategoryTheory.yoneda.obj Y ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} (p : CategoryTheory.OverPresheafAux.OverArrows η s) : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map p.val) η = s - CategoryTheory.OverPresheafAux.unitAux 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (η : CategoryTheory.Over A) : ((CategoryTheory.OverPresheafAux.restrictedYoneda A).comp (CategoryTheory.OverPresheafAux.costructuredArrowPresheafToOver A)).obj η ≅ η - CategoryTheory.OverPresheafAux.OverArrows.yonedaArrow_val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {Y : C} {η : CategoryTheory.yoneda.obj Y ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {f : X ⟶ Y} (hf : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) η = s) : (CategoryTheory.OverPresheafAux.OverArrows.yonedaArrow f hf).val = f - CategoryTheory.OverPresheafAux.costructuredArrowPresheafToOver_obj 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) (Y : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) : (CategoryTheory.OverPresheafAux.costructuredArrowPresheafToOver A).obj Y = CategoryTheory.CostructuredArrow.mk (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafToA Y) - CategoryTheory.OverPresheafAux.counitForward_val_fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) (x : F.obj (Opposite.op s)) : CategoryTheory.OverPresheafAux.YonedaCollection.fst (CategoryTheory.OverPresheafAux.counitForward F s x).val = s.hom - CategoryTheory.OverPresheafAux.unit 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : CategoryTheory.Functor.id (CategoryTheory.Over A) ≅ (CategoryTheory.OverPresheafAux.restrictedYoneda A).comp (CategoryTheory.OverPresheafAux.costructuredArrowPresheafToOver A) - CategoryTheory.OverPresheafAux.MakesOverArrow.map₁ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F G : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {μ : G ⟶ A} {ε : F ⟶ G} (hε : CategoryTheory.CategoryStruct.comp ε μ = η) {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {u : F.obj (Opposite.op X)} (h : CategoryTheory.OverPresheafAux.MakesOverArrow η s u) : CategoryTheory.OverPresheafAux.MakesOverArrow μ s ((CategoryTheory.ConcreteCategory.hom (ε.app (Opposite.op X))) u) - CategoryTheory.OverPresheafAux.OverArrows.map₁_val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F G : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {μ : G ⟶ A} {X : C} (s : CategoryTheory.yoneda.obj X ⟶ A) (u : CategoryTheory.OverPresheafAux.OverArrows η s) (ε : F ⟶ G) (hε : CategoryTheory.CategoryStruct.comp ε μ = η) : (u.map₁ ε hε).val = (CategoryTheory.ConcreteCategory.hom (ε.app (Opposite.op X))) u.val - CategoryTheory.OverPresheafAux.YonedaCollection.map₁ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} {G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) : CategoryTheory.OverPresheafAux.YonedaCollection F X → CategoryTheory.OverPresheafAux.YonedaCollection G X - CategoryTheory.OverPresheafAux.YonedaCollection.map₁_yonedaEquivFst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} {G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : (CategoryTheory.OverPresheafAux.YonedaCollection.map₁ η p).yonedaEquivFst = p.yonedaEquivFst - CategoryTheory.OverPresheafAux.yonedaCollectionPresheafMap₁ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) : CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A F ⟶ CategoryTheory.OverPresheafAux.yonedaCollectionPresheaf A G - CategoryTheory.OverPresheafAux.YonedaCollection.map₁_map₂ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} {G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) {Y : C} (f : X ⟶ Y) (p : CategoryTheory.OverPresheafAux.YonedaCollection F Y) : CategoryTheory.OverPresheafAux.YonedaCollection.map₂ G f (CategoryTheory.OverPresheafAux.YonedaCollection.map₁ η p) = CategoryTheory.OverPresheafAux.YonedaCollection.map₁ η (CategoryTheory.OverPresheafAux.YonedaCollection.map₂ F f p) - CategoryTheory.OverPresheafAux.restrictedYonedaObjMap₁ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F G : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {μ : G ⟶ A} (ε : F ⟶ G) (hε : CategoryTheory.CategoryStruct.comp ε μ = η) : CategoryTheory.OverPresheafAux.restrictedYonedaObj η ⟶ CategoryTheory.OverPresheafAux.restrictedYonedaObj μ - CategoryTheory.OverPresheafAux.MakesOverArrow.map₂ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X Y : C} (f : X ⟶ Y) {s : CategoryTheory.yoneda.obj X ⟶ A} {t : CategoryTheory.yoneda.obj Y ⟶ A} (hst : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) t = s) {u : F.obj (Opposite.op Y)} (h : CategoryTheory.OverPresheafAux.MakesOverArrow η t u) : CategoryTheory.OverPresheafAux.MakesOverArrow η s ((CategoryTheory.ConcreteCategory.hom (F.map f.op)) u) - CategoryTheory.OverPresheafAux.counitForward_counitBackward 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : CategoryTheory.OverPresheafAux.counitForward F s ∘ CategoryTheory.OverPresheafAux.counitBackward F s = id - CategoryTheory.OverPresheafAux.YonedaCollection.yonedaEquivFst_eq 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : p.yonedaEquivFst = CategoryTheory.yonedaEquiv p.fst - CategoryTheory.OverPresheafAux.OverArrows.map₂_val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X Y : C} (f : X ⟶ Y) {s : CategoryTheory.yoneda.obj X ⟶ A} {t : CategoryTheory.yoneda.obj Y ⟶ A} (hst : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) t = s) (u : CategoryTheory.OverPresheafAux.OverArrows η t) : (u.map₂ f hst).val = (CategoryTheory.ConcreteCategory.hom (F.map f.op)) u.val - CategoryTheory.OverPresheafAux.YonedaCollection.map₁_fst 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} {X : C} {G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) (p : CategoryTheory.OverPresheafAux.YonedaCollection F X) : (CategoryTheory.OverPresheafAux.YonedaCollection.map₁ η p).fst = p.fst - CategoryTheory.OverPresheafAux.yonedaCollectionPresheafMap₁_app 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} {F G : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : F ⟶ G) (x✝ : Cᵒᵖ) : (CategoryTheory.OverPresheafAux.yonedaCollectionPresheafMap₁ η).app x✝ = TypeCat.ofHom (CategoryTheory.OverPresheafAux.YonedaCollection.map₁ η) - CategoryTheory.OverPresheafAux.OverArrows.map₁_map₂ 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F G : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {μ : G ⟶ A} (ε : F ⟶ G) (hε : CategoryTheory.CategoryStruct.comp ε μ = η) {X Y : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {t : CategoryTheory.yoneda.obj Y ⟶ A} (f : X ⟶ Y) (hf : CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f) t = s) (u : CategoryTheory.OverPresheafAux.OverArrows η t) : (u.map₁ ε hε).map₂ f hf = (u.map₂ f hf).map₁ ε hε - CategoryTheory.OverPresheafAux.counitAuxAux_hom 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : (CategoryTheory.OverPresheafAux.counitAuxAux F s).hom = TypeCat.ofHom (CategoryTheory.OverPresheafAux.counitForward F s) - CategoryTheory.OverPresheafAux.counitAuxAux_inv 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : (CategoryTheory.OverPresheafAux.counitAuxAux F s).inv = TypeCat.ofHom (CategoryTheory.OverPresheafAux.counitBackward F s) - CategoryTheory.OverPresheafAux.counitBackward_counitForward 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor Cᵒᵖ (Type v)} (F : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)) (s : CategoryTheory.CostructuredArrow CategoryTheory.yoneda A) : CategoryTheory.OverPresheafAux.counitBackward F s ∘ CategoryTheory.OverPresheafAux.counitForward F s = id - CategoryTheory.OverPresheafAux.yonedaCollectionFunctor_map 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) {X✝ Y✝ : CategoryTheory.Functor (CategoryTheory.CostructuredArrow CategoryTheory.yoneda A)ᵒᵖ (Type v)} (η : X✝ ⟶ Y✝) : (CategoryTheory.OverPresheafAux.yonedaCollectionFunctor A).map η = CategoryTheory.OverPresheafAux.yonedaCollectionPresheafMap₁ η - CategoryTheory.OverPresheafAux.toOverYonedaCompRestrictedYoneda 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : CategoryTheory.Functor Cᵒᵖ (Type v)) : (CategoryTheory.CostructuredArrow.toOver CategoryTheory.yoneda A).comp (CategoryTheory.OverPresheafAux.restrictedYoneda A) ≅ CategoryTheory.yoneda - CategoryTheory.OverPresheafAux.OverArrows.app_val 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} (p : CategoryTheory.OverPresheafAux.OverArrows η s) : (CategoryTheory.ConcreteCategory.hom (η.app (Opposite.op X))) p.val = CategoryTheory.yonedaEquiv s - CategoryTheory.OverPresheafAux.MakesOverArrow.app 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {u : F.obj (Opposite.op X)} (self : CategoryTheory.OverPresheafAux.MakesOverArrow η s u) : (CategoryTheory.ConcreteCategory.hom (η.app (Opposite.op X))) u = CategoryTheory.yonedaEquiv s - CategoryTheory.OverPresheafAux.MakesOverArrow.mk 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {u : F.obj (Opposite.op X)} (app : (CategoryTheory.ConcreteCategory.hom (η.app (Opposite.op X))) u = CategoryTheory.yonedaEquiv s) : CategoryTheory.OverPresheafAux.MakesOverArrow η s u - CategoryTheory.OverPresheafAux.MakesOverArrow.of_arrow 📋 Mathlib.CategoryTheory.Comma.Presheaf.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {A F : CategoryTheory.Functor Cᵒᵖ (Type v)} {η : F ⟶ A} {X : C} {s : CategoryTheory.yoneda.obj X ⟶ A} {f : CategoryTheory.yoneda.obj X ⟶ F} (hf : CategoryTheory.CategoryStruct.comp f η = s) : CategoryTheory.OverPresheafAux.MakesOverArrow η s (CategoryTheory.yonedaEquiv f)
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 69fae59