Loogle!
Result
Found 207 declarations mentioning CategoryTheory.Functor.Elements. Of these, only the first 200 are shown.
- CategoryTheory.Functor.Elements 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : Type (max u w) - CategoryTheory.categoryOfElements 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Category.{v, max u w} F.Elements - CategoryTheory.groupoidOfElements 📋 Mathlib.CategoryTheory.Elements
{G : Type u} [CategoryTheory.Groupoid G] (F : CategoryTheory.Functor G (Type w)) : CategoryTheory.Groupoid F.Elements - CategoryTheory.Functor.Elements.initialOfCorepresentableBy 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type u_1)} {X : C} (h : F.CorepresentableBy X) : F.Elements - CategoryTheory.CategoryOfElements.π 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor F.Elements C - CategoryTheory.CategoryOfElements.instLocallySmallElements 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.LocallySmall.{w, v, max u w} F.Elements - CategoryTheory.Functor.elementsMk 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : C) (x : F.obj X) : F.Elements - CategoryTheory.Functor.Elements.essentiallySmall 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.EssentiallySmall.{w, v, u} C] : CategoryTheory.EssentiallySmall.{w, v, max u w} F.Elements - CategoryTheory.CategoryOfElements.instFaithfulElementsπ 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.π F).Faithful - CategoryTheory.CategoryOfElements.instReflectsIsomorphismsElementsπ 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.π F).ReflectsIsomorphisms - CategoryTheory.Functor.Elements.initialOfRepresentableBy 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type u_1)} {X : C} (h : F.RepresentableBy X) : F.Elements - CategoryTheory.Functor.Elements.isInitialOfCorepresentableBy 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type u_1)} {X : C} (h : F.CorepresentableBy X) : CategoryTheory.Limits.IsInitial (CategoryTheory.Functor.Elements.initialOfCorepresentableBy h) - CategoryTheory.CategoryOfElements.fromStructuredArrow 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor (CategoryTheory.StructuredArrow PUnit.{w + 1} F) F.Elements - CategoryTheory.CategoryOfElements.structuredArrowEquivalence 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : F.Elements ≌ CategoryTheory.StructuredArrow PUnit.{w + 1} F - CategoryTheory.CategoryOfElements.toStructuredArrow 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor F.Elements (CategoryTheory.StructuredArrow PUnit.{w + 1} F) - CategoryTheory.Functor.Elements.initial 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (A : C) : (CategoryTheory.yoneda.obj A).Elements - CategoryTheory.Functor.elementsFunctor_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor.elementsFunctor.obj F = CategoryTheory.Cat.of F.Elements - CategoryTheory.Functor.Elements.isInitialOfRepresentableBy 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type u_1)} {X : C} (h : F.RepresentableBy X) : CategoryTheory.Limits.IsInitial (CategoryTheory.Functor.Elements.initialOfRepresentableBy h) - CategoryTheory.CategoryOfElements.π_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : F.Elements) : (CategoryTheory.CategoryOfElements.π F).obj X = X.fst - CategoryTheory.Functor.Elements.precomp 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{u_2, u_1} D] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D (Type w)) : CategoryTheory.Functor (F.comp G).Elements G.Elements - CategoryTheory.CategoryOfElements.map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} (α : F₁ ⟶ F₂) : CategoryTheory.Functor F₁.Elements F₂.Elements - CategoryTheory.NatTrans.mapElements 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C (Type w)} (φ : F ⟶ G) : CategoryTheory.Functor F.Elements G.Elements - CategoryTheory.CategoryOfElements.structuredArrowEquivalence_functor 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.structuredArrowEquivalence F).functor = CategoryTheory.CategoryOfElements.toStructuredArrow F - CategoryTheory.CategoryOfElements.structuredArrowEquivalence_inverse 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.structuredArrowEquivalence F).inverse = CategoryTheory.CategoryOfElements.fromStructuredArrow F - 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.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.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.map_π 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} (α : F₁ ⟶ F₂) : (CategoryTheory.CategoryOfElements.map α).comp (CategoryTheory.CategoryOfElements.π F₂) = CategoryTheory.CategoryOfElements.π F₁ - CategoryTheory.CategoryOfElements.map_obj_fst 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} (α : F₁ ⟶ F₂) (t : F₁.Elements) : ((CategoryTheory.CategoryOfElements.map α).obj t).fst = t.fst - 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.Functor.elementsFunctor_map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {X✝ Y✝ : CategoryTheory.Functor C (Type w)} (n : X✝ ⟶ Y✝) : CategoryTheory.Functor.elementsFunctor.map n = (CategoryTheory.NatTrans.mapElements n).toCatHom - CategoryTheory.Functor.Elements.precomp_obj_fst 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{u_2, u_1} D] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D (Type w)) (x : (F.comp G).Elements) : ((CategoryTheory.Functor.Elements.precomp F G).obj x).fst = F.obj x.fst - CategoryTheory.Functor.Elements.precomp_obj_snd 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{u_2, u_1} D] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D (Type w)) (x : (F.comp G).Elements) : ((CategoryTheory.Functor.Elements.precomp F G).obj x).snd = x.snd - CategoryTheory.CategoryOfElements.structuredArrowEquivalence_unitIso 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.structuredArrowEquivalence F).unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id F.Elements) - CategoryTheory.CategoryOfElements.toStructuredArrow_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : F.Elements) : (CategoryTheory.CategoryOfElements.toStructuredArrow F).obj X = { left := { as := PUnit.unit }, right := X.fst, hom := TypeCat.ofHom fun x => X.snd } - CategoryTheory.CategoryOfElements.fromStructuredArrow_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.StructuredArrow PUnit.{w + 1} F) : (CategoryTheory.CategoryOfElements.fromStructuredArrow F).obj X = ⟨X.right, (CategoryTheory.ConcreteCategory.hom X.hom) PUnit.unit⟩ - 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.NatTrans.mapElements_obj 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C (Type w)} (φ : F ⟶ G) (x✝ : F.Elements) : (CategoryTheory.NatTrans.mapElements φ).obj x✝ = match x✝ with | ⟨X, x⟩ => ⟨X, (CategoryTheory.ConcreteCategory.hom (φ.app X)) x⟩ - 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.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.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.structuredArrowEquivalence_counitIso 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.CategoryOfElements.structuredArrowEquivalence F).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.CategoryOfElements.fromStructuredArrow F).comp (CategoryTheory.CategoryOfElements.toStructuredArrow F)) - CategoryTheory.CategoryOfElements.map_obj_snd 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} (α : F₁ ⟶ F₂) (t : F₁.Elements) : ((CategoryTheory.CategoryOfElements.map α).obj t).snd = (CategoryTheory.ConcreteCategory.hom (α.app t.fst)) t.snd - 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.homMk 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (f : x.fst ⟶ y.fst) (hf : (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd = y.snd) : x ⟶ y - CategoryTheory.Functor.Elements.ext 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (h₁ : x.fst = y.fst) (h₂ : (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.eqToHom h₁))) x.snd = y.snd) : x = y - 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.isoMk 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (e : x.fst ≅ y.fst) (he : (CategoryTheory.ConcreteCategory.hom (F.map e.hom)) x.snd = y.snd) : x ≅ y - CategoryTheory.CategoryOfElements.id_val 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {p : F.Elements} : ↑(CategoryTheory.CategoryStruct.id p) = CategoryTheory.CategoryStruct.id p.fst - CategoryTheory.CategoryOfElements.isoMk_hom 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (e : x.fst ≅ y.fst) (he : (CategoryTheory.ConcreteCategory.hom (F.map e.hom)) x.snd = y.snd) : (CategoryTheory.CategoryOfElements.isoMk x y e he).hom = CategoryTheory.CategoryOfElements.homMk x y e.hom he - CategoryTheory.CategoryOfElements.π_map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X✝ Y✝ : F.Elements} (f : X✝ ⟶ Y✝) : (CategoryTheory.CategoryOfElements.π F).map f = ↑f - CategoryTheory.CategoryOfElements.isoMk_inv 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (e : x.fst ≅ y.fst) (he : (CategoryTheory.ConcreteCategory.hom (F.map e.hom)) x.snd = y.snd) : (CategoryTheory.CategoryOfElements.isoMk x y e he).inv = CategoryTheory.CategoryOfElements.homMk y x e.inv ⋯ - 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.to_comma_map_right 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X Y : F.Elements} (f : X ⟶ Y) : CategoryTheory.StructuredArrow.Hom.right ((CategoryTheory.CategoryOfElements.toStructuredArrow F).map f) = ↑f - 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.map_snd 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {p q : F.Elements} (f : p ⟶ q) : (CategoryTheory.ConcreteCategory.hom (F.map ↑f)) p.snd = q.snd - CategoryTheory.CategoryOfElements.homMk_coe 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} (x y : F.Elements) (f : x.fst ⟶ y.fst) (hf : (CategoryTheory.ConcreteCategory.hom (F.map f)) x.snd = y.snd) : ↑(CategoryTheory.CategoryOfElements.homMk x y f hf) = f - CategoryTheory.CategoryOfElements.ext 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {x y : F.Elements} (f g : x ⟶ y) (w : ↑f = ↑g) : f = g - CategoryTheory.CategoryOfElements.ext_iff 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {x y : F.Elements} {f g : x ⟶ y} : f = g ↔ ↑f = ↑g - 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.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.fromStructuredArrow_map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X Y : CategoryTheory.StructuredArrow PUnit.{w + 1} F} (f : X ⟶ Y) : (CategoryTheory.CategoryOfElements.fromStructuredArrow F).map f = ⟨CategoryTheory.StructuredArrow.Hom.right f, ⋯⟩ - CategoryTheory.CategoryOfElements.comp_val 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {p q r : F.Elements} {f : p ⟶ q} {g : q ⟶ r} : ↑(CategoryTheory.CategoryStruct.comp f g) = CategoryTheory.CategoryStruct.comp ↑f ↑g - 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.Functor.Elements.precomp_map_coe 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{u_2, u_1} D] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D (Type w)) {X✝ Y✝ : (F.comp G).Elements} (f : X✝ ⟶ Y✝) : ↑((CategoryTheory.Functor.Elements.precomp F G).map f) = F.map ↑f - CategoryTheory.NatTrans.mapElements_map 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F G : CategoryTheory.Functor C (Type w)} (φ : F ⟶ G) {p q : F.Elements} (x✝ : p ⟶ q) : (CategoryTheory.NatTrans.mapElements φ).map x✝ = match x✝ with | ⟨f, h⟩ => ⟨f, ⋯⟩ - 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.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.map_map_coe 📋 Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F₁ F₂ : CategoryTheory.Functor C (Type w)} (α : F₁ ⟶ F₂) {t₁ t₂ : F₁.Elements} (k : t₁ ⟶ t₂) : ↑((CategoryTheory.CategoryOfElements.map α).map k) = ↑k - 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.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.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.Grothendieck.grothendieckTypeToCat 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat) ≌ G.Elements - CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor (CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) G.Elements - CategoryTheory.Grothendieck.grothendieckTypeToCatInverse 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) : CategoryTheory.Functor G.Elements (CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) - CategoryTheory.Grothendieck.grothendieckTypeToCatInverse_obj_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ((CategoryTheory.Grothendieck.grothendieckTypeToCatInverse G).obj X).base = X.fst - CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor_obj_fst 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor G).obj X).fst = X.base - CategoryTheory.Grothendieck.grothendieckTypeToCat_inverse_obj_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).inverse.obj X).base = X.fst - CategoryTheory.Grothendieck.grothendieckTypeToCatInverse_obj_fiber_as 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ((CategoryTheory.Grothendieck.grothendieckTypeToCatInverse G).obj X).fiber.as = X.snd - CategoryTheory.Grothendieck.grothendieckTypeToCat_functor_obj_fst 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).functor.obj X).fst = X.base - CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor_obj_snd 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor G).obj X).snd = X.fiber.as - CategoryTheory.Grothendieck.grothendieckTypeToCat_inverse_obj_fiber_as 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).inverse.obj X).fiber.as = X.snd - CategoryTheory.Grothendieck.grothendieckTypeToCat_functor_obj_snd 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).functor.obj X).snd = X.fiber.as - CategoryTheory.Grothendieck.grothendieckTypeToCatInverse_map_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) {X✝ Y✝ : G.Elements} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Grothendieck.grothendieckTypeToCatInverse G).map f).base = ↑f - CategoryTheory.Grothendieck.grothendieckTypeToCat_inverse_map_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) {X✝ Y✝ : G.Elements} (f : X✝ ⟶ Y✝) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).inverse.map f).base = ↑f - CategoryTheory.Grothendieck.grothendieckTypeToCat_unitIso_hom_app_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).unitIso.hom.app X).base = CategoryTheory.CategoryStruct.id X.base - CategoryTheory.Grothendieck.grothendieckTypeToCat_unitIso_inv_app_base 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).unitIso.inv.app X).base = CategoryTheory.CategoryStruct.id X.base - CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor_map_coe 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) {X✝ Y✝ : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)} (f : X✝ ⟶ Y✝) : ↑((CategoryTheory.Grothendieck.grothendieckTypeToCatFunctor G).map f) = f.base - CategoryTheory.Grothendieck.grothendieckTypeToCat_functor_map_coe 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) {X✝ Y✝ : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)} (f : X✝ ⟶ Y✝) : ↑((CategoryTheory.Grothendieck.grothendieckTypeToCat G).functor.map f) = f.base - CategoryTheory.Grothendieck.grothendieckTypeToCat_counitIso_hom_app_coe 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ↑((CategoryTheory.Grothendieck.grothendieckTypeToCat G).counitIso.hom.app X) = CategoryTheory.CategoryStruct.id X.fst - CategoryTheory.Grothendieck.grothendieckTypeToCat_counitIso_inv_app_coe 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : G.Elements) : ↑((CategoryTheory.Grothendieck.grothendieckTypeToCat G).counitIso.inv.app X) = CategoryTheory.CategoryStruct.id X.fst - CategoryTheory.Grothendieck.grothendieckTypeToCat_unitIso_hom_app_fiber 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).unitIso.hom.app X).fiber = CategoryTheory.eqToHom ⋯ - CategoryTheory.Grothendieck.grothendieckTypeToCat_unitIso_inv_app_fiber 📋 Mathlib.CategoryTheory.Grothendieck
{C : Type u} [CategoryTheory.Category.{v, u} C] (G : CategoryTheory.Functor C (Type w)) (X : CategoryTheory.Grothendieck (G.comp CategoryTheory.typeToCat)) : ((CategoryTheory.Grothendieck.grothendieckTypeToCat G).unitIso.inv.app X).fiber = CategoryTheory.eqToHom ⋯ - CategoryTheory.Presheaf.functorToRepresentables 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (P : CategoryTheory.Functor Cᵒᵖ (Type (max w v₁))) : CategoryTheory.Functor P.Elementsᵒᵖ (CategoryTheory.Functor Cᵒᵖ (Type (max w v₁))) - CategoryTheory.Presheaf.coconeOfRepresentable 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (P : CategoryTheory.Functor Cᵒᵖ (Type (max w v₁))) : CategoryTheory.Limits.Cocone (CategoryTheory.Presheaf.functorToRepresentables P) - CategoryTheory.Presheaf.colimitOfRepresentable 📋 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.coconeOfRepresentable P) - CategoryTheory.Presheaf.coconeOfRepresentable_pt 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] (P : CategoryTheory.Functor Cᵒᵖ (Type (max w v₁))) : (CategoryTheory.Presheaf.coconeOfRepresentable P).pt = P - CategoryTheory.Functor.Elements.instHasInitialObjOppositeTypeFlipShrinkYonedaOp 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (X : C) : CategoryTheory.Limits.HasInitial (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip.obj (Opposite.op X)).Elements - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : CategoryTheory.Limits.Cocone ((CategoryTheory.CategoryOfElements.π F).op.comp (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.obj X)) - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaFlip 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Limits.Cocone ((CategoryTheory.CategoryOfElements.π F).op.comp CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip) - CategoryTheory.Functor.Elements.isColimitCoconeπOpCompShrinkYonedaObj 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : CategoryTheory.Limits.IsColimit (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X) - CategoryTheory.Functor.Elements.isColimitCoconeπOpCompShrinkYonedaFlip 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Limits.IsColimit (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaFlip F) - CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj_pt 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) : (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X).pt = F.obj X - CategoryTheory.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.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasColimitsOfShape F.Elementsᵒᵖ (Type w)] : CategoryTheory.shrinkYoneda.{w, v₁, u₁}.comp (((CategoryTheory.Functor.whiskeringLeft F.Elementsᵒᵖ Cᵒᵖ (Type w)).obj (CategoryTheory.CategoryOfElements.π F).op).comp CategoryTheory.Limits.colim) ≅ F - CategoryTheory.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.Functor.Elements.isInitialElementsMkShrinkYonedaObjObjEquivId 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (X : C) : CategoryTheory.Limits.IsInitial ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.flip.obj (Opposite.op X)).elementsMk X (CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.id X))) - CategoryTheory.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.coconeOfRepresentable_naturality 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] {P₁ P₂ : CategoryTheory.Functor Cᵒᵖ (Type (max w v₁))} (α : P₁ ⟶ P₂) (j : P₁.Elementsᵒᵖ) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.Presheaf.coconeOfRepresentable P₁).ι.app j) α = (CategoryTheory.Presheaf.coconeOfRepresentable P₂).ι.app ((CategoryTheory.CategoryOfElements.map α).op.obj j) - 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.Functor.Elements.coconeπOpCompShrinkYonedaObj_ι_app 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) (X : C) (u : F.Elementsᵒᵖ) : (CategoryTheory.Functor.Elements.coconeπOpCompShrinkYonedaObj F X).ι.app u = TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) (Opposite.unop u).snd - CategoryTheory.Functor.Elements.shrinkYoneda_map_app_coconeπOpCompShrinkYonedaObj_ι_app 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) {X₁ X₂ : C} (f : X₁ ⟶ X₂) (u : F.Elements) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.map f).app (Opposite.op u.fst)) (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) = CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) (F.map f) - CategoryTheory.Functor.Elements.shrinkYoneda_map_app_coconeπOpCompShrinkYonedaObj_ι_app_assoc 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) {X₁ X₂ : C} (f : X₁ ⟶ X₂) (u : F.Elements) {Z : Type w} (h : F.obj X₂ ⟶ Z) : CategoryTheory.CategoryStruct.comp ((CategoryTheory.shrinkYoneda.{w, v₁, u₁}.map f).app (Opposite.op u.fst)) (CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) h) = CategoryTheory.CategoryStruct.comp (TypeCat.ofHom fun t => (CategoryTheory.ConcreteCategory.hom (F.map (CategoryTheory.shrinkYonedaObjObjEquiv t))) u.snd) (CategoryTheory.CategoryStruct.comp (F.map f) h) - CategoryTheory.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.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso_inv_app_apply 📋 Mathlib.CategoryTheory.Limits.Presheaf
{C : Type u₁} [CategoryTheory.Category.{v₁, u₁} C] [CategoryTheory.LocallySmall.{w, v₁, u₁} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasColimitsOfShape F.Elementsᵒᵖ (Type w)] (u : F.Elements) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.Functor.Elements.shrinkYonedaCompWhiskeringLeftObjπCompColimIso F).inv.app u.fst)) u.snd = (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.colimit.ι ((CategoryTheory.CategoryOfElements.π F).op.comp (CategoryTheory.shrinkYoneda.{w, v₁, u₁}.obj u.fst)) (Opposite.op u))) (CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.id (Opposite.unop ((CategoryTheory.CategoryOfElements.π F).op.obj (Opposite.op u))))) - CategoryTheory.instIsCofilteredElementsCompOfRepresentablyFlat 📋 Mathlib.CategoryTheory.Functor.Flat
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D (Type u_4)) [CategoryTheory.RepresentablyFlat F] [CategoryTheory.IsCofiltered G.Elements] : CategoryTheory.IsCofiltered (F.comp G).Elements - SSet.S.equivElements 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} : X.S ≃ CategoryTheory.Functor.Elements X - SSet.S.equivElements_apply_fst 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (SSet.S.equivElements s).fst = Opposite.op { len := s.dim } - SSet.S.equivElements_symm_apply_dim 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (a✝ : CategoryTheory.Functor.Elements X) : (SSet.S.equivElements.symm a✝).dim = a✝.1.1.len - SSet.S.equivElements_apply_snd 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (s : X.S) : (SSet.S.equivElements s).snd = s.simplex - SSet.S.equivElements_symm_apply_simplex 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (a✝ : CategoryTheory.Functor.Elements X) : (SSet.S.equivElements.symm a✝).simplex = a✝.snd - SSet.S.le_iff_nonempty_hom 📋 Mathlib.AlgebraicTopology.SimplicialSet.Simplices
{X : SSet} (x y : X.S) : x ≤ y ↔ Nonempty (SSet.S.equivElements y ⟶ SSet.S.equivElements x) - CategoryTheory.CategoryOfElements.instHasInitialElementsOfIsCorepresentable 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type u_1)} [F.IsCorepresentable] : CategoryTheory.Limits.HasInitial F.Elements - CategoryTheory.Functor.Elements.isCorepresentable_of_hasInitial 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasInitial F.Elements] : F.IsCorepresentable - CategoryTheory.Functor.Elements.hasInitial_iff_isCorepresentable 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : CategoryTheory.Limits.HasInitial F.Elements ↔ F.IsCorepresentable - CategoryTheory.CategoryOfElements.instHasInitialElementsOppositeOfIsRepresentable 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type u_1)} [F.IsRepresentable] : CategoryTheory.Limits.HasInitial F.Elements - CategoryTheory.Functor.Elements.isRepresentable_of_hasInitial 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type w)) [CategoryTheory.Limits.HasInitial F.Elements] : F.IsRepresentable - CategoryTheory.Functor.Elements.hasInitial_iff_isRepresentable 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cᵒᵖ (Type w)) : CategoryTheory.Limits.HasInitial F.Elements ↔ F.IsRepresentable - CategoryTheory.CategoryOfElements.instHasLimitsOfShapeElements 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : CategoryTheory.Limits.HasLimitsOfShape I A.Elements - CategoryTheory.Functor.Elements.corepresentableByOfIsInitial 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor C (Type w)} {E : F.Elements} (he : CategoryTheory.Limits.IsInitial E) : F.CorepresentableBy E.fst - CategoryTheory.CategoryOfElements.instCreatesLimitsOfShapeElementsπ 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : CategoryTheory.CreatesLimitsOfShape I (CategoryTheory.CategoryOfElements.π A) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : CategoryTheory.Limits.Cone F - CategoryTheory.CategoryOfElements.instCreatesLimitElementsπ 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] (F : CategoryTheory.Functor I A.Elements) : CategoryTheory.CreatesLimit F (CategoryTheory.CategoryOfElements.π A) - CategoryTheory.Functor.Elements.representableByOfIsInitial 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor Cᵒᵖ (Type w)} {E : F.Elements} (he : CategoryTheory.Limits.IsInitial E) : F.RepresentableBy (Opposite.unop E.fst) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.isLimit 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : CategoryTheory.Limits.IsLimit (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement' 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) : CategoryTheory.Limits.limit ((F.comp (CategoryTheory.CategoryOfElements.π A)).comp A) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : A.obj (CategoryTheory.Limits.limit (F.comp (CategoryTheory.CategoryOfElements.π A))) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone_pt_fst 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F).pt.fst = CategoryTheory.Limits.limit (F.comp (CategoryTheory.CategoryOfElements.π A)) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone_pt_snd 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F).pt.snd = CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement F - CategoryTheory.CategoryOfElements.CreatesLimitsAux.isValidLift 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] : (CategoryTheory.CategoryOfElements.π A).mapCone (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F) ≅ CategoryTheory.Limits.limit.cone (F.comp (CategoryTheory.CategoryOfElements.π A)) - CategoryTheory.CategoryOfElements.CreatesLimitsAux.π_liftedConeElement' 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) (i : I) : (CategoryTheory.ConcreteCategory.hom (CategoryTheory.Limits.limit.π ((F.comp (CategoryTheory.CategoryOfElements.π A)).comp A) i)) (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement' F) = (F.obj i).snd - CategoryTheory.CategoryOfElements.CreatesLimitsAux.map_π_liftedConeElement 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] (i : I) : (CategoryTheory.ConcreteCategory.hom (A.map (CategoryTheory.Limits.limit.π (F.comp (CategoryTheory.CategoryOfElements.π A)) i))) (CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement F) = (F.obj i).snd - CategoryTheory.CategoryOfElements.CreatesLimitsAux.map_lift_mapCone 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] (c : CategoryTheory.Limits.Cone F) : (CategoryTheory.ConcreteCategory.hom (A.map (CategoryTheory.Limits.limit.lift (F.comp (CategoryTheory.CategoryOfElements.π A)) ((CategoryTheory.CategoryOfElements.π A).mapCone c)))) c.pt.snd = CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedConeElement F - CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone_π_app_coe 📋 Mathlib.CategoryTheory.Limits.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] {A : CategoryTheory.Functor C (Type w)} {I : Type u₁} [CategoryTheory.Category.{v₁, u₁} I] [Small.{w, u₁} I] (F : CategoryTheory.Functor I A.Elements) [CategoryTheory.Limits.HasLimitsOfShape I C] [CategoryTheory.Limits.PreservesLimitsOfShape I A] (i : I) : ↑((CategoryTheory.CategoryOfElements.CreatesLimitsAux.liftedCone F).π.app i) = CategoryTheory.Limits.limit.π (F.comp (CategoryTheory.CategoryOfElements.π A)) i - CategoryTheory.GrothendieckTopology.Point.initiallySmall 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (self : J.Point) : CategoryTheory.InitiallySmall self.fiber.Elements - CategoryTheory.GrothendieckTopology.Point.isCofiltered 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (self : J.Point) : CategoryTheory.IsCofiltered self.fiber.Elements - CategoryTheory.GrothendieckTopology.Point.instIsSiftedOppositeElementsFiber 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) : CategoryTheory.IsSifted Φ.fiber.Elementsᵒᵖ - CategoryTheory.GrothendieckTopology.Point.instHasColimitsOfShapeOppositeElementsFiber 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] : CategoryTheory.Limits.HasColimitsOfShape Φ.fiber.Elementsᵒᵖ A - CategoryTheory.GrothendieckTopology.Point.instHasExactColimitsOfShapeOppositeElementsFiberOfLocallySmallOfAB5OfSizeOfHasFiniteLimits 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] [CategoryTheory.LocallySmall.{w, v, u} C] [CategoryTheory.AB5OfSize.{w, w, v', u'} A] [CategoryTheory.Limits.HasFiniteLimits A] : CategoryTheory.HasExactColimitsOfShape Φ.fiber.Elementsᵒᵖ A - CategoryTheory.GrothendieckTopology.Point.instPreservesColimitsOfShapeOppositeElementsFiberForget 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] {FC : A → A → Type u_1} {CC : A → Type w'} [(X Y : A) → FunLike (FC X Y) (CC X) (CC Y)] [CategoryTheory.ConcreteCategory A FC] [CategoryTheory.Limits.PreservesFilteredColimitsOfSize.{w, w, v', w', u', w' + 1} (CategoryTheory.forget A)] [CategoryTheory.LocallySmall.{w, v, u} C] : CategoryTheory.Limits.PreservesColimitsOfShape Φ.fiber.Elementsᵒᵖ (CategoryTheory.forget A) - CategoryTheory.GrothendieckTopology.Point.presheafFiberCocone 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] (P : CategoryTheory.Functor Cᵒᵖ A) : CategoryTheory.Limits.Cocone ((CategoryTheory.CategoryOfElements.π Φ.fiber).op.comp P) - CategoryTheory.GrothendieckTopology.Point.isColimitPresheafFiberCocone 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] (P : CategoryTheory.Functor Cᵒᵖ A) : CategoryTheory.Limits.IsColimit (Φ.presheafFiberCocone P) - CategoryTheory.GrothendieckTopology.Point.presheafFiberCocone_pt 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] (P : CategoryTheory.Functor Cᵒᵖ A) : (Φ.presheafFiberCocone P).pt = Φ.presheafFiber.obj P - CategoryTheory.GrothendieckTopology.Point.mk 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (fiber : CategoryTheory.Functor C (Type w)) (isCofiltered : CategoryTheory.IsCofiltered fiber.Elements := by infer_instance) (initiallySmall : CategoryTheory.InitiallySmall fiber.Elements := by infer_instance) (jointly_surjective : ∀ {X : C}, ∀ R ∈ J X, ∀ (x : fiber.obj X), ∃ Y f, ∃ (_ : R.arrows f), ∃ y, (CategoryTheory.ConcreteCategory.hom (fiber.map f)) y = x) : J.Point - CategoryTheory.GrothendieckTopology.Point.presheafFiberCocone_ι_app 📋 Mathlib.CategoryTheory.Sites.Point.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v', u'} A] (P : CategoryTheory.Functor Cᵒᵖ A) (x : Φ.fiber.Elementsᵒᵖ) : (Φ.presheafFiberCocone P).ι.app x = Φ.toPresheafFiber (Opposite.unop x).fst (Opposite.unop x).snd P - CategoryTheory.Functor.isCofiltered_elements 📋 Mathlib.CategoryTheory.Functor.TypeValuedFlat
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) [CategoryTheory.Limits.HasFiniteLimits C] [CategoryTheory.Limits.PreservesFiniteLimits F] : CategoryTheory.IsCofiltered F.Elements - CategoryTheory.FunctorToTypes.instIsCofilteredElementsOverFromOverFunctor 📋 Mathlib.CategoryTheory.Functor.TypeValuedFlat
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X : C} (x : F.obj X) [CategoryTheory.IsCofiltered F.Elements] : CategoryTheory.IsCofiltered (CategoryTheory.FunctorToTypes.fromOverFunctor F x).Elements - CategoryTheory.FunctorToTypes.fromOverFunctorElementsEquivalence 📋 Mathlib.CategoryTheory.Functor.TypeValuedFlat
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) {X : C} (x : F.obj X) : (CategoryTheory.FunctorToTypes.fromOverFunctor F x).Elements ≌ CategoryTheory.Over (F.elementsMk X x) - AlgebraicGeometry.Scheme.instIsCofilteredElementsEtaleCompOverForgetObjOppositeFunctorTypeCoyonedaOpMk 📋 Mathlib.AlgebraicGeometry.Sites.EtalePoint
{S : AlgebraicGeometry.Scheme} {Ω : Type u} [Field Ω] (s : AlgebraicGeometry.Spec (CommRingCat.of Ω) ⟶ S) : CategoryTheory.IsCofiltered ((AlgebraicGeometry.Scheme.Etale.forget S).comp (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.Over.mk s)))).Elements - CategoryTheory.Limits.WeightedCone.π 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.WeightedCone W F) {j : J} (x : W.obj j) : c.pt ⟶ F.obj j - CategoryTheory.Limits.WeightedCone.IsLimit.iso 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) [CategoryTheory.Limits.HasWeightedLimit W F] : W.weightedLimObjObj F ≅ c.pt - CategoryTheory.Limits.WeightedCone.IsLimit.iso_hom_π 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) [CategoryTheory.Limits.HasWeightedLimit W F] {j : J} (x : W.obj j) : CategoryTheory.CategoryStruct.comp hc.iso.hom (c.π x) = W.weightedLimObjObjπ F x - CategoryTheory.Limits.WeightedCone.IsLimit.iso_inv_π 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) [CategoryTheory.Limits.HasWeightedLimit W F] {j : J} (x : W.obj j) : CategoryTheory.CategoryStruct.comp hc.iso.inv (W.weightedLimObjObjπ F x) = c.π x - CategoryTheory.Limits.WeightedCone.mk_pt 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} (pt : C) (π : ⦃j : J⦄ → W.obj j → (pt ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x) := by cat_disch) : (CategoryTheory.Limits.WeightedCone.mk pt π hπ).pt = pt - CategoryTheory.Limits.WeightedCone.IsLimit.lift 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) {Z : C} (π : ⦃j : J⦄ → W.obj j → (Z ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) : Z ⟶ c.pt - CategoryTheory.Limits.WeightedCone.w 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.WeightedCone W F) {i j : J} (x : W.obj i) (f : i ⟶ j) : CategoryTheory.CategoryStruct.comp (c.π x) (F.map f) = c.π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x) - CategoryTheory.Limits.WeightedCone.IsLimit.iso_hom_π_assoc 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) [CategoryTheory.Limits.HasWeightedLimit W F] {j : J} (x : W.obj j) {Z : C} (h : F.obj j ⟶ Z) : CategoryTheory.CategoryStruct.comp hc.iso.hom (CategoryTheory.CategoryStruct.comp (c.π x) h) = CategoryTheory.CategoryStruct.comp (W.weightedLimObjObjπ F x) h - CategoryTheory.Limits.WeightedCone.IsLimit.hom_ext 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) {Z : C} {f g : Z ⟶ c.pt} (h : ∀ {j : J} (x : W.obj j), CategoryTheory.CategoryStruct.comp f (c.π x) = CategoryTheory.CategoryStruct.comp g (c.π x)) : f = g - CategoryTheory.Limits.WeightedCone.mk_π 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} (pt : C) (π : ⦃j : J⦄ → W.obj j → (pt ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x) := by cat_disch) {j : J} (x : W.obj j) : (CategoryTheory.Limits.WeightedCone.mk pt π hπ).π x = π x - CategoryTheory.Limits.WeightedCone.IsLimit.iso_inv_π_assoc 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) [CategoryTheory.Limits.HasWeightedLimit W F] {j : J} (x : W.obj j) {Z : C} (h : F.obj j ⟶ Z) : CategoryTheory.CategoryStruct.comp hc.iso.inv (CategoryTheory.CategoryStruct.comp (W.weightedLimObjObjπ F x) h) = CategoryTheory.CategoryStruct.comp (c.π x) h - CategoryTheory.Limits.WeightedCone.IsLimit.fac 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) {Z : C} (π : ⦃j : J⦄ → W.obj j → (Z ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) {j : J} (x : W.obj j) : CategoryTheory.CategoryStruct.comp (hc.lift π hπ) (c.π x) = π x - CategoryTheory.Functor.isLimitWeightedLimCone_fac 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] (W : CategoryTheory.Functor J (Type w)) (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasWeightedLimit W F] {Z : C} (π : ⦃j : J⦄ → W.obj j → (Z ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) ⦃j : J⦄ (x : W.obj j) : CategoryTheory.CategoryStruct.comp ((W.isLimitWeightedLimCone F).lift π hπ) (W.weightedLimObjObjπ F x) = π x - CategoryTheory.Limits.WeightedCone.w_assoc 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.WeightedCone W F) {i j : J} (x : W.obj i) (f : i ⟶ j) {Z : C} (h : F.obj j ⟶ Z) : CategoryTheory.CategoryStruct.comp (c.π x) (CategoryTheory.CategoryStruct.comp (F.map f) h) = CategoryTheory.CategoryStruct.comp (c.π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) h - CategoryTheory.Limits.WeightedCone.IsLimit.fac_assoc 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (hc : c.IsLimit) {Z : C} (π : ⦃j : J⦄ → W.obj j → (Z ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) {j : J} (x : W.obj j) {Z✝ : C} (h : F.obj j ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (hc.lift π hπ) (CategoryTheory.CategoryStruct.comp (c.π x) h) = CategoryTheory.CategoryStruct.comp (π x) h - CategoryTheory.Functor.isLimitWeightedLimCone_fac_assoc 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] (W : CategoryTheory.Functor J (Type w)) (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasWeightedLimit W F] {Z : C} (π : ⦃j : J⦄ → W.obj j → (Z ⟶ F.obj j)) (hπ : ∀ ⦃j₁ j₂ : J⦄ (x : W.obj j₁) (f : j₁ ⟶ j₂), CategoryTheory.CategoryStruct.comp (π x) (F.map f) = π ((CategoryTheory.ConcreteCategory.hom (W.map f)) x)) ⦃j : J⦄ (x : W.obj j) {Z✝ : C} (h : F.obj j ⟶ Z✝) : CategoryTheory.CategoryStruct.comp ((W.isLimitWeightedLimCone F).lift π hπ) (CategoryTheory.CategoryStruct.comp (W.weightedLimObjObjπ F x) h) = CategoryTheory.CategoryStruct.comp (π x) h - CategoryTheory.Limits.WeightedCone.IsLimit.mk 📋 Mathlib.CategoryTheory.Limits.Weighted.HasWeightedLimit
{J : Type u} [CategoryTheory.Category.{v, u} J] {C : Type u'} [CategoryTheory.Category.{v', u'} C] {W : CategoryTheory.Functor J (Type w)} {F : CategoryTheory.Functor J C} {c : CategoryTheory.Limits.WeightedCone W F} (lift : (s : CategoryTheory.Limits.WeightedCone W F) → s.pt ⟶ c.pt) (fac : ∀ (s : CategoryTheory.Limits.WeightedCone W F) ⦃j : J⦄ (x : W.obj j), CategoryTheory.CategoryStruct.comp (lift s) (c.π x) = s.π x) (uniq : ∀ (s : CategoryTheory.Limits.WeightedCone W F) (m : s.pt ⟶ c.pt), (∀ ⦃j : J⦄ (x : W.obj j), CategoryTheory.CategoryStruct.comp m (c.π x) = s.π x) → m = lift s) : CategoryTheory.Limits.IsLimit c - CategoryTheory.GrothendieckTopology.Point.comap 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] : J.Point - CategoryTheory.GrothendieckTopology.Point.comap_fiber 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] : (Φ.comap F hF).fiber = F.comp Φ.fiber - CategoryTheory.GrothendieckTopology.Point.skyscraperSheafFunctorCompSheafPushforwardContinuous 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] (A : Type u_3) [CategoryTheory.Category.{v, u_3} A] [CategoryTheory.Limits.HasProducts A] [F.IsContinuous J K] : Φ.skyscraperSheafFunctor.comp (F.sheafPushforwardContinuous A J K) ≅ (Φ.comap F hF).skyscraperSheafFunctor - CategoryTheory.GrothendieckTopology.Point.sheafFiberComapIso 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] (A : Type u_3) [CategoryTheory.Category.{v, u_3} A] [CategoryTheory.Limits.HasProducts A] [F.IsContinuous J K] [(F.sheafPushforwardContinuous A J K).IsRightAdjoint] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u_3} A] : (Φ.comap F hF).sheafFiber ≅ (F.sheafPullback A J K).comp Φ.sheafFiber - CategoryTheory.GrothendieckTopology.Point.sheafFiberComapIso_hom_app 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] (A : Type u_3) [CategoryTheory.Category.{v, u_3} A] [CategoryTheory.Limits.HasProducts A] [F.IsContinuous J K] [(F.sheafPushforwardContinuous A J K).IsRightAdjoint] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u_3} A] (X : CategoryTheory.Sheaf J A) : (Φ.sheafFiberComapIso F hF A).hom.app X = CategoryTheory.CategoryStruct.comp ((Φ.comap F hF).sheafFiber.map ((F.sheafAdjunctionContinuous A J K).unit.app X)) (CategoryTheory.CategoryStruct.comp ((Φ.comap F hF).sheafFiber.map ((F.sheafPushforwardContinuous A J K).map (Φ.skyscraperSheafAdjunction.unit.app ((F.sheafPullback A J K).obj X)))) (CategoryTheory.CategoryStruct.comp ((Φ.comap F hF).sheafFiber.map ((Φ.skyscraperSheafFunctorCompSheafPushforwardContinuous F hF A).hom.app (Φ.sheafFiber.obj ((F.sheafPullback A J K).obj X)))) ((Φ.comap F hF).skyscraperSheafAdjunction.counit.app (Φ.sheafFiber.obj ((F.sheafPullback A J K).obj X))))) - CategoryTheory.GrothendieckTopology.Point.sheafFiberComapIso_inv_app 📋 Mathlib.CategoryTheory.Sites.Point.Comap
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] {K : CategoryTheory.GrothendieckTopology D} (Φ : K.Point) (F : CategoryTheory.Functor C D) [CategoryTheory.RepresentablyFlat F] {J : CategoryTheory.GrothendieckTopology C} (hF : CategoryTheory.CoverPreserving J K F) [CategoryTheory.InitiallySmall (F.comp Φ.fiber).Elements] (A : Type u_3) [CategoryTheory.Category.{v, u_3} A] [CategoryTheory.Limits.HasProducts A] [F.IsContinuous J K] [(F.sheafPushforwardContinuous A J K).IsRightAdjoint] [CategoryTheory.Limits.HasColimitsOfSize.{w, w, v, u_3} A] (X : CategoryTheory.Sheaf J A) : (Φ.sheafFiberComapIso F hF A).inv.app X = CategoryTheory.CategoryStruct.comp (Φ.sheafFiber.map ((F.sheafPullback A J K).map ((Φ.comap F hF).skyscraperSheafAdjunction.unit.app X))) (CategoryTheory.CategoryStruct.comp (Φ.sheafFiber.map ((F.sheafPullback A J K).map ((Φ.skyscraperSheafFunctorCompSheafPushforwardContinuous F hF A).inv.app ((Φ.comap F hF).sheafFiber.obj X)))) (CategoryTheory.CategoryStruct.comp (Φ.sheafFiber.map ((F.sheafAdjunctionContinuous A J K).counit.app (Φ.skyscraperSheafFunctor.obj ((Φ.comap F hF).sheafFiber.obj X)))) (Φ.skyscraperSheafAdjunction.counit.app ((Φ.comap F hF).sheafFiber.obj X)))) - CategoryTheory.GrothendieckTopology.Point.instPreservesColimitsOfShapeOppositeElementsFiberObjFunctorCurriedTensor 📋 Mathlib.CategoryTheory.Sites.Point.Monoidal
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.MonoidalCategory A] [CategoryTheory.LocallySmall.{w, v, u} C] [∀ (X : A), CategoryTheory.Limits.PreservesFilteredColimitsOfSize.{w, w, v', v', u', u'} (CategoryTheory.MonoidalCategory.tensorLeft X)] (M : A) : CategoryTheory.Limits.PreservesColimitsOfShape Φ.fiber.Elementsᵒᵖ ((CategoryTheory.MonoidalCategory.curriedTensor A).obj M) - CategoryTheory.GrothendieckTopology.Point.instPreservesColimitsOfShapeOppositeElementsFiberObjFunctorFlipCurriedTensor 📋 Mathlib.CategoryTheory.Sites.Point.Monoidal
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.GrothendieckTopology C} (Φ : J.Point) {A : Type u'} [CategoryTheory.Category.{v', u'} A] [CategoryTheory.MonoidalCategory A] [CategoryTheory.LocallySmall.{w, v, u} C] [∀ (X : A), CategoryTheory.Limits.PreservesFilteredColimitsOfSize.{w, w, v', v', u', u'} (CategoryTheory.MonoidalCategory.tensorRight X)] (M : A) : CategoryTheory.Limits.PreservesColimitsOfShape Φ.fiber.Elementsᵒᵖ ((CategoryTheory.MonoidalCategory.curriedTensor A).flip.obj M) - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] : CategoryTheory.Functor N (CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.fiber p).Elements - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.instInitiallySmallElementsFiberOfIsCofiltered 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] [CategoryTheory.IsCofiltered N] : CategoryTheory.InitiallySmall (CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.fiber p).Elements - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.instIsCofilteredElementsFiber 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] [CategoryTheory.IsCofiltered N] : CategoryTheory.IsCofiltered (CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.fiber p).Elements - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.instInitialElementsFiberFunctorOfIsCofiltered 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] [CategoryTheory.IsCofiltered N] : (CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor p).Initial - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor_obj_fst 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] (U : N) : ((CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor p).obj U).fst = p.obj U - CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor_obj_snd 📋 Mathlib.CategoryTheory.Sites.Point.OfIsCofiltered
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {N : Type u'} [CategoryTheory.Category.{v', u'} N] (p : CategoryTheory.Functor N C) [CategoryTheory.InitiallySmall N] (U : N) : ((CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.functor p).obj U).snd = CategoryTheory.GrothendieckTopology.Point.ofIsCofiltered.fiberMk (CategoryTheory.CategoryStruct.id (p.obj U))
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c