Loogle!
Result
Found 797 declarations mentioning Quiver.Hom.unop. Of these, only the first 200 are shown.
- Quiver.Hom.unop š Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : Vįµįµ} (f : X ā¶ Y) : Opposite.unop Y ā¶ Opposite.unop X - Quiver.Hom.unop_inj š Mathlib.CategoryTheory.Opposites
{C : Type uā} [Quiver C] {X Y : Cįµįµ} : Function.Injective Quiver.Hom.unop - CategoryTheory.unop_id š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.CategoryStruct.{vā, uā} C] {X : Cįµįµ} : (CategoryTheory.CategoryStruct.id X).unop = CategoryTheory.CategoryStruct.id (Opposite.unop X) - Quiver.Hom.unop_op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [Quiver C] {X Y : C} (f : X ā¶ Y) : f.op.unop = f - Quiver.Hom.unop_op' š Mathlib.CategoryTheory.Opposites
{C : Type uā} [Quiver C] {X Y : Cįµįµ} {x : Opposite.unop Y ā¶ Opposite.unop X} : Quiver.Hom.unop (Opposite.op x) = x - CategoryTheory.unop_id_op š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.CategoryStruct.{vā, uā} C] {X : C} : (CategoryTheory.CategoryStruct.id (Opposite.op X)).unop = CategoryTheory.CategoryStruct.id X - CategoryTheory.isIso_unop š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) [CategoryTheory.IsIso f] : CategoryTheory.IsIso f.unop - CategoryTheory.isIso_unop_iff š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) : CategoryTheory.IsIso f.unop ā CategoryTheory.IsIso f - Quiver.Hom.op_unop š Mathlib.CategoryTheory.Opposites
{C : Type uā} [Quiver C] {X Y : Cįµįµ} (f : X ā¶ Y) : f.unop.op = f - CategoryTheory.Iso.unop_hom š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā Y) : f.unop.hom = f.hom.unop - CategoryTheory.Iso.unop_inv š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā Y) : f.unop.inv = f.inv.unop - Quiver.Hom.unop_mk š Mathlib.CategoryTheory.Opposites
{C : Type uā} [Quiver C] {X Y : Cįµįµ} (f : X ā¶ Y) : Quiver.Hom.unop (Opposite.op f) = f - CategoryTheory.unop_comp š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.CategoryStruct.{vā, uā} C] {X Y Z : Cįµįµ} {f : X ā¶ Y} {g : Y ā¶ Z} : (CategoryTheory.CategoryStruct.comp f g).unop = CategoryTheory.CategoryStruct.comp g.unop f.unop - CategoryTheory.unop_inv š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) [CategoryTheory.IsIso f] : (CategoryTheory.inv f).unop = CategoryTheory.inv f.unop - CategoryTheory.unopUnop_map š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] {Xā Yā : Cįµįµįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.unopUnop C).map f = f.unop.unop - CategoryTheory.op_comp_unop š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.CategoryStruct.{vā, uā} C] {X Y Z : Cįµįµ} (f : X ā¶ Y) (g : Y ā¶ Z) : (CategoryTheory.CategoryStruct.comp g.unop f.unop).op = CategoryTheory.CategoryStruct.comp f g - 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.unop_comp_assoc š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} {f : X ā¶ Y} {g : Y ā¶ Z} {Z' : C} {h : Opposite.unop X ā¶ Z'} : CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp f g).unop h = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.CategoryStruct.comp f.unop h) - CategoryTheory.Functor.leftOp_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.leftOp.map f = (F.map f.unop).unop - CategoryTheory.Functor.rightOp_map_unop š 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.rightOp.map f).unop = F.map f.op - CategoryTheory.Functor.unop_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.unop.map f = (F.map f.op).unop - CategoryTheory.NatTrans.leftOp_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.leftOp α).app X = (α.app (Opposite.unop X)).unop - CategoryTheory.opEquiv_apply š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (A B : Cįµįµ) (f : A ā¶ B) : (CategoryTheory.opEquiv A B) f = f.unop - CategoryTheory.NatTrans.unop_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.unop α).app X = (α.app (Opposite.op X)).unop - CategoryTheory.NatTrans.removeRightOp_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.rightOp ā¶ G.rightOp) (X : Cįµįµ) : (CategoryTheory.NatTrans.removeRightOp α).app X = (α.app (Opposite.unop X)).unop - 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.Iso.unop_hom_inv_id_app š 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įµįµ} (e : F ā G) (X : C) : CategoryTheory.CategoryStruct.comp (e.hom.app X).unop (e.inv.app X).unop = CategoryTheory.CategoryStruct.id (Opposite.unop (G.obj X)) - CategoryTheory.Iso.unop_inv_hom_id_app š 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įµįµ} (e : F ā G) (X : C) : CategoryTheory.CategoryStruct.comp (e.inv.app X).unop (e.hom.app X).unop = CategoryTheory.CategoryStruct.id (Opposite.unop (F.obj X)) - CategoryTheory.Iso.unop_hom_inv_id_app_assoc š 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įµįµ} (e : F ā G) (X : C) {Z : D} (h : Opposite.unop (G.obj X) ā¶ Z) : CategoryTheory.CategoryStruct.comp (e.hom.app X).unop (CategoryTheory.CategoryStruct.comp (e.inv.app X).unop h) = h - CategoryTheory.Iso.unop_inv_hom_id_app_assoc š 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įµįµ} (e : F ā G) (X : C) {Z : D} (h : Opposite.unop (F.obj X) ā¶ Z) : CategoryTheory.CategoryStruct.comp (e.inv.app X).unop (CategoryTheory.CategoryStruct.comp (e.hom.app X).unop h) = h - 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.Equivalence.leftOp_functor_map š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā Dįµįµ) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : e.leftOp.functor.map f = (e.functor.map f.unop).unop - CategoryTheory.Functor.opInv_map š 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ā) : (CategoryTheory.Functor.opInv C D).map α = Quiver.Hom.op { app := fun X => (α.app (Opposite.op X)).unop, naturality := ⯠} - CategoryTheory.Equivalence.rightOp_inverse_map š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : Cįµįµ ā D) {Xā Yā : Dįµįµ} (f : Xā ā¶ Yā) : e.rightOp.inverse.map f = (e.inverse.map f.unop).unop - CategoryTheory.Functor.leftOpRightOpEquiv_functor_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.leftOpRightOpEquiv C D).functor.map Ī·).app xā = (Ī·.unop.app (Opposite.op xā)).op - CategoryTheory.Equivalence.leftOp_counitIso_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā Dįµįµ) (X : D) : e.leftOp.counitIso.hom.app X = (e.counitIso.inv.app (Opposite.op X)).unop - CategoryTheory.Equivalence.leftOp_counitIso_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : C ā Dįµįµ) (X : D) : e.leftOp.counitIso.inv.app X = (e.counitIso.hom.app (Opposite.op X)).unop - CategoryTheory.Equivalence.rightOp_unitIso_hom_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : Cįµįµ ā D) (X : C) : e.rightOp.unitIso.hom.app X = (e.unitIso.inv.app (Opposite.op X)).unop - CategoryTheory.Equivalence.rightOp_unitIso_inv_app š Mathlib.CategoryTheory.Opposites
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (e : Cįµįµ ā D) (X : C) : e.rightOp.unitIso.inv.app X = (e.unitIso.hom.app (Opposite.op X)).unop - CategoryTheory.Functor.leftOpRightOpEquiv_counitIso_hom_app_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] (X : CategoryTheory.Functor C Dįµįµ) (Xā : C) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).counitIso.hom.app X).app Xā = CategoryTheory.CategoryStruct.id (X.obj Xā) - CategoryTheory.Functor.leftOpRightOpEquiv_counitIso_inv_app_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] (X : CategoryTheory.Functor C Dįµįµ) (Xā : C) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).counitIso.inv.app X).app Xā = CategoryTheory.CategoryStruct.id (X.obj Xā) - CategoryTheory.Functor.leftOpRightOpEquiv_unitIso_hom_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] (X : (CategoryTheory.Functor Cįµįµ D)įµįµ) : (CategoryTheory.Functor.leftOpRightOpEquiv C D).unitIso.hom.app X = (Opposite.unop X).rightOpLeftOpIso.hom.op - CategoryTheory.Functor.leftOpRightOpEquiv_unitIso_inv_app š Mathlib.CategoryTheory.Opposites
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (D : Type uā) [CategoryTheory.Category.{vā, uā} D] (X : (CategoryTheory.Functor Cįµįµ D)įµįµ) : (CategoryTheory.Functor.leftOpRightOpEquiv C D).unitIso.inv.app X = (Opposite.unop X).rightOpLeftOpIso.inv.op - CategoryTheory.eqToHom_unop š Mathlib.CategoryTheory.EqToHom
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (h : X = Y) : (CategoryTheory.eqToHom h).unop = CategoryTheory.eqToHom ⯠- CategoryTheory.prodOpEquiv_functor_map š Mathlib.CategoryTheory.Products.Basic
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {Xā Yā : (C Ć D)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.prodOpEquiv C).functor.map f = CategoryTheory.Prod.mkHom f.unop.1.op f.unop.2.op - CategoryTheory.prodOpEquiv_inverse_map š Mathlib.CategoryTheory.Products.Basic
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] {Xā Yā : Cįµįµ Ć Dįµįµ} (xā : Xā ā¶ Yā) : (CategoryTheory.prodOpEquiv C).inverse.map xā = match xā with | (f, g) => Opposite.op (CategoryTheory.Prod.mkHom f.unop g.unop) - CategoryTheory.prodOpEquiv_counitIso_hom_app š Mathlib.CategoryTheory.Products.Basic
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (X : Cįµįµ Ć Dįµįµ) : (CategoryTheory.prodOpEquiv C).counitIso.hom.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - CategoryTheory.prodOpEquiv_counitIso_inv_app š Mathlib.CategoryTheory.Products.Basic
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] {D : Type uā} [CategoryTheory.Category.{vā, uā} D] (X : Cįµįµ Ć Dįµįµ) : (CategoryTheory.prodOpEquiv C).counitIso.inv.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - 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.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.Groupoid.invEquivalence_inverse_map š Mathlib.CategoryTheory.Groupoid
(C : Type u) [CategoryTheory.Groupoid C] {x y : Cįµįµ} (f : x ā¶ y) : (CategoryTheory.Groupoid.invEquivalence C).inverse.map f = CategoryTheory.Groupoid.inv f.unop - CategoryTheory.Groupoid.invEquivalence_unitIso š Mathlib.CategoryTheory.Groupoid
(C : Type u) [CategoryTheory.Groupoid C] : (CategoryTheory.Groupoid.invEquivalence C).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id C).obj x)) ⯠- CategoryTheory.Groupoid.invEquivalence_counitIso š Mathlib.CategoryTheory.Groupoid
(C : Type u) [CategoryTheory.Groupoid C] : (CategoryTheory.Groupoid.invEquivalence C).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (({ obj := Opposite.unop, map := fun {x y} f => CategoryTheory.Groupoid.inv f.unop, map_id := āÆ, map_comp := ⯠}.comp { obj := Opposite.op, map := fun {x x_1} f => (CategoryTheory.Groupoid.inv f).op, map_id := āÆ, map_comp := ⯠}).obj x)) ⯠- CategoryTheory.CommSq.unop š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {W X Y Z : Cįµįµ} {f : W ā¶ X} {g : W ā¶ Y} {h : X ā¶ Z} {i : Y ā¶ Z} (p : CategoryTheory.CommSq f g h i) : CategoryTheory.CommSq i.unop h.unop g.unop f.unop - CategoryTheory.CommSq.LiftStruct.unop š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} {sq : CategoryTheory.CommSq f i p g} (l : sq.LiftStruct) : āÆ.LiftStruct - CategoryTheory.CommSq.HasLift.iff_unop š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} (sq : CategoryTheory.CommSq f i p g) : sq.HasLift ā āÆ.HasLift - CategoryTheory.CommSq.LiftStruct.unopEquiv š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} (sq : CategoryTheory.CommSq f i p g) : sq.LiftStruct ā āÆ.LiftStruct - CategoryTheory.CommSq.LiftStruct.unop_l š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} {sq : CategoryTheory.CommSq f i p g} (l : sq.LiftStruct) : l.unop.l = l.l.unop - CategoryTheory.CommSq.LiftStruct.unopEquiv_apply š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} (sq : CategoryTheory.CommSq f i p g) (l : sq.LiftStruct) : (CategoryTheory.CommSq.LiftStruct.unopEquiv sq) l = l.unop - CategoryTheory.CommSq.LiftStruct.opEquiv_symm_apply š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : C} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} (sq : CategoryTheory.CommSq f i p g) (l : āÆ.LiftStruct) : (CategoryTheory.CommSq.LiftStruct.opEquiv sq).symm l = l.unop - CategoryTheory.CommSq.LiftStruct.unopEquiv_symm_apply š Mathlib.CategoryTheory.CommSq
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {f : A ā¶ X} {i : A ā¶ B} {p : X ā¶ Y} {g : B ā¶ Y} (sq : CategoryTheory.CommSq f i p g) (l : āÆ.LiftStruct) : (CategoryTheory.CommSq.LiftStruct.unopEquiv sq).symm l = l.op - CategoryTheory.unop_epi_of_mono š Mathlib.CategoryTheory.EpiMono
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {A B : Cįµįµ} (f : A ā¶ B) [CategoryTheory.Mono f] : CategoryTheory.Epi f.unop - CategoryTheory.unop_mono_of_epi š Mathlib.CategoryTheory.EpiMono
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {A B : Cįµįµ} (f : B ā¶ A) [CategoryTheory.Epi f] : CategoryTheory.Mono f.unop - CategoryTheory.unop_epi_iff š Mathlib.CategoryTheory.EpiMono
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) : CategoryTheory.Epi f.unop ā CategoryTheory.Mono f - CategoryTheory.unop_mono_iff š Mathlib.CategoryTheory.EpiMono
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : Y ā¶ X) : CategoryTheory.Mono f.unop ā CategoryTheory.Epi f - CategoryTheory.Functor.hom_map š Mathlib.CategoryTheory.Functor.Hom
(C : Type u) [CategoryTheory.Category.{v, u} C] {Xā Yā : Cįµįµ Ć C} (f : Xā ā¶ Yā) : (CategoryTheory.Functor.hom C).map f = TypeCat.ofHom fun h => CategoryTheory.CategoryStruct.comp f.1.unop (CategoryTheory.CategoryStruct.comp h f.2) - CategoryTheory.yoneda_obj_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.yoneda.obj X).map f = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp f.unop g - CategoryTheory.uliftYoneda_obj_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] (X : C) {Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.uliftYoneda.{w, vā, uā}.obj X).map f = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp f.unop x.down } - CategoryTheory.Functor.RepresentableBy.homEquiv_unop_comp š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F : CategoryTheory.Functor Cįµįµ (Type u_1)} {Y : C} (h : F.RepresentableBy Y) {X : Cįµįµ} {X' : C} (f : Opposite.op X' ā¶ X) (g : X' ā¶ Y) : h.homEquiv (CategoryTheory.CategoryStruct.comp f.unop g) = (CategoryTheory.ConcreteCategory.hom (F.map f)) (h.homEquiv g) - CategoryTheory.uliftCoyonedaEquiv_uliftCoyoneda_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) : CategoryTheory.uliftCoyonedaEquiv (CategoryTheory.uliftCoyoneda.{w, vā, uā}.map f) = { down := f.unop } - CategoryTheory.yoneda_map_app š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {Xā Yā : C} (f : Xā ā¶ Yā) (xā : Cįµįµ) : (CategoryTheory.yoneda.map f).app xā = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g f - CategoryTheory.yonedaPairing_map š Mathlib.CategoryTheory.Yoneda
(C : Type uā) [CategoryTheory.Category.{vā, uā} C] (P Q : Cįµįµ Ć CategoryTheory.Functor Cįµįµ (Type vā)) (α : P ā¶ Q) : (CategoryTheory.yonedaPairing C).map α = TypeCat.ofHom fun β => CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map α.1.unop) (CategoryTheory.CategoryStruct.comp β α.2) - CategoryTheory.Yoneda.obj_map_id š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : C} (f : Opposite.op X ā¶ Opposite.op Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.yoneda.obj X).map f)) (CategoryTheory.CategoryStruct.id X) = (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.yoneda.map f.unop).app (Opposite.op Y))) (CategoryTheory.CategoryStruct.id Y) - CategoryTheory.map_yonedaEquiv' š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} {F : CategoryTheory.Functor Cįµįµ (Type vā)} (f : CategoryTheory.yoneda.obj (Opposite.unop X) ā¶ F) (g : X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.yonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app Y)) g.unop - CategoryTheory.uliftYonedaEquiv_naturality š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (f : CategoryTheory.uliftYoneda.{w, vā, uā}.obj (Opposite.unop X) ā¶ F) (g : X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.uliftYonedaEquiv f) = CategoryTheory.uliftYonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map g.unop) f) - CategoryTheory.yonedaEquiv_naturality' š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} {F : CategoryTheory.Functor Cįµįµ (Type vā)} (f : CategoryTheory.yoneda.obj (Opposite.unop X) ā¶ F) (g : X ā¶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.yonedaEquiv f) = CategoryTheory.yonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map g.unop) f) - CategoryTheory.uliftYonedaEquiv_symm_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (t : F.obj X) : CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map f.unop) (CategoryTheory.uliftYonedaEquiv.symm t) - CategoryTheory.yonedaEquiv_symm_map š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) {F : CategoryTheory.Functor Cįµįµ (Type vā)} (t : F.obj X) : CategoryTheory.yonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.yoneda.map f.unop) (CategoryTheory.yonedaEquiv.symm t) - CategoryTheory.uliftYonedaEquiv_symm_map_assoc š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y : Cįµįµ} (f : X ā¶ Y) {F : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (t : F.obj X) {Z : CategoryTheory.Functor Cįµįµ (Type (max w vā))} (h : F ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vā, uā}.map f.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm t) h) - CategoryTheory.Functor.CorepresentableBy.uniqueUpToIso_hom š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F : CategoryTheory.Functor C (Type v)} {X X' : C} (e : F.CorepresentableBy X) (e' : F.CorepresentableBy X') : (e.uniqueUpToIso e').hom = (CategoryTheory.Coyoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (āe.homEquiv.symm ā āe'.homEquiv), inv := TypeCat.ofHom (āe'.homEquiv.symm ā āe.homEquiv), hom_inv_id := āÆ, inv_hom_id := ⯠}) āÆ).hom).unop - CategoryTheory.Functor.CorepresentableBy.uniqueUpToIso_inv š Mathlib.CategoryTheory.Yoneda
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {F : CategoryTheory.Functor C (Type v)} {X X' : C} (e : F.CorepresentableBy X) (e' : F.CorepresentableBy X') : (e.uniqueUpToIso e').inv = (CategoryTheory.Coyoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (āe.homEquiv.symm ā āe'.homEquiv), inv := TypeCat.ofHom (āe'.homEquiv.symm ā āe.homEquiv), hom_inv_id := āÆ, inv_hom_id := ⯠}) āÆ).inv).unop - CategoryTheory.Limits.coconeLeftOpOfCone_ι_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 : Jįµįµ) : (CategoryTheory.Limits.coconeLeftOpOfCone c).ι.app X = (c.Ļ.app (Opposite.unop X)).unop - CategoryTheory.Limits.coneLeftOpOfCocone_Ļ_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.Cocone F) (X : Jįµįµ) : (CategoryTheory.Limits.coneLeftOpOfCocone c).Ļ.app X = (c.ι.app (Opposite.unop X)).unop - 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.Limits.coconeLeftOpOfConeEquiv_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.coconeLeftOpOfConeEquiv.functor.map f).hom = f.unop.hom.unop - CategoryTheory.Limits.coneLeftOpOfCoconeEquiv_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.coneLeftOpOfCoconeEquiv.functor.map f).hom = f.unop.hom.unop - CategoryTheory.Limits.coconeRightOpOfConeEquiv_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.coconeRightOpOfConeEquiv.functor.map f).hom = f.unop.hom.op - CategoryTheory.Limits.coneRightOpOfCoconeEquiv_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.coneRightOpOfCoconeEquiv.functor.map f).hom = f.unop.hom.op - 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.Limits.coconeUnopOfConeEquiv_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.coconeUnopOfConeEquiv.functor.map f).hom = f.unop.hom.unop - CategoryTheory.Limits.coneUnopOfCoconeEquiv_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.coneUnopOfCoconeEquiv.functor.map f).hom = f.unop.hom.unop - 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.Limits.coconeRightOpOfConeEquiv_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.rightOp} (f : Xā ā¶ Yā) : CategoryTheory.Limits.coconeRightOpOfConeEquiv.inverse.map f = Opposite.op { hom := f.hom.unop, w := ⯠} - CategoryTheory.Limits.coneRightOpOfCoconeEquiv_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.rightOp} (f : Yā ā¶ Xā) : CategoryTheory.Limits.coneRightOpOfCoconeEquiv.inverse.map f = Opposite.op { hom := f.hom.unop, w := ⯠} - 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.cocones_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.cocones J C).map f).app X = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp f.unop g - 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.coconeLeftOpOfConeEquiv_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.coconeLeftOpOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeLeftOp c), map := fun {X Y} f => Opposite.op { hom := f.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coconeLeftOpOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.coconeRightOpOfConeEquiv_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.coconeRightOpOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeRightOp c), map := fun {X Y} f => Opposite.op { hom := f.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coconeRightOpOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.coconeUnopOfConeEquiv_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.coconeUnopOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeUnop c), map := fun {X Y} f => Opposite.op { hom := f.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coconeUnopOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.unop, 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.coneLeftOpOfCoconeEquiv_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.coneLeftOpOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeLeftOp c), map := fun {Y X} f => Opposite.op { hom := f.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coneLeftOpOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.coneRightOpOfCoconeEquiv_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.coneRightOpOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeRightOp c), map := fun {Y X} f => Opposite.op { hom := f.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coneRightOpOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.coneUnopOfCoconeEquiv_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.coneUnopOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeUnop c), map := fun {Y X} f => Opposite.op { hom := f.hom.op, w := ⯠}, map_id := āÆ, map_comp := ⯠}.comp { obj := fun c => CategoryTheory.Limits.coneUnopOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.unop, w := ⯠}, map_id := āÆ, map_comp := ⯠}) - CategoryTheory.RetractArrow.unop š Mathlib.CategoryTheory.Retract
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z W : Cįµįµ} {f : X ā¶ Y} {g : Z ā¶ W} (h : CategoryTheory.RetractArrow f g) : CategoryTheory.RetractArrow f.unop g.unop - CategoryTheory.RetractArrow.unop_i š Mathlib.CategoryTheory.Retract
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z W : Cįµįµ} {f : X ā¶ Y} {g : Z ā¶ W} (h : CategoryTheory.RetractArrow f g) : h.unop.i = CategoryTheory.Arrow.homMk (CategoryTheory.Arrow.Hom.right h.r).unop (CategoryTheory.Arrow.Hom.left h.r).unop ⯠- CategoryTheory.RetractArrow.unop_r š Mathlib.CategoryTheory.Retract
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z W : Cįµįµ} {f : X ā¶ Y} {g : Z ā¶ W} (h : CategoryTheory.RetractArrow f g) : h.unop.r = CategoryTheory.Arrow.homMk (CategoryTheory.Arrow.Hom.right h.i).unop (CategoryTheory.Arrow.Hom.left h.i).unop ⯠- CategoryTheory.HasLiftingProperty.unop š Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} {i : A ā¶ B} {p : X ā¶ Y} (h : CategoryTheory.HasLiftingProperty i p) : CategoryTheory.HasLiftingProperty p.unop i.unop - CategoryTheory.HasLiftingProperty.iff_unop š Mathlib.CategoryTheory.LiftingProperties.Basic
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {A B X Y : Cįµįµ} (i : A ā¶ B) (p : X ā¶ Y) : CategoryTheory.HasLiftingProperty i p ā CategoryTheory.HasLiftingProperty p.unop i.unop - CategoryTheory.Limits.piConst_obj_map š Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] (X : C) {Xā Yā : Type wįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Limits.piConst.obj X).map f = CategoryTheory.Limits.Pi.map' ā(CategoryTheory.ConcreteCategory.hom f.unop) fun x => CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.piFunctor_obj_map š Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] (X : C) {Xā Yā : Type wįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Limits.piFunctor.obj X).map f = CategoryTheory.Limits.Pi.map' ā(CategoryTheory.ConcreteCategory.hom f.unop) fun x => CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.piConst_map_app š Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {Xā Yā : C} (f : Xā ā¶ Yā) (n : Type wįµįµ) : (CategoryTheory.Limits.piConst.map f).app n = CategoryTheory.Limits.Pi.map fun x => f - CategoryTheory.Limits.piFunctor_map_app š Mathlib.CategoryTheory.Limits.Shapes.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasProducts C] {Xā Yā : C} (f : Xā ā¶ Yā) (T : Type wįµįµ) : (CategoryTheory.Limits.piFunctor.map f).app T = CategoryTheory.Limits.Pi.map fun x => f - 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.Under.mapFunctor_map š Mathlib.CategoryTheory.Comma.Over.Basic
(T : Type uā) [CategoryTheory.Category.{vā, uā} T] {Xā Yā : Tįµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Under.mapFunctor T).map f = (CategoryTheory.Under.map f.unop).toCatHom - CategoryTheory.Over.opEquivOpUnder_functor_obj š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) (Y : CategoryTheory.Over (Opposite.op X)) : (CategoryTheory.Over.opEquivOpUnder X).functor.obj Y = Opposite.op (CategoryTheory.Under.mk Y.hom.unop) - CategoryTheory.Under.opEquivOpOver_functor_obj š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) (Y : CategoryTheory.Under (Opposite.op X)) : (CategoryTheory.Under.opEquivOpOver X).functor.obj Y = Opposite.op (CategoryTheory.Over.mk Y.hom.unop) - CategoryTheory.Over.opEquivOpUnder_inverse_map š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) {Z Y : (CategoryTheory.Under X)įµįµ} (f : Z ā¶ Y) : (CategoryTheory.Over.opEquivOpUnder X).inverse.map f = CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f.unop).op ⯠- CategoryTheory.Under.opEquivOpOver_inverse_map š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) {Z Y : (CategoryTheory.Over X)įµįµ} (f : Z ā¶ Y) : (CategoryTheory.Under.opEquivOpOver X).inverse.map f = CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f.unop).op ⯠- CategoryTheory.Over.opEquivOpUnder_functor_map š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) {Z Y : CategoryTheory.Over (Opposite.op X)} (f : Z ā¶ Y) : (CategoryTheory.Over.opEquivOpUnder X).functor.map f = Opposite.op (CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f).unop āÆ) - CategoryTheory.Under.opEquivOpOver_functor_map š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) {Z Y : CategoryTheory.Under (Opposite.op X)} (f : Z ā¶ Y) : (CategoryTheory.Under.opEquivOpOver X).functor.map f = Opposite.op (CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f).unop āÆ) - CategoryTheory.Over.opEquivOpUnder_counitIso š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) : (CategoryTheory.Over.opEquivOpUnder X).counitIso = CategoryTheory.Iso.refl ({ obj := fun Y => CategoryTheory.Over.mk (Opposite.unop Y).hom.op, map := fun {Z Y} f => CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f.unop).op āÆ, map_id := āÆ, map_comp := ⯠}.comp { obj := fun Y => Opposite.op (CategoryTheory.Under.mk Y.hom.unop), map := fun {Z Y} f => Opposite.op (CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f).unop āÆ), map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Under.opEquivOpOver_counitIso š Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uā} [CategoryTheory.Category.{vā, uā} T] (X : T) : (CategoryTheory.Under.opEquivOpOver X).counitIso = CategoryTheory.Iso.refl ({ obj := fun Y => CategoryTheory.Under.mk (Opposite.unop Y).hom.op, map := fun {Z Y} f => CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f.unop).op āÆ, map_id := āÆ, map_comp := ⯠}.comp { obj := fun Y => Opposite.op (CategoryTheory.Over.mk Y.hom.unop), map := fun {Z Y} f => Opposite.op (CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f).unop āÆ), map_id := āÆ, map_comp := ⯠}) - CategoryTheory.Limits.BinaryCofan.unop_mk š Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts.BinaryFan
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y P : C} (ιā : Opposite.op X ā¶ Opposite.op P) (ιā : Opposite.op Y ā¶ Opposite.op P) : (CategoryTheory.Limits.BinaryCofan.mk ιā ιā).unop = CategoryTheory.Limits.BinaryFan.mk ιā.unop ιā.unop - CategoryTheory.Limits.BinaryFan.unop_mk š Mathlib.CategoryTheory.Limits.Shapes.BinaryProducts.BinaryFan
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y P : C} (Ļā : Opposite.op P ā¶ Opposite.op X) (Ļā : Opposite.op P ā¶ Opposite.op Y) : (CategoryTheory.Limits.BinaryFan.mk Ļā Ļā).unop = CategoryTheory.Limits.BinaryCofan.mk Ļā.unop Ļā.unop - CategoryTheory.Limits.widePullbackShapeUnop_map š Mathlib.CategoryTheory.Limits.Shapes.WidePullbacks
(J : Type w) {Xā Yā : (CategoryTheory.Limits.WidePullbackShape J)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Limits.widePullbackShapeUnop J).map f = (CategoryTheory.Limits.widePullbackShapeOpMap J (Opposite.unop Yā) (Opposite.unop Xā) f.unop).unop - CategoryTheory.Limits.widePushoutShapeUnop_map š Mathlib.CategoryTheory.Limits.Shapes.WidePullbacks
(J : Type w) {Xā Yā : (CategoryTheory.Limits.WidePushoutShape J)įµįµ} (f : Xā ā¶ Yā) : (CategoryTheory.Limits.widePushoutShapeUnop J).map f = (CategoryTheory.Limits.widePushoutShapeOpMap J (Opposite.unop Yā) (Opposite.unop Xā) f.unop).unop - CategoryTheory.Limits.walkingCospanOpEquiv_functor_map š Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{Xā Yā : (CategoryTheory.Limits.WidePullbackShape CategoryTheory.Limits.WalkingPair)įµįµ} (f : Xā ā¶ Yā) : CategoryTheory.Limits.walkingCospanOpEquiv.functor.map f = (CategoryTheory.Limits.widePullbackShapeOpMap CategoryTheory.Limits.WalkingPair (Opposite.unop Yā) (Opposite.unop Xā) f.unop).unop - CategoryTheory.Limits.walkingSpanOpEquiv_functor_map š Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
{Xā Yā : (CategoryTheory.Limits.WidePushoutShape CategoryTheory.Limits.WalkingPair)įµįµ} (f : Xā ā¶ Yā) : CategoryTheory.Limits.walkingSpanOpEquiv.functor.map f = (CategoryTheory.Limits.widePushoutShapeOpMap CategoryTheory.Limits.WalkingPair (Opposite.unop Yā) (Opposite.unop Xā) f.unop).unop - CategoryTheory.MorphismProperty.MapFactorizationData.unop š Mathlib.CategoryTheory.MorphismProperty.Factorization
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wā Wā : CategoryTheory.MorphismProperty Cįµįµ} {X Y : Cįµįµ} {f : X ā¶ Y} (Ļ : Wā.MapFactorizationData Wā f) : Wā.unop.MapFactorizationData Wā.unop f.unop - CategoryTheory.MorphismProperty.MapFactorizationData.unop_Z š Mathlib.CategoryTheory.MorphismProperty.Factorization
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wā Wā : CategoryTheory.MorphismProperty Cįµįµ} {X Y : Cįµįµ} {f : X ā¶ Y} (Ļ : Wā.MapFactorizationData Wā f) : Ļ.unop.Z = Opposite.unop Ļ.Z - CategoryTheory.MorphismProperty.MapFactorizationData.unop_i š Mathlib.CategoryTheory.MorphismProperty.Factorization
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wā Wā : CategoryTheory.MorphismProperty Cįµįµ} {X Y : Cįµįµ} {f : X ā¶ Y} (Ļ : Wā.MapFactorizationData Wā f) : Ļ.unop.i = Ļ.p.unop - CategoryTheory.MorphismProperty.MapFactorizationData.unop_p š Mathlib.CategoryTheory.MorphismProperty.Factorization
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wā Wā : CategoryTheory.MorphismProperty Cįµįµ} {X Y : Cįµįµ} {f : X ā¶ Y} (Ļ : Wā.MapFactorizationData Wā f) : Ļ.unop.p = Ļ.i.unop - CategoryTheory.MorphismProperty.MapFactorizationData.opEquiv_symm_apply š Mathlib.CategoryTheory.MorphismProperty.Factorization
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Wā Wā : CategoryTheory.MorphismProperty C} {X Y : C} {f : X ā¶ Y} (Ļ : Wā.op.MapFactorizationData Wā.op f.op) : CategoryTheory.MorphismProperty.MapFactorizationData.opEquiv.symm Ļ = Ļ.unop - CategoryTheory.Limits.unop_zero š Mathlib.CategoryTheory.Limits.Shapes.ZeroMorphisms
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.Limits.HasZeroMorphisms C] (X Y : Cįµįµ) : Quiver.Hom.unop 0 = 0 - CategoryTheory.shrinkCoyonedaObjObjEquiv_map_app š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cįµįµ} {Y : C} (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) (g : X ā¶ X') : CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) f) = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkCoyonedaObjObjEquiv f) - CategoryTheory.shrinkCoyonedaObjObjEquiv_map_app_assoc š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cįµįµ} {Y : C} (f : (CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X).obj Y) (g : X ā¶ X') {Z : C} (h : Y ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) f)) h = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyonedaObjObjEquiv f) h) - CategoryTheory.shrinkCoyoneda_map_app_shrinkCoyonedaObjObjEquiv_symm š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X X' : Cįµįµ} {Y : C} (f : Opposite.unop X ā¶ Y) (g : X ā¶ X') : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyoneda.{w, v, u}.map g).app Y)) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f) = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkCoyonedaEquiv_shrinkCoyoneda_map š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cįµįµ} (f : X ā¶ Y) : CategoryTheory.shrinkCoyonedaEquiv (CategoryTheory.shrinkCoyoneda.{w, v, u}.map f) = CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f.unop - CategoryTheory.shrinkCoyonedaEquiv_naturality š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cįµįµ} {P : CategoryTheory.Functor C (Type w)} (f : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ā¶ P) (g : Y ā¶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.unop)) (CategoryTheory.shrinkCoyonedaEquiv f) = CategoryTheory.shrinkCoyonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkCoyoneda.{w, v, u}.map g) f) - CategoryTheory.shrinkYonedaObjObjEquiv_obj_map š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cįµįµ} (g : Y ā¶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) : CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f) = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkYonedaObjObjEquiv f) - CategoryTheory.shrinkYonedaObjObjEquiv_obj_map_assoc š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cįµįµ} (g : Y ā¶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) {Z : C} (h : X ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f)) h = CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaObjObjEquiv f) h) - CategoryTheory.shrinkYoneda_obj_map š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cįµįµ} (g : Y ā¶ Y') (f : (CategoryTheory.shrinkYoneda.{w, v, u}.obj X).obj Y) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) f = CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop (CategoryTheory.shrinkYonedaObjObjEquiv f)) - CategoryTheory.shrinkYoneda_obj_map_shrinkYonedaObjObjEquiv_symm š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : C} {Y Y' : Cįµįµ} (g : Y ā¶ Y') (f : Opposite.unop Y ā¶ X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkYoneda.{w, v, u}.obj X).map g)) (CategoryTheory.shrinkYonedaObjObjEquiv.symm f) = CategoryTheory.shrinkYonedaObjObjEquiv.symm (CategoryTheory.CategoryStruct.comp g.unop f) - CategoryTheory.shrinkCoyonedaEquiv_symm_app_shrinkCoyonedaObjObjEquiv_symm š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X : Cįµįµ} {P : CategoryTheory.Functor C (Type w)} (s : P.obj (Opposite.unop X)) {Y : Cįµįµ} (f : Y ā¶ X) : (CategoryTheory.ConcreteCategory.hom ((CategoryTheory.shrinkCoyonedaEquiv.symm s).app (Opposite.unop Y))) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm f.unop) = (CategoryTheory.ConcreteCategory.hom (P.map f.unop)) s - CategoryTheory.map_shrinkCoyonedaEquiv š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cįµįµ} {P : CategoryTheory.Functor C (Type w)} (f : CategoryTheory.shrinkCoyoneda.{w, v, u}.obj X ā¶ P) (g : Y ā¶ X) : (CategoryTheory.ConcreteCategory.hom (P.map g.unop)) (CategoryTheory.shrinkCoyonedaEquiv f) = (CategoryTheory.ConcreteCategory.hom (f.app (Opposite.unop Y))) (CategoryTheory.shrinkCoyonedaObjObjEquiv.symm g.unop) - CategoryTheory.shrinkYonedaEquiv_symm_map š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cįµįµ} (f : X ā¶ Y) {P : CategoryTheory.Functor Cįµįµ (Type w)} (t : P.obj X) : CategoryTheory.shrinkYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYoneda.{w, v, u}.map f.unop) (CategoryTheory.shrinkYonedaEquiv.symm t) - CategoryTheory.shrinkYonedaEquiv_symm_map_assoc š Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] {X Y : Cįµįµ} (f : X ā¶ Y) {P : CategoryTheory.Functor Cįµįµ (Type w)} (t : P.obj X) {Z : CategoryTheory.Functor Cįµįµ (Type w)} (h : P ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (P.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYoneda.{w, v, u}.map f.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.shrinkYonedaEquiv.symm t) h) - CategoryTheory.unop_whiskerLeft š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X : Cįµįµ) {Y Z : Cįµįµ} (f : Y ā¶ Z) : (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X f).unop = CategoryTheory.MonoidalCategoryStruct.whiskerLeft (Opposite.unop X) f.unop - CategoryTheory.unop_whiskerRight š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] {X Y : Cįµįµ} (f : X ā¶ Y) (Z : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.whiskerRight f Z).unop = CategoryTheory.MonoidalCategoryStruct.whiskerRight f.unop (Opposite.unop Z) - CategoryTheory.unop_tensor_unop š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] {W X Y Z : Cįµįµ} (f : W ā¶ X) (g : Y ā¶ Z) : CategoryTheory.MonoidalCategoryStruct.tensorHom f.unop g.unop = (CategoryTheory.MonoidalCategoryStruct.tensorHom f g).unop - CategoryTheory.unop_hom_leftUnitor š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).hom.unop = (CategoryTheory.MonoidalCategoryStruct.leftUnitor (Opposite.unop X)).inv - CategoryTheory.unop_hom_rightUnitor š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).hom.unop = (CategoryTheory.MonoidalCategoryStruct.rightUnitor (Opposite.unop X)).inv - CategoryTheory.unop_inv_leftUnitor š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).inv.unop = (CategoryTheory.MonoidalCategoryStruct.leftUnitor (Opposite.unop X)).hom - CategoryTheory.unop_inv_rightUnitor š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).inv.unop = (CategoryTheory.MonoidalCategoryStruct.rightUnitor (Opposite.unop X)).hom - CategoryTheory.unop_tensorHom š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] {Xā Yā Xā Yā : Cįµįµ} (f : Xā ā¶ Yā) (g : Xā ā¶ Yā) : (CategoryTheory.MonoidalCategoryStruct.tensorHom f g).unop = CategoryTheory.MonoidalCategoryStruct.tensorHom f.unop g.unop - CategoryTheory.unop_hom_associator š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X Y Z : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).hom.unop = (CategoryTheory.MonoidalCategoryStruct.associator (Opposite.unop X) (Opposite.unop Y) (Opposite.unop Z)).inv - CategoryTheory.unop_inv_associator š Mathlib.CategoryTheory.Monoidal.Opposite
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] (X Y Z : Cįµįµ) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).inv.unop = (CategoryTheory.MonoidalCategoryStruct.associator (Opposite.unop X) (Opposite.unop Y) (Opposite.unop Z)).hom - CategoryTheory.unop_hom_braiding š Mathlib.CategoryTheory.Monoidal.Braided.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X Y : Cįµįµ) : (β_ X Y).hom.unop = (β_ (Opposite.unop Y) (Opposite.unop X)).hom - CategoryTheory.unop_inv_braiding š Mathlib.CategoryTheory.Monoidal.Braided.Basic
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X Y : Cįµįµ) : (β_ X Y).inv.unop = (β_ (Opposite.unop Y) (Opposite.unop X)).inv - CategoryTheory.Limits.isColimitCoconeLeftOpOfCone_desc š 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įµįµ) {c : CategoryTheory.Limits.Cone F} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cocone F.leftOp) : (CategoryTheory.Limits.isColimitCoconeLeftOpOfCone F hc).desc s = (hc.lift (CategoryTheory.Limits.coneOfCoconeLeftOp s)).unop - CategoryTheory.Limits.isLimitConeLeftOpOfCocone_lift š 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įµįµ) {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (s : CategoryTheory.Limits.Cone F.leftOp) : (CategoryTheory.Limits.isLimitConeLeftOpOfCocone F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeOfConeLeftOp s)).unop - CategoryTheory.Limits.isColimitCoconeUnopOfCone_desc š 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įµįµ) {c : CategoryTheory.Limits.Cone F} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cocone F.unop) : (CategoryTheory.Limits.isColimitCoconeUnopOfCone F hc).desc s = (hc.lift (CategoryTheory.Limits.coneOfCoconeUnop s)).unop - CategoryTheory.Limits.isLimitConeUnopOfCocone_lift š 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įµįµ) {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsColimit c) (s : CategoryTheory.Limits.Cone F.unop) : (CategoryTheory.Limits.isLimitConeUnopOfCocone F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeOfConeUnop s)).unop - CategoryTheory.Limits.isColimitOfConeRightOpOfCocone_desc š 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) {c : CategoryTheory.Limits.Cocone F} (hc : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.coneRightOpOfCocone c)) (s : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Limits.isColimitOfConeRightOpOfCocone F hc).desc s = (hc.lift (CategoryTheory.Limits.coneRightOpOfCocone s)).unop - CategoryTheory.Limits.isLimitOfCoconeRightOpOfCone_lift š 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) {c : CategoryTheory.Limits.Cone F} (hc : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.coconeRightOpOfCone c)) (s : CategoryTheory.Limits.Cone F) : (CategoryTheory.Limits.isLimitOfCoconeRightOpOfCone F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeRightOpOfCone s)).unop - CategoryTheory.Limits.isColimitCoconeOfConeRightOp_desc š 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) {c : CategoryTheory.Limits.Cone F.rightOp} (hc : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cocone F) : (CategoryTheory.Limits.isColimitCoconeOfConeRightOp F hc).desc s = (hc.lift (CategoryTheory.Limits.coneRightOpOfCocone s)).unop - CategoryTheory.Limits.isColimitOfConeOfCoconeLeftOp_desc š 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įµįµ) {c : CategoryTheory.Limits.Cocone F.leftOp} (hc : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.coneOfCoconeLeftOp c)) (s : CategoryTheory.Limits.Cocone F.leftOp) : (CategoryTheory.Limits.isColimitOfConeOfCoconeLeftOp F hc).desc s = (hc.lift (CategoryTheory.Limits.coneOfCoconeLeftOp s)).unop - CategoryTheory.Limits.isColimitOfConeOfCoconeUnop_desc š 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įµįµ) {c : CategoryTheory.Limits.Cocone F.unop} (hc : CategoryTheory.Limits.IsLimit (CategoryTheory.Limits.coneOfCoconeUnop c)) (s : CategoryTheory.Limits.Cocone F.unop) : (CategoryTheory.Limits.isColimitOfConeOfCoconeUnop F hc).desc s = (hc.lift (CategoryTheory.Limits.coneOfCoconeUnop s)).unop - CategoryTheory.Limits.isLimitConeOfCoconeRightOp_lift š 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) {c : CategoryTheory.Limits.Cocone F.rightOp} (hc : CategoryTheory.Limits.IsColimit c) (s : CategoryTheory.Limits.Cone F) : (CategoryTheory.Limits.isLimitConeOfCoconeRightOp F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeRightOpOfCone s)).unop - CategoryTheory.Limits.isLimitOfCoconeOfConeLeftOp_lift š 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įµįµ) {c : CategoryTheory.Limits.Cone F.leftOp} (hc : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.coconeOfConeLeftOp c)) (s : CategoryTheory.Limits.Cone F.leftOp) : (CategoryTheory.Limits.isLimitOfCoconeOfConeLeftOp F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeOfConeLeftOp s)).unop - CategoryTheory.Limits.isLimitOfCoconeOfConeUnop_lift š 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įµįµ) {c : CategoryTheory.Limits.Cone F.unop} (hc : CategoryTheory.Limits.IsColimit (CategoryTheory.Limits.coconeOfConeUnop c)) (s : CategoryTheory.Limits.Cone F.unop) : (CategoryTheory.Limits.isLimitOfCoconeOfConeUnop F hc).lift s = (hc.desc (CategoryTheory.Limits.coconeOfConeUnop s)).unop - CategoryTheory.Limits.limitLeftOpIsoUnopColimit_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.limitLeftOpIsoUnopColimit F).hom (CategoryTheory.Limits.colimit.ι F j).unop = CategoryTheory.Limits.limit.Ļ F.leftOp (Opposite.op j) - CategoryTheory.Limits.limitLeftOpIsoUnopColimit_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.limitLeftOpIsoUnopColimit F).inv (CategoryTheory.Limits.limit.Ļ F.leftOp j) = (CategoryTheory.Limits.colimit.ι F (Opposite.unop j)).unop - CategoryTheory.Limits.ι_comp_colimitLeftOpIsoUnopLimit_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.leftOp j) (CategoryTheory.Limits.colimitLeftOpIsoUnopLimit F).hom = (CategoryTheory.Limits.limit.Ļ F (Opposite.unop j)).unop - CategoryTheory.Limits.Ļ_comp_colimitLeftOpIsoUnopLimit_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).unop (CategoryTheory.Limits.colimitLeftOpIsoUnopLimit F).inv = CategoryTheory.Limits.colimit.ι F.leftOp (Opposite.op j) - CategoryTheory.Limits.limitUnopIsoUnopColimit_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.limitUnopIsoUnopColimit F).inv (CategoryTheory.Limits.limit.Ļ F.unop j) = (CategoryTheory.Limits.colimit.ι F (Opposite.op j)).unop - CategoryTheory.Limits.ι_comp_colimitUnopIsoOpLimit_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.unop j) (CategoryTheory.Limits.colimitUnopIsoOpLimit F).hom = (CategoryTheory.Limits.limit.Ļ F (Opposite.op j)).unop - CategoryTheory.Limits.limitUnopIsoUnopColimit_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.limitUnopIsoUnopColimit F).hom (CategoryTheory.Limits.colimit.ι F j).unop = CategoryTheory.Limits.limit.Ļ F.unop (Opposite.unop j) - CategoryTheory.Limits.Ļ_comp_colimitUnopIsoOpLimit_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).unop (CategoryTheory.Limits.colimitUnopIsoOpLimit F).inv = CategoryTheory.Limits.colimit.ι F.unop (Opposite.unop j) - CategoryTheory.Limits.limitLeftOpIsoUnopColimit_hom_comp_ι_assoc š 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) {Z : C} (h : Opposite.unop (F.obj j) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitLeftOpIsoUnopColimit F).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F j).unop h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F.leftOp (Opposite.op j)) h - CategoryTheory.Limits.Ļ_comp_colimitLeftOpIsoUnopLimit_inv_assoc š 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) {Z : C} (h : CategoryTheory.Limits.colimit F.leftOp ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F j).unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimitLeftOpIsoUnopLimit F).inv h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F.leftOp (Opposite.op j)) h - CategoryTheory.Limits.limitLeftOpIsoUnopColimit_inv_comp_Ļ_assoc š 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įµįµ) {Z : C} (h : F.leftOp.obj j ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitLeftOpIsoUnopColimit F).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F.leftOp j) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F (Opposite.unop j)).unop h - CategoryTheory.Limits.ι_comp_colimitLeftOpIsoUnopLimit_hom_assoc š 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įµįµ) {Z : C} (h : Opposite.unop (CategoryTheory.Limits.limit F) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F.leftOp j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimitLeftOpIsoUnopLimit F).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F (Opposite.unop j)).unop h - CategoryTheory.Limits.limitUnopIsoUnopColimit_inv_comp_Ļ_assoc š 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) {Z : C} (h : F.unop.obj j ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitUnopIsoUnopColimit F).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F.unop j) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F (Opposite.op j)).unop h - CategoryTheory.Limits.ι_comp_colimitUnopIsoOpLimit_hom_assoc š 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) {Z : C} (h : Opposite.unop (CategoryTheory.Limits.limit F) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F.unop j) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimitUnopIsoOpLimit F).hom h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F (Opposite.op j)).unop h - CategoryTheory.Limits.limitUnopIsoUnopColimit_hom_comp_ι_assoc š 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įµįµ) {Z : C} (h : Opposite.unop (F.obj j) ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limitUnopIsoUnopColimit F).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F j).unop h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F.unop (Opposite.unop j)) h - CategoryTheory.Limits.Ļ_comp_colimitUnopIsoOpLimit_inv_assoc š 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įµįµ) {Z : C} (h : CategoryTheory.Limits.colimit F.unop ā¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.limit.Ļ F j).unop (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimitUnopIsoOpLimit F).inv h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.colimit.ι F.unop (Opposite.unop j)) h - CategoryTheory.Limits.instHasPullbackUnopOfHasPushoutOpposite š Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} (f : X ā¶ Y) (g : X ā¶ Z) [CategoryTheory.Limits.HasPushout f g] : CategoryTheory.Limits.HasPullback f.unop g.unop - CategoryTheory.Limits.instHasPushoutUnopOfHasPullbackOpposite š Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} (f : X ā¶ Z) (g : Y ā¶ Z) [CategoryTheory.Limits.HasPullback f g] : CategoryTheory.Limits.HasPushout f.unop g.unop - CategoryTheory.Limits.PullbackCone.unop š Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} {f : X ā¶ Z} {g : Y ā¶ Z} (c : CategoryTheory.Limits.PullbackCone f g) : CategoryTheory.Limits.PushoutCocone f.unop g.unop - CategoryTheory.Limits.PushoutCocone.unop š Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} {f : X ā¶ Y} {g : X ā¶ Z} (c : CategoryTheory.Limits.PushoutCocone f g) : CategoryTheory.Limits.PullbackCone f.unop g.unop - CategoryTheory.Limits.hasPullback_unop_iff_hasPushout š Mathlib.CategoryTheory.Limits.Shapes.Opposites.Pullbacks
{C : Type uā} [CategoryTheory.Category.{vā, uā} C] {X Y Z : Cįµįµ} (f : X ā¶ Y) (g : X ā¶ Z) : CategoryTheory.Limits.HasPullback f.unop g.unop ā CategoryTheory.Limits.HasPushout f g
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