Loogle!
Result
Found 1217 declarations mentioning CategoryTheory.Functor.op. Of these, only the first 200 are shown.
- CategoryTheory.Functor.op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) : CategoryTheory.Functor Cįµįµ Dįµįµ - CategoryTheory.Functor.instEssSurjOppositeOp š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [F.EssSurj] : F.op.EssSurj - CategoryTheory.Functor.instFaithfulOppositeOp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [F.Faithful] : F.op.Faithful - CategoryTheory.Functor.instFullOppositeOp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [F.Full] : F.op.Full - CategoryTheory.Functor.instIsEquivalenceOppositeOp š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} [F.IsEquivalence] : F.op.IsEquivalence - CategoryTheory.Functor.opUnopIso š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) : F.op.unop ā F - CategoryTheory.Functor.FullyFaithful.op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) : F.op.FullyFaithful - CategoryTheory.Functor.opId š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] : (CategoryTheory.Functor.id C).op ā CategoryTheory.Functor.id Cįµįµ - CategoryTheory.Functor.op_obj š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : Cįµįµ) : F.op.obj X = Opposite.op (F.obj (Opposite.unop X)) - CategoryTheory.Equivalence.op_functor š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā D) : e.op.functor = e.functor.op - CategoryTheory.Equivalence.op_inverse š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā D) : e.op.inverse = e.inverse.op - CategoryTheory.Functor.unopOpIso š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor Cįµįµ Dįµįµ) : F.unop.op ā F - CategoryTheory.NatIso.op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā G) : G.op ā F.op - CategoryTheory.NatIso.removeOp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F.op ā G.op) : G ā F - CategoryTheory.Functor.leftOpComp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D Eįµįµ) : (F.comp G).leftOp ā F.op.comp G.leftOp - CategoryTheory.Functor.rightOpComp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor Cįµįµ D) (G : CategoryTheory.Functor D E) : (F.comp G).rightOp ā F.rightOp.comp G.op - CategoryTheory.Functor.opHom_obj š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] (F : (CategoryTheory.Functor C D)įµįµ) : (CategoryTheory.Functor.opHom C D).obj F = (Opposite.unop F).op - CategoryTheory.Functor.opComp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) : (F.comp G).op ā F.op.comp G.op - CategoryTheory.NatIso.op_refl š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} : CategoryTheory.NatIso.op (CategoryTheory.Iso.refl F) = CategoryTheory.Iso.refl F.op - CategoryTheory.instIsIsoFunctorOppositeOp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F G : CategoryTheory.Functor C D} (α : F ā¶ G) [CategoryTheory.IsIso α] : CategoryTheory.IsIso (CategoryTheory.NatTrans.op α) - CategoryTheory.NatTrans.op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā¶ G) : G.op ā¶ F.op - CategoryTheory.NatTrans.removeOp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F.op ā¶ G.op) : G ā¶ F - CategoryTheory.Functor.opUnopIso_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) : F.opUnopIso.hom.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.Functor.opUnopIso_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) : F.opUnopIso.inv.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.NatTrans.removeOp_id š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) : CategoryTheory.NatTrans.removeOp (CategoryTheory.CategoryStruct.id F.op) = CategoryTheory.CategoryStruct.id F - CategoryTheory.Functor.op_map š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : F.op.map f = (F.map f.unop).op - CategoryTheory.NatIso.op_symm š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā G) : CategoryTheory.NatIso.op α.symm = (CategoryTheory.NatIso.op α).symm - CategoryTheory.Functor.opId_hom_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (X : Cįµįµ) : (CategoryTheory.Functor.opId C).hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Functor.opId_inv_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (X : Cįµįµ) : (CategoryTheory.Functor.opId C).inv.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.NatTrans.op_id š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) : CategoryTheory.NatTrans.op (CategoryTheory.CategoryStruct.id F) = CategoryTheory.CategoryStruct.id F.op - CategoryTheory.NatIso.removeOp_hom š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F.op ā G.op) : (CategoryTheory.NatIso.removeOp α).hom = CategoryTheory.NatTrans.removeOp α.hom - CategoryTheory.NatIso.removeOp_inv š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F.op ā G.op) : (CategoryTheory.NatIso.removeOp α).inv = CategoryTheory.NatTrans.removeOp α.inv - CategoryTheory.NatTrans.op_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā¶ G) (X : Cįµįµ) : (CategoryTheory.NatTrans.op α).app X = (α.app (Opposite.unop X)).op - CategoryTheory.NatIso.op_hom š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā G) : (CategoryTheory.NatIso.op α).hom = CategoryTheory.NatTrans.op α.hom - CategoryTheory.NatIso.op_inv š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F ā G) : (CategoryTheory.NatIso.op α).inv = CategoryTheory.NatTrans.op α.inv - CategoryTheory.Functor.unopOpIso_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor Cįµįµ Dįµįµ) (X : Cįµįµ) : F.unopOpIso.hom.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.Functor.unopOpIso_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor Cįµįµ Dįµįµ) (X : Cįµįµ) : F.unopOpIso.inv.app X = CategoryTheory.CategoryStruct.id (F.obj X) - CategoryTheory.NatIso.op_trans š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G H : CategoryTheory.Functor C D} (α : F ā G) (β : G ā H) : CategoryTheory.NatIso.op (α āŖā« β) = CategoryTheory.NatIso.op β āŖā« CategoryTheory.NatIso.op α - CategoryTheory.Equivalence.op_counitIso š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā D) : e.op.counitIso = (CategoryTheory.NatIso.op e.counitIso).symm - CategoryTheory.Equivalence.op_unitIso š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā D) : e.op.unitIso = (CategoryTheory.NatIso.op e.unitIso).symm - CategoryTheory.inv_op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] {F G : CategoryTheory.Functor C D} (α : F ā¶ G) [CategoryTheory.IsIso α] : CategoryTheory.inv (CategoryTheory.NatTrans.op α) = CategoryTheory.NatTrans.op (CategoryTheory.inv α) - CategoryTheory.NatTrans.removeOp_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} (α : F.op ā¶ G.op) (X : C) : (CategoryTheory.NatTrans.removeOp α).app X = (α.app (Opposite.op X)).unop - CategoryTheory.Functor.leftOpComp_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D Eįµįµ) (X : Cįµįµ) : (F.leftOpComp G).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (G.obj (F.obj (Opposite.unop X)))) - CategoryTheory.Functor.leftOpComp_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D Eįµįµ) (X : Cįµįµ) : (F.leftOpComp G).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (G.obj (F.obj (Opposite.unop X)))) - CategoryTheory.Functor.opComp_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) (X : Cįµįµ) : (F.opComp G).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj (F.obj (Opposite.unop X)))) - CategoryTheory.Functor.opComp_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor C D) (G : CategoryTheory.Functor D E) (X : Cįµįµ) : (F.opComp G).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj (F.obj (Opposite.unop X)))) - CategoryTheory.Functor.rightOpComp_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor Cįµįµ D) (G : CategoryTheory.Functor D E) (X : C) : (F.rightOpComp G).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj (F.obj (Opposite.op X)))) - CategoryTheory.Functor.rightOpComp_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] (F : CategoryTheory.Functor Cįµįµ D) (G : CategoryTheory.Functor D E) (X : C) : (F.rightOpComp G).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj (F.obj (Opposite.op X)))) - CategoryTheory.NatTrans.op_comp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G H : CategoryTheory.Functor C D} (α : F ā¶ G) (β : G ā¶ H) : CategoryTheory.NatTrans.op (CategoryTheory.CategoryStruct.comp α β) = CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op β) (CategoryTheory.NatTrans.op α) - CategoryTheory.Functor.opHom_map_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] {Xā Yā : (CategoryTheory.Functor C D)įµįµ} (α : Xā ā¶ Yā) (X : Cįµįµ) : ((CategoryTheory.Functor.opHom C D).map α).app X = (α.unop.app (Opposite.unop X)).op - CategoryTheory.NatTrans.op_comp_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G H : CategoryTheory.Functor C D} (α : F ā¶ G) (β : G ā¶ H) {Z : CategoryTheory.Functor Cįµįµ Dįµįµ} (h : F.op ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op (CategoryTheory.CategoryStruct.comp α β)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op β) (CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op α) h) - CategoryTheory.Functor.opUnopEquiv_unitIso š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] : (CategoryTheory.Functor.opUnopEquiv C D).unitIso = CategoryTheory.NatIso.ofComponents (fun F => (Opposite.unop F).opUnopIso.op) ⯠- CategoryTheory.NatIso.op_isoWhiskerLeft š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor E C} (α : F ā G) : CategoryTheory.NatIso.op (H.isoWhiskerLeft α) = H.opComp G āŖā« H.op.isoWhiskerLeft (CategoryTheory.NatIso.op α) āŖā« (H.opComp F).symm - CategoryTheory.NatIso.op_isoWhiskerRight š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor D E} (α : F ā G) : CategoryTheory.NatIso.op (CategoryTheory.Functor.isoWhiskerRight α H) = G.opComp H āŖā« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.NatIso.op α) H.op āŖā« (F.opComp H).symm - CategoryTheory.NatIso.op_leftUnitor š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} : CategoryTheory.NatIso.op F.leftUnitor = F.op.leftUnitor.symm āŖā« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.Functor.opId C).symm F.op āŖā« ((CategoryTheory.Functor.id C).opComp F).symm - CategoryTheory.NatIso.op_rightUnitor š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} : CategoryTheory.NatIso.op F.rightUnitor = F.op.rightUnitor.symm āŖā« F.op.isoWhiskerLeft (CategoryTheory.Functor.opId D).symm āŖā« (F.opComp (CategoryTheory.Functor.id D)).symm - CategoryTheory.NatTrans.leftOpWhiskerRight š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C Dįµįµ} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor E C} (α : F ā¶ G) : CategoryTheory.NatTrans.leftOp (H.whiskerLeft α) = CategoryTheory.CategoryStruct.comp (H.leftOpComp G).hom (CategoryTheory.CategoryStruct.comp (H.op.whiskerLeft (CategoryTheory.NatTrans.leftOp α)) (H.leftOpComp F).inv) - CategoryTheory.NatTrans.rightOpWhiskerRight š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor Cįµįµ D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor D E} (α : F ā¶ G) : CategoryTheory.NatTrans.rightOp (CategoryTheory.Functor.whiskerRight α H) = CategoryTheory.CategoryStruct.comp (G.rightOpComp H).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight (CategoryTheory.NatTrans.rightOp α) H.op) (F.rightOpComp H).inv) - CategoryTheory.NatTrans.op_whiskerLeft š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor E C} (α : F ā¶ G) : CategoryTheory.NatTrans.op (H.whiskerLeft α) = CategoryTheory.CategoryStruct.comp (H.opComp G).hom (CategoryTheory.CategoryStruct.comp (H.op.whiskerLeft (CategoryTheory.NatTrans.op α)) (H.opComp F).inv) - CategoryTheory.NatTrans.op_whiskerRight š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor D E} (α : F ā¶ G) : CategoryTheory.NatTrans.op (CategoryTheory.Functor.whiskerRight α H) = CategoryTheory.CategoryStruct.comp (G.opComp H).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight (CategoryTheory.NatTrans.op α) H.op) (F.opComp H).inv) - CategoryTheory.NatTrans.leftOpWhiskerRight_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C Dįµįµ} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor E C} (α : F ā¶ G) {Z : CategoryTheory.Functor Eįµįµ D} (h : (H.comp F).leftOp ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.leftOp (H.whiskerLeft α)) h = CategoryTheory.CategoryStruct.comp (H.leftOpComp G).hom (CategoryTheory.CategoryStruct.comp (H.op.whiskerLeft (CategoryTheory.NatTrans.leftOp α)) (CategoryTheory.CategoryStruct.comp (H.leftOpComp F).inv h)) - CategoryTheory.NatTrans.rightOpWhiskerRight_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor Cįµįµ D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor D E} (α : F ā¶ G) {Z : CategoryTheory.Functor C Eįµįµ} (h : (F.comp H).rightOp ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.rightOp (CategoryTheory.Functor.whiskerRight α H)) h = CategoryTheory.CategoryStruct.comp (G.rightOpComp H).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight (CategoryTheory.NatTrans.rightOp α) H.op) (CategoryTheory.CategoryStruct.comp (F.rightOpComp H).inv h)) - CategoryTheory.NatTrans.op_whiskerLeft_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor E C} (α : F ā¶ G) {Z : CategoryTheory.Functor Eįµįµ Dįµįµ} (h : (H.comp F).op ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op (H.whiskerLeft α)) h = CategoryTheory.CategoryStruct.comp (H.opComp G).hom (CategoryTheory.CategoryStruct.comp (H.op.whiskerLeft (CategoryTheory.NatTrans.op α)) (CategoryTheory.CategoryStruct.comp (H.opComp F).inv h)) - CategoryTheory.NatTrans.op_whiskerRight_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F G : CategoryTheory.Functor C D} {E : Type u_1} [CategoryTheory.Category.{v_1, u_1} E] {H : CategoryTheory.Functor D E} (α : F ā¶ G) {Z : CategoryTheory.Functor Cįµįµ Eįµįµ} (h : (F.comp H).op ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.NatTrans.op (CategoryTheory.Functor.whiskerRight α H)) h = CategoryTheory.CategoryStruct.comp (G.opComp H).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight (CategoryTheory.NatTrans.op α) H.op) (CategoryTheory.CategoryStruct.comp (F.opComp H).inv h)) - CategoryTheory.NatIso.op_associator š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {E : Type u_1} {E' : Type u_2} [CategoryTheory.Category.{v_1, u_1} E] [CategoryTheory.Category.{v_2, u_2} E'] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D E} {H : CategoryTheory.Functor E E'} : CategoryTheory.NatIso.op (F.associator G H) = F.opComp (G.comp H) āŖā« F.op.isoWhiskerLeft (G.opComp H) āŖā« (F.op.associator G.op H.op).symm āŖā« CategoryTheory.Functor.isoWhiskerRight (F.opComp G).symm H.op āŖā« ((F.comp G).opComp H).symm - CategoryTheory.Functor.const.opObjOp š Mathlib.CategoryTheory.Functor.Const
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) : (CategoryTheory.Functor.const Jįµįµ).obj (Opposite.op X) ā ((CategoryTheory.Functor.const J).obj X).op - CategoryTheory.Functor.const.unop_functor_op_obj_map š Mathlib.CategoryTheory.Functor.Const
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : Cįµįµ) {jā jā : J} (f : jā ā¶ jā) : (Opposite.unop ((CategoryTheory.Functor.const J).op.obj X)).map f = CategoryTheory.CategoryStruct.id (Opposite.unop X) - CategoryTheory.Functor.const.opObjOp_inv_app š Mathlib.CategoryTheory.Functor.Const
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) (xā : Jįµįµ) : (CategoryTheory.Functor.const.opObjOp X).inv.app xā = CategoryTheory.CategoryStruct.id (((CategoryTheory.Functor.const J).obj X).op.obj xā) - CategoryTheory.Functor.const.opObjOp_hom_app š Mathlib.CategoryTheory.Functor.Const
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) (xā : Jįµįµ) : (CategoryTheory.Functor.const.opObjOp X).hom.app xā = CategoryTheory.CategoryStruct.id (((CategoryTheory.Functor.const Jįµįµ).obj (Opposite.op X)).obj xā) - CategoryTheory.Comma.unopFunctor š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : CategoryTheory.Functor (CategoryTheory.Comma L.op R.op) (CategoryTheory.Comma R L)įµįµ - CategoryTheory.Comma.opEquiv š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : CategoryTheory.Comma L R ā (CategoryTheory.Comma R.op L.op)įµįµ - CategoryTheory.Comma.opFunctor š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : CategoryTheory.Functor (CategoryTheory.Comma L R) (CategoryTheory.Comma R.op L.op)įµįµ - CategoryTheory.Comma.opEquiv_functor š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).functor = CategoryTheory.Comma.opFunctor L R - CategoryTheory.Comma.unopFunctorCompFst š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.unopFunctor L R).comp (CategoryTheory.Comma.fst R L).op ā CategoryTheory.Comma.snd L.op R.op - CategoryTheory.Comma.unopFunctorCompSnd š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.unopFunctor L R).comp (CategoryTheory.Comma.snd R L).op ā CategoryTheory.Comma.fst L.op R.op - CategoryTheory.Comma.opEquiv_inverse š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).inverse = (CategoryTheory.Comma.unopFunctor R L).leftOp - CategoryTheory.Comma.opFunctorCompFst š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opFunctor L R).leftOp.comp (CategoryTheory.Comma.fst R.op L.op) ā (CategoryTheory.Comma.snd L R).op - CategoryTheory.Comma.opFunctorCompSnd š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opFunctor L R).leftOp.comp (CategoryTheory.Comma.snd R.op L.op) ā (CategoryTheory.Comma.fst L R).op - CategoryTheory.Comma.opFunctor_obj š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L R) : (CategoryTheory.Comma.opFunctor L R).obj X = Opposite.op { left := Opposite.op X.right, right := Opposite.op X.left, hom := Opposite.op X.hom } - CategoryTheory.Comma.unopFunctor_obj š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L.op R.op) : (CategoryTheory.Comma.unopFunctor L R).obj X = Opposite.op { left := Opposite.unop X.right, right := Opposite.unop X.left, hom := X.hom.unop } - CategoryTheory.Comma.opEquiv_unitIso š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Comma L R)).obj X)) ⯠- CategoryTheory.Comma.unopFunctorCompFst_hom_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L.op R.op) : (CategoryTheory.Comma.unopFunctorCompFst L R).hom.app X = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.Comma.unopFunctorCompFst_inv_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L.op R.op) : (CategoryTheory.Comma.unopFunctorCompFst L R).inv.app X = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.Comma.unopFunctorCompSnd_hom_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L.op R.op) : (CategoryTheory.Comma.unopFunctorCompSnd L R).hom.app X = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.unopFunctorCompSnd_inv_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : CategoryTheory.Comma L.op R.op) : (CategoryTheory.Comma.unopFunctorCompSnd L R).inv.app X = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.opFunctorCompFst_hom_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : (CategoryTheory.Comma L R)įµįµ) : (CategoryTheory.Comma.opFunctorCompFst L R).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.op (Opposite.unop X).right) - CategoryTheory.Comma.opFunctorCompFst_inv_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : (CategoryTheory.Comma L R)įµįµ) : (CategoryTheory.Comma.opFunctorCompFst L R).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.op (Opposite.unop X).right) - CategoryTheory.Comma.opFunctorCompSnd_hom_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : (CategoryTheory.Comma L R)įµįµ) : (CategoryTheory.Comma.opFunctorCompSnd L R).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.op (Opposite.unop X).left) - CategoryTheory.Comma.opFunctorCompSnd_inv_app š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) (X : (CategoryTheory.Comma L R)įµįµ) : (CategoryTheory.Comma.opFunctorCompSnd L R).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.op (Opposite.unop X).left) - CategoryTheory.Comma.unopFunctor_map š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) {Xā Yā : CategoryTheory.Comma L.op R.op} (f : Xā ā¶ Yā) : (CategoryTheory.Comma.unopFunctor L R).map f = Opposite.op { left := f.right.unop, right := f.left.unop, w := ⯠} - CategoryTheory.Comma.opEquiv_counitIso š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl (((CategoryTheory.Comma.unopFunctor R L).leftOp.comp (CategoryTheory.Comma.opFunctor L R)).obj X)) ⯠- CategoryTheory.Comma.opFunctor_map š Mathlib.CategoryTheory.Comma.Basic
{A : Type uā} [CategoryTheory.Category.{vā, uā} A] {B : Type uā} [CategoryTheory.Category.{vā, uā} B] {T : Type uā} [CategoryTheory.Category.{vā, uā} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) {Xā Yā : CategoryTheory.Comma L R} (f : Xā ā¶ Yā) : (CategoryTheory.Comma.opFunctor L R).map f = Opposite.op { left := Opposite.op f.right, right := Opposite.op f.left, w := ⯠} - CategoryTheory.MorphismProperty.op_inverseImage š Mathlib.CategoryTheory.MorphismProperty.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (P : CategoryTheory.MorphismProperty D) (F : CategoryTheory.Functor C D) : (P.inverseImage F).op = P.op.inverseImage F.op - CategoryTheory.Functor.FullyFaithful.homNatIso š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) : F.op.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj (F.obj X)) ā CategoryTheory.uliftYoneda.{vā, vā, uā}.obj X - CategoryTheory.uliftYonedaMap š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (X : C) : CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj X ā¶ F.op.comp (CategoryTheory.uliftYoneda.{max w vā, vā, uā}.obj (F.obj X)) - CategoryTheory.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.Functor.FullyFaithful.compUliftCoyonedaCompWhiskeringLeft š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) : F.op.comp (CategoryTheory.uliftCoyoneda.{vā, vā, uā}.comp ((CategoryTheory.Functor.whiskeringLeft C D (Type (max vā vā))).obj F)) ā CategoryTheory.uliftCoyoneda.{vā, vā, uā} - 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.curriedYonedaLemma š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.SmallCategory C] : CategoryTheory.yoneda.op.comp CategoryTheory.coyoneda ā CategoryTheory.evaluation Cįµįµ (Type uā) - CategoryTheory.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) : F.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.comp ((CategoryTheory.Functor.whiskeringLeft Cįµįµ Dįµįµ (Type (max vā vā))).obj F.op)) ā CategoryTheory.uliftYoneda.{vā, vā, uā} - CategoryTheory.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.uliftYonedaMap_app_apply š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) {Y : C} {X : Cįµįµ} (f : Opposite.unop X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.uliftYonedaMap F Y).app X)) { down := f } = { down := F.map f } - CategoryTheory.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.uliftYonedaOpCompCoyoneda š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] : CategoryTheory.uliftYoneda.{w, vā, uā}.op.comp CategoryTheory.coyoneda ā (CategoryTheory.evaluation Cįµįµ (Type (max vā w))).comp ((CategoryTheory.Functor.whiskeringRight (CategoryTheory.Functor Cįµįµ (Type (max vā w))) (Type (max vā w)) (Type (max (max w uā) vā))).obj CategoryTheory.uliftFunctor.{uā, max vā w}) - CategoryTheory.Functor.FullyFaithful.homNatIso_hom_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) : (hF.homNatIso X).hom.app Xā = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.hom - CategoryTheory.Functor.FullyFaithful.homNatIso_inv_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) : (hF.homNatIso X).inv.app Xā = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.inv - CategoryTheory.Functor.FullyFaithful.compUliftCoyonedaCompWhiskeringLeft_hom_app_app_hom_apply_down š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : Cįµįµ) (Xā : C) (x : (F.comp (CategoryTheory.uliftCoyoneda.{vā, vā, uā}.obj (Opposite.op (F.obj (Opposite.unop X))))).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftCoyonedaCompWhiskeringLeft.hom.app X).app Xā)) x).down = hF.preimage x.down - 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.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft_hom_app_app_hom_apply_down š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) (x : (F.op.comp (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj (F.obj X))).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftYonedaCompWhiskeringLeft.hom.app X).app Xā)) x).down = hF.preimage x.down - CategoryTheory.Functor.FullyFaithful.compUliftYonedaCompWhiskeringLeft_inv_app_app_hom_apply_down š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xā : Cįµįµ) (x : (CategoryTheory.uliftYoneda.{vā, vā, uā}.obj X).obj Xā) : ((CategoryTheory.ConcreteCategory.hom ((hF.compUliftYonedaCompWhiskeringLeft.inv.app X).app Xā)) x).down = F.map x.down - CategoryTheory.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.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.compCoyonedaIso š 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) : F.op.comp CategoryTheory.coyoneda ā CategoryTheory.coyoneda.comp ((CategoryTheory.Functor.whiskeringLeft D C (Type vā)).obj G) - CategoryTheory.Adjunction.compUliftCoyonedaIso š 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) : F.op.comp CategoryTheory.uliftCoyoneda.{max w vā, vā, uā} ā CategoryTheory.uliftCoyoneda.{max w vā, vā, uā}.comp ((CategoryTheory.Functor.whiskeringLeft D C (Type (max (max w vā) vā))).obj G) - 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.compCoyonedaIso_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 : Cįµįµ) (Xā : D) (x : Opposite.unop X ā¶ G.obj Xā) : (CategoryTheory.ConcreteCategory.hom ((adj.compCoyonedaIso.inv.app X).app Xā)) x = CategoryTheory.CategoryStruct.comp (F.map x) (adj.counit.app Xā) - CategoryTheory.Adjunction.compCoyonedaIso_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 : Cįµįµ) (Xā : D) (x : F.obj (Opposite.unop X) ā¶ Xā) : (CategoryTheory.ConcreteCategory.hom ((adj.compCoyonedaIso.hom.app X).app Xā)) x = CategoryTheory.CategoryStruct.comp (adj.unit.app (Opposite.unop X)) (G.map x) - CategoryTheory.Adjunction.compUliftCoyonedaIso_inv_app_app_hom_apply_down š 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 : Cįµįµ) (Xā : D) (x : ULift.{max vā w, vā} (Opposite.unop X ā¶ G.obj Xā)) : ((CategoryTheory.ConcreteCategory.hom ((adj.compUliftCoyonedaIso.inv.app X).app Xā)) x).down = CategoryTheory.CategoryStruct.comp (F.map x.down) (adj.counit.app Xā) - CategoryTheory.Adjunction.compUliftCoyonedaIso_hom_app_app_hom_apply_down š 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 : Cįµįµ) (Xā : D) (x : ULift.{max vā w, vā} (F.obj (Opposite.unop X) ā¶ Xā)) : ((CategoryTheory.ConcreteCategory.hom ((adj.compUliftCoyonedaIso.hom.app X).app Xā)) x).down = CategoryTheory.CategoryStruct.comp (adj.unit.app (Opposite.unop X)) (G.map x.down) - 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.Cocone.op š 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.Cocone F) : CategoryTheory.Limits.Cone F.op - CategoryTheory.Limits.Cocone.unop š 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.Cocone F.op) : CategoryTheory.Limits.Cone F - CategoryTheory.Limits.Cone.op š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F : CategoryTheory.Functor J C} (c : CategoryTheory.Limits.Cone F) : CategoryTheory.Limits.Cocone F.op - CategoryTheory.Limits.Cone.unop š 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.op) : CategoryTheory.Limits.Cocone F - CategoryTheory.Limits.Cocone.op_pt š 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.Cocone F) : c.op.pt = Opposite.op c.pt - CategoryTheory.Limits.Cone.op_pt š 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) : c.op.pt = Opposite.op c.pt - CategoryTheory.Limits.Cocone.unop_pt š 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.Cocone F.op) : c.unop.pt = Opposite.unop c.pt - CategoryTheory.Limits.Cone.unop_pt š 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.op) : c.unop.pt = Opposite.unop c.pt - CategoryTheory.Limits.coconeOpEquiv š 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} : (CategoryTheory.Limits.Cocone F)įµįµ ā CategoryTheory.Limits.Cone F.op - CategoryTheory.Limits.coneOpEquiv š 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} : (CategoryTheory.Limits.Cone F)įµįµ ā CategoryTheory.Limits.Cocone F.op - CategoryTheory.Limits.coconeEquivalenceOpConeOp š 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) : CategoryTheory.Limits.Cocone F ā (CategoryTheory.Limits.Cone F.op)įµįµ - CategoryTheory.Limits.coneEquivalenceOpCoconeOp š 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) : CategoryTheory.Limits.Cone F ā (CategoryTheory.Limits.Cocone F.op)įµįµ - CategoryTheory.Functor.mapCoconeOp š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (G.mapCocone t).op ā G.op.mapCone t.op - CategoryTheory.Functor.mapConeOp š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (G.mapCone t).op ā G.op.mapCocone t.op - CategoryTheory.Limits.Cocone.op_Ļ š 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.Cocone F) : c.op.Ļ = CategoryTheory.NatTrans.op c.ι - CategoryTheory.Limits.Cone.op_ι š 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) : c.op.ι = CategoryTheory.NatTrans.op c.Ļ - CategoryTheory.Limits.Cocone.unop_Ļ š 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.Cocone F.op) : c.unop.Ļ = CategoryTheory.NatTrans.removeOp c.ι - CategoryTheory.Limits.Cone.unop_ι š 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.op) : c.unop.ι = CategoryTheory.NatTrans.removeOp c.Ļ - CategoryTheory.Limits.coconeOpEquiv_functor_obj š 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.Cocone F)įµįµ) : CategoryTheory.Limits.coconeOpEquiv.functor.obj c = (Opposite.unop c).op - CategoryTheory.Limits.coconeOpEquiv_inverse_obj š 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.op) : CategoryTheory.Limits.coconeOpEquiv.inverse.obj c = Opposite.op c.unop - CategoryTheory.Limits.coneOpEquiv_functor_obj š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F : CategoryTheory.Functor J C} (c : (CategoryTheory.Limits.Cone F)įµįµ) : CategoryTheory.Limits.coneOpEquiv.functor.obj c = (Opposite.unop c).op - CategoryTheory.Limits.coneOpEquiv_inverse_obj š 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.Cocone F.op) : CategoryTheory.Limits.coneOpEquiv.inverse.obj c = Opposite.op c.unop - CategoryTheory.Limits.coconeOpEquiv_unitIso š 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} : CategoryTheory.Limits.coconeOpEquiv.unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id (CategoryTheory.Limits.Cocone F)įµįµ) - CategoryTheory.Limits.coneOpEquiv_unitIso š 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} : CategoryTheory.Limits.coneOpEquiv.unitIso = CategoryTheory.Iso.refl (CategoryTheory.Functor.id (CategoryTheory.Limits.Cone F)įµįµ) - CategoryTheory.Limits.coconeOpEquiv_functor_map_hom š 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} {Yā Xā : (CategoryTheory.Limits.Cocone F)įµįµ} (f : Yā ā¶ Xā) : (CategoryTheory.Limits.coconeOpEquiv.functor.map f).hom = f.unop.hom.op - CategoryTheory.Limits.coneOpEquiv_functor_map_hom š 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ā : (CategoryTheory.Limits.Cone F)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Limits.coneOpEquiv.functor.map f).hom = f.unop.hom.op - CategoryTheory.Functor.mapCoconeOp_hom_hom š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Functor.mapCoconeOp G t).hom.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapCoconeOp_inv_hom š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Functor.mapCoconeOp G t).inv.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapConeOp_hom_hom š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeOp G t).hom.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.Functor.mapConeOp_inv_hom š Mathlib.CategoryTheory.Limits.Cones
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {F : CategoryTheory.Functor J C} (G : CategoryTheory.Functor C D) (t : CategoryTheory.Limits.Cone F) : (CategoryTheory.Functor.mapConeOp G t).inv.hom = CategoryTheory.CategoryStruct.id (Opposite.op (G.obj t.pt)) - CategoryTheory.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.Limits.coconeOpEquiv_inverse_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} {Yā Xā : CategoryTheory.Limits.Cone F.op} (f : Yā ā¶ Xā) : CategoryTheory.Limits.coconeOpEquiv.inverse.map f = Opposite.op { hom := f.hom.unop, w := ⯠} - CategoryTheory.Limits.coneOpEquiv_inverse_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ā : CategoryTheory.Limits.Cocone F.op} (f : Xā ā¶ Yā) : CategoryTheory.Limits.coneOpEquiv.inverse.map f = Opposite.op { hom := f.hom.unop, w := ⯠} - 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.coneOpEquiv_counitIso š 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} : CategoryTheory.Limits.coneOpEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op c.unop, map := fun {X Y} f => Opposite.op { hom := f.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => (Opposite.unop c).op, map := fun {X Y} f => { hom := f.unop.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.coconeOpEquiv_counitIso š 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} : CategoryTheory.Limits.coconeOpEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op c.unop, map := fun {Y X} f => Opposite.op { hom := f.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => (Opposite.unop c).op, map := fun {Y X} f => { hom := f.unop.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.isColimitOfOp š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cocone F} (P : CategoryTheory.Limits.IsLimit t.op) : CategoryTheory.Limits.IsColimit t - CategoryTheory.Limits.isLimitOfOp š Mathlib.CategoryTheory.Limits.HasLimits
{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} (P : CategoryTheory.Limits.IsColimit t.op) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.IsColimit.op š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cocone F} (P : CategoryTheory.Limits.IsColimit t) : CategoryTheory.Limits.IsLimit t.op - CategoryTheory.Limits.IsLimit.op š Mathlib.CategoryTheory.Limits.HasLimits
{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} (P : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Limits.IsColimit t.op - CategoryTheory.Limits.isColimitEquivIsLimitOp š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cocone F} : CategoryTheory.Limits.IsColimit t ā CategoryTheory.Limits.IsLimit t.op - CategoryTheory.Limits.isLimitEquivIsColimitOp š Mathlib.CategoryTheory.Limits.HasLimits
{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} : CategoryTheory.Limits.IsLimit t ā CategoryTheory.Limits.IsColimit t.op - CategoryTheory.Limits.isColimitOfUnop š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cocone F.op} (P : CategoryTheory.Limits.IsLimit t.unop) : CategoryTheory.Limits.IsColimit t - CategoryTheory.Limits.isLimitOfUnop š Mathlib.CategoryTheory.Limits.HasLimits
{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.op} (P : CategoryTheory.Limits.IsColimit t.unop) : CategoryTheory.Limits.IsLimit t - CategoryTheory.Limits.IsColimit.unop š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] {F : CategoryTheory.Functor J C} {t : CategoryTheory.Limits.Cocone F.op} (P : CategoryTheory.Limits.IsColimit t) : CategoryTheory.Limits.IsLimit t.unop - CategoryTheory.Limits.IsLimit.unop š Mathlib.CategoryTheory.Limits.HasLimits
{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.op} (P : CategoryTheory.Limits.IsLimit t) : CategoryTheory.Limits.IsColimit t.unop - CategoryTheory.Limits.colimCoyoneda š Mathlib.CategoryTheory.Limits.HasLimits
{J : Type uā} [CategoryTheory.Category.{vā, uā} J] {C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasColimitsOfShape J C] : CategoryTheory.Limits.colim.op.comp (CategoryTheory.coyoneda.comp ((CategoryTheory.Functor.whiskeringRight C (Type v) (Type (max v uā))).obj CategoryTheory.uliftFunctor.{uā, v})) ā CategoryTheory.cocones J C - CategoryTheory.costructuredArrowOpEquivalence š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : (CategoryTheory.CostructuredArrow F d)įµįµ ā CategoryTheory.StructuredArrow (Opposite.op d) F.op - CategoryTheory.structuredArrowOpEquivalence š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : (CategoryTheory.StructuredArrow d F)įµįµ ā CategoryTheory.CostructuredArrow F.op (Opposite.op d) - CategoryTheory.CostructuredArrow.toStructuredArrow š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow F d)įµįµ (CategoryTheory.StructuredArrow (Opposite.op d) F.op) - CategoryTheory.StructuredArrow.toCostructuredArrow š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : CategoryTheory.Functor (CategoryTheory.StructuredArrow d F)įµįµ (CategoryTheory.CostructuredArrow F.op (Opposite.op d)) - CategoryTheory.CostructuredArrow.toStructuredArrow' š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : CategoryTheory.Functor (CategoryTheory.CostructuredArrow F.op (Opposite.op d))įµįµ (CategoryTheory.StructuredArrow d F) - CategoryTheory.StructuredArrow.toCostructuredArrow' š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) : CategoryTheory.Functor (CategoryTheory.StructuredArrow (Opposite.op d) F.op)įµįµ (CategoryTheory.CostructuredArrow F d) - CategoryTheory.CostructuredArrow.toStructuredArrow_obj š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) (X : (CategoryTheory.CostructuredArrow F d)įµįµ) : (CategoryTheory.CostructuredArrow.toStructuredArrow F d).obj X = CategoryTheory.StructuredArrow.mk (Opposite.unop X).hom.op - CategoryTheory.StructuredArrow.toCostructuredArrow_obj š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) (X : (CategoryTheory.StructuredArrow d F)įµįµ) : (CategoryTheory.StructuredArrow.toCostructuredArrow F d).obj X = CategoryTheory.CostructuredArrow.mk (Opposite.unop X).hom.op - CategoryTheory.CostructuredArrow.toStructuredArrow'_obj š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) (X : (CategoryTheory.CostructuredArrow F.op (Opposite.op d))įµįµ) : (CategoryTheory.CostructuredArrow.toStructuredArrow' F d).obj X = CategoryTheory.StructuredArrow.mk (Opposite.unop X).hom.unop - CategoryTheory.StructuredArrow.toCostructuredArrow'_obj š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) (X : (CategoryTheory.StructuredArrow (Opposite.op d) F.op)įµįµ) : (CategoryTheory.StructuredArrow.toCostructuredArrow' F d).obj X = CategoryTheory.CostructuredArrow.mk (Opposite.unop X).hom.unop - CategoryTheory.StructuredArrow.toCostructuredArrow_map š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) {Xā Yā : (CategoryTheory.StructuredArrow d F)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.StructuredArrow.toCostructuredArrow F d).map f = CategoryTheory.CostructuredArrow.homMk (CategoryTheory.StructuredArrow.Hom.right f.unop).op ⯠- CategoryTheory.CostructuredArrow.toStructuredArrow_map š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) {Xā Yā : (CategoryTheory.CostructuredArrow F d)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.CostructuredArrow.toStructuredArrow F d).map f = CategoryTheory.StructuredArrow.homMk f.unop.left.op ⯠- CategoryTheory.StructuredArrow.toCostructuredArrow'_map š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) {Xā Yā : (CategoryTheory.StructuredArrow (Opposite.op d) F.op)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.StructuredArrow.toCostructuredArrow' F d).map f = CategoryTheory.CostructuredArrow.homMk (CategoryTheory.StructuredArrow.Hom.right f.unop).unop ⯠- CategoryTheory.CostructuredArrow.toStructuredArrow'_map š Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (F : CategoryTheory.Functor C D) (d : D) {Xā Yā : (CategoryTheory.CostructuredArrow F.op (Opposite.op d))įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.CostructuredArrow.toStructuredArrow' F d).map f = CategoryTheory.StructuredArrow.homMk f.unop.left.unop ⯠- 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.hasColimit_of_hasLimit_op š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F.op] : CategoryTheory.Limits.HasColimit F - CategoryTheory.Limits.hasColimit_op_of_hasLimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F] : CategoryTheory.Limits.HasColimit F.op - CategoryTheory.Limits.hasLimit_of_hasColimit_op š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasColimit F.op] : CategoryTheory.Limits.HasLimit F - CategoryTheory.Limits.hasLimit_op_of_hasColimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasColimit F] : CategoryTheory.Limits.HasLimit F.op - CategoryTheory.Limits.hasColimit_op_iff_hasLimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] {F : CategoryTheory.Functor J C} : CategoryTheory.Limits.HasColimit F.op ā CategoryTheory.Limits.HasLimit F - CategoryTheory.Limits.hasLimit_op_iff_hasColimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] {F : CategoryTheory.Functor J C} : CategoryTheory.Limits.HasLimit F.op ā CategoryTheory.Limits.HasColimit F - CategoryTheory.Limits.colimitOpIsoOpLimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F] : CategoryTheory.Limits.colimit F.op ā Opposite.op (CategoryTheory.Limits.limit F) - CategoryTheory.Limits.limitOpIsoOpColimit š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasColimit F] : CategoryTheory.Limits.limit F.op ā Opposite.op (CategoryTheory.Limits.colimit F) - CategoryTheory.Limits.limitOpIsoOpColimit_hom_comp_ι š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasColimit F] (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitOpIsoOpColimit F).hom (CategoryTheory.Limits.colimit.ι F j).op = CategoryTheory.Limits.limit.Ļ F.op (Opposite.op j) - CategoryTheory.Limits.Ļ_comp_colimitOpIsoOpLimit_inv š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F] (j : J) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F j).op (CategoryTheory.Limits.colimitOpIsoOpLimit F).inv = CategoryTheory.Limits.colimit.ι F.op (Opposite.op j) - CategoryTheory.Limits.limitOpIsoOpColimit_inv_comp_Ļ š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasColimit F] (j : Jįµįµ) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitOpIsoOpColimit F).inv (CategoryTheory.Limits.limit.Ļ F.op j) = (CategoryTheory.Limits.colimit.ι F (Opposite.unop j)).op - CategoryTheory.Limits.ι_comp_colimitOpIsoOpLimit_hom š Mathlib.CategoryTheory.Limits.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {J : Type uā} [CategoryTheory.Category.{vā, uā} J] (F : CategoryTheory.Functor J C) [CategoryTheory.Limits.HasLimit F] (j : Jįµįµ) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F.op j) (CategoryTheory.Limits.colimitOpIsoOpLimit F).hom = (CategoryTheory.Limits.limit.Ļ F (Opposite.unop j)).op
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