Loogle!
Result
Found 2023 declarations mentioning Opposite.unop. Of these, only the first 200 are shown.
- Opposite.unop đ Mathlib.Data.Opposite
{α : Sort u} (self : αá”á”) : α - Opposite.unop_injective đ Mathlib.Data.Opposite
{α : Sort u} : Function.Injective Opposite.unop - Opposite.unop_surjective đ Mathlib.Data.Opposite
{α : Sort u} : Function.Surjective Opposite.unop - Opposite.unop_op đ Mathlib.Data.Opposite
{α : Sort u} (x : α) : Opposite.unop (Opposite.op x) = x - Opposite.op_unop đ Mathlib.Data.Opposite
{α : Sort u} (x : αá”á”) : Opposite.op (Opposite.unop x) = x - Opposite.op_eq_iff_eq_unop đ Mathlib.Data.Opposite
{α : Sort u} {x : α} {y : αá”á”} : Opposite.op x = y â x = Opposite.unop y - Opposite.unop_eq_iff_eq_op đ Mathlib.Data.Opposite
{α : Sort u} {x : αá”á”} {y : α} : Opposite.unop x = y â x = Opposite.op y - Opposite.unop_inj_iff đ Mathlib.Data.Opposite
{α : Sort u} (x y : αá”á”) : Opposite.unop x = Opposite.unop y â x = y - Opposite.equivToOpposite_symm_coe đ Mathlib.Data.Opposite
{α : Sort u} : âOpposite.equivToOpposite.symm = Opposite.unop - 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.opEquiv_symm_apply đ Mathlib.Combinatorics.Quiver.Basic
{V : Type u_1} [Quiver V] {X Y : V} (self : (Opposite.unop (Opposite.op X) â¶ Opposite.unop (Opposite.op Y))á”á”) : Quiver.Hom.opEquiv.symm self = Opposite.unop self - CategoryTheory.Iso.unop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y : Cá”á”} (f : X â Y) : Opposite.unop Y â Opposite.unop X - CategoryTheory.isoOpEquiv đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) : (A â B) â (Opposite.unop B â Opposite.unop A) - CategoryTheory.unopUnop_obj đ Mathlib.CategoryTheory.Opposites
(C : Type uâ) [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”á”á”) : (CategoryTheory.unopUnop C).obj X = Opposite.unop (Opposite.unop X) - Quiver.Hom.unop_inj đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [Quiver C] {X Y : Cá”á”} : Function.Injective Quiver.Hom.unop - CategoryTheory.opEquiv đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) : (A â¶ B) â (Opposite.unop B â¶ Opposite.unop A) - CategoryTheory.Iso.unop_refl đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”) : (CategoryTheory.Iso.refl X).unop = CategoryTheory.Iso.refl (Opposite.unop X) - CategoryTheory.decidableEqOfUnop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) [DecidableEq (Opposite.unop B â¶ Opposite.unop A)] : DecidableEq (A â¶ B) - CategoryTheory.subsingleton_of_unop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) [Subsingleton (Opposite.unop B â¶ Opposite.unop A)] : Subsingleton (A â¶ B) - 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) - CategoryTheory.Iso.op_unop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} 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} (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.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.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.Functor.leftOp_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.leftOp.obj X = Opposite.unop (F.obj (Opposite.unop X)) - 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 - CategoryTheory.op_id_unop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.CategoryStruct.{vâ, uâ} C] {X : Cá”á”} : (CategoryTheory.CategoryStruct.id (Opposite.unop X)).op = CategoryTheory.CategoryStruct.id X - CategoryTheory.Iso.unop_op đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y : Cá”á”} (f : X â Y) : f.unop.op = f - Quiver.Hom.op_unop đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [Quiver C] {X Y : Cá”á”} (f : X â¶ Y) : f.unop.op = f - CategoryTheory.Functor.unop_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.unop.obj X = Opposite.unop (F.obj (Opposite.op X)) - CategoryTheory.Iso.unop_symm đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y : Cá”á”} (α : X â Y) : α.symm.unop = α.unop.symm - 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 - CategoryTheory.Equivalence.leftOp_functor_obj đ 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.leftOp.functor.obj X = Opposite.unop (e.functor.obj (Opposite.unop X)) - CategoryTheory.Equivalence.rightOp_inverse_obj đ 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.rightOp.inverse.obj X = Opposite.unop (e.inverse.obj (Opposite.unop X)) - 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.Iso.unop_trans đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y Z : Cá”á”} (α : X â Y) (ÎČ : Y â Z) : (α âȘâ« ÎČ).unop = ÎČ.unop âȘ⫠α.unop - 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.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.isoOpEquiv_apply đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) (f : A â B) : (CategoryTheory.isoOpEquiv A B) f = f.unop - 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.leftOpRightOpEquiv_functor_obj_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) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).functor.obj F).obj X = Opposite.op ((Opposite.unop F).obj (Opposite.op X)) - 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.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.Functor.leftOpId_hom_app đ Mathlib.CategoryTheory.Opposites
(C : Type uâ) [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”á”á”) : (CategoryTheory.Functor.leftOpId C).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.unop X)) - CategoryTheory.Functor.leftOpId_inv_app đ Mathlib.CategoryTheory.Opposites
(C : Type uâ) [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”á”á”) : (CategoryTheory.Functor.leftOpId C).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (Opposite.unop X)) - CategoryTheory.isoOpEquiv_symm_apply đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) (g : Opposite.unop B â Opposite.unop A) : (CategoryTheory.isoOpEquiv A B).symm g = g.op - 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.NatTrans.removeUnop_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.unop â¶ G.unop) (X : Cá”á”) : (CategoryTheory.NatTrans.removeUnop α).app X = (α.app (Opposite.unop X)).op - 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.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.opEquiv_symm_apply đ Mathlib.CategoryTheory.Opposites
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (A B : Cá”á”) (g : Opposite.unop B â¶ Opposite.unop A) : (CategoryTheory.opEquiv A B).symm g = g.op - CategoryTheory.Functor.unopComp_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.unopComp G).hom.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (G.obj (F.obj (Opposite.op X)))) - CategoryTheory.Functor.unopComp_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.unopComp G).inv.app X = CategoryTheory.CategoryStruct.id (Opposite.unop (G.obj (F.obj (Opposite.op X)))) - 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.Functor.leftOpRightOpEquiv_functor_obj_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â) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).functor.obj F).map f = ((Opposite.unop F).map f.op).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.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.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.Equivalence.leftOp_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.leftOp.unitIso.hom.app X = (e.unitIso.inv.app (Opposite.unop X)).op - CategoryTheory.Equivalence.leftOp_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.leftOp.unitIso.inv.app X = (e.unitIso.hom.app (Opposite.unop X)).op - CategoryTheory.Equivalence.rightOp_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.rightOp.counitIso.hom.app X = (e.counitIso.inv.app (Opposite.unop X)).op - CategoryTheory.Equivalence.rightOp_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.rightOp.counitIso.inv.app X = (e.counitIso.hom.app (Opposite.unop X)).op - 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.Functor.const.opObjUnop đ 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.unop X) â ((CategoryTheory.Functor.const J).obj X).leftOp - 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.opObjUnop_hom_app đ Mathlib.CategoryTheory.Functor.Const
{J : Type uâ} [CategoryTheory.Category.{vâ, uâ} J] {C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”) (j : Já”á”) : (CategoryTheory.Functor.const.opObjUnop X).hom.app j = CategoryTheory.CategoryStruct.id (((CategoryTheory.Functor.const Já”á”).obj (Opposite.unop X)).obj j) - CategoryTheory.Functor.const.opObjUnop_inv_app đ Mathlib.CategoryTheory.Functor.Const
{J : Type uâ} [CategoryTheory.Category.{vâ, uâ} J] {C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”) (j : Já”á”) : (CategoryTheory.Functor.const.opObjUnop X).inv.app j = CategoryTheory.CategoryStruct.id (((CategoryTheory.Functor.const J).obj X).leftOp.obj j) - CategoryTheory.prodOpEquiv_inverse_obj đ 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).inverse.obj xâ = Opposite.op (Opposite.unop xâ.1, Opposite.unop xâ.2) - CategoryTheory.prodOpEquiv_functor_obj đ 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).functor.obj X = (Opposite.op (Opposite.unop X).1, Opposite.op (Opposite.unop X).2) - 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.Discrete.opposite_functor_obj_as đ Mathlib.CategoryTheory.Discrete.Basic
(α : Type uâ) (X : (CategoryTheory.Discrete α)á”á”) : ((CategoryTheory.Discrete.opposite α).functor.obj X).as = (Opposite.unop X).as - 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.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.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.Groupoid.invEquivalence_inverse_obj đ Mathlib.CategoryTheory.Groupoid
(C : Type u) [CategoryTheory.Groupoid C] (self : Cá”á”) : (CategoryTheory.Groupoid.invEquivalence C).inverse.obj self = Opposite.unop self - 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_obj đ Mathlib.CategoryTheory.Functor.Hom
(C : Type u) [CategoryTheory.Category.{v, u} C] (p : Cá”á” Ă C) : (CategoryTheory.Functor.hom C).obj p = (Opposite.unop p.1 â¶ p.2) - 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.Functor.CorepresentableBy.coyoneda đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”) : (CategoryTheory.coyoneda.obj X).CorepresentableBy (Opposite.unop X) - CategoryTheory.yoneda_obj_obj đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : C) (Y : Cá”á”) : (CategoryTheory.yoneda.obj X).obj Y = (Opposite.unop Y â¶ X) - CategoryTheory.uliftYoneda_obj_obj đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : C) (Xâ : Cá”á”) : (CategoryTheory.uliftYoneda.{w, vâ, uâ}.obj X).obj Xâ = ULift.{w, vâ} (Opposite.unop Xâ â¶ X) - CategoryTheory.uliftCoyonedaEquiv đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : Cá”á”} {F : CategoryTheory.Functor C (Type (max w vâ))} : (CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.obj X â¶ F) â F.obj (Opposite.unop X) - CategoryTheory.Functor.CorepresentableBy.coyoneda_homEquiv đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : Cá”á”) (Y : C) : (CategoryTheory.Functor.CorepresentableBy.coyoneda X).homEquiv = Equiv.refl (Opposite.unop X â¶ Y) - 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.uliftCoyonedaIsoCoyoneda_hom_app_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{max w vâ, uâ} C] (X : Cá”á”) (Xâ : C) : (CategoryTheory.uliftCoyonedaIsoCoyoneda.hom.app X).app Xâ = Equiv.ulift.toIso.hom - CategoryTheory.uliftCoyonedaIsoCoyoneda_inv_app_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{max w vâ, uâ} C] (X : Cá”á”) (Xâ : C) : (CategoryTheory.uliftCoyonedaIsoCoyoneda.inv.app X).app Xâ = Equiv.ulift.toIso.inv - CategoryTheory.uliftYonedaIsoYoneda_hom_app_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{max w vâ, uâ} C] (X : C) (Xâ : Cá”á”) : (CategoryTheory.uliftYonedaIsoYoneda.hom.app X).app Xâ = Equiv.ulift.toIso.hom - CategoryTheory.uliftYonedaIsoYoneda_inv_app_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{max w vâ, uâ} C] (X : C) (Xâ : Cá”á”) : (CategoryTheory.uliftYonedaIsoYoneda.inv.app X).app Xâ = Equiv.ulift.toIso.inv - CategoryTheory.Coyoneda.objOpOp_hom_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : C) (Xâ : Cá”á”) : (CategoryTheory.Coyoneda.objOpOp X).hom.app Xâ = (CategoryTheory.opEquiv (Opposite.op X) Xâ).toIso.hom - CategoryTheory.Coyoneda.objOpOp_inv_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (X : C) (Xâ : Cá”á”) : (CategoryTheory.Coyoneda.objOpOp X).inv.app Xâ = (CategoryTheory.opEquiv (Opposite.op X) Xâ).toIso.inv - CategoryTheory.yonedaEquiv_symm_app_apply đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : C} {F : CategoryTheory.Functor Cá”á” (Type vâ)} (x : F.obj (Opposite.op X)) (Y : Cá”á”) (f : Opposite.unop Y â¶ X) : (CategoryTheory.ConcreteCategory.hom (F.map f.op)) x = (CategoryTheory.ConcreteCategory.hom (F.map f.op)) x - 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.Coyoneda.fullyFaithful_preimage đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y : Cá”á”} (f : CategoryTheory.coyoneda.obj X â¶ CategoryTheory.coyoneda.obj Y) : CategoryTheory.Coyoneda.fullyFaithful.preimage f = Quiver.Hom.op ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.unop X))) (CategoryTheory.CategoryStruct.id (Opposite.unop X))) - 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.uliftYoneda_map_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {Xâ Yâ : C} (f : Xâ â¶ Yâ) (X : Cá”á”) : (CategoryTheory.uliftYoneda.{w, vâ, uâ}.map f).app X = TypeCat.ofHom fun x => { down := CategoryTheory.CategoryStruct.comp x.down f } - CategoryTheory.Functor.reprW_hom_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (F : CategoryTheory.Functor Cá”á” (Type vâ)) [F.IsRepresentable] (X : Cá”á”) (f : Opposite.unop X â¶ F.reprX) : (CategoryTheory.ConcreteCategory.hom (F.reprW.hom.app X)) f = (CategoryTheory.ConcreteCategory.hom (F.map f.op)) F.reprx - CategoryTheory.uliftCoyonedaEquiv_symm_apply_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : Cá”á”} {F : CategoryTheory.Functor C (Type (max w vâ))} (x : F.obj (Opposite.unop X)) (Y : C) : (CategoryTheory.uliftCoyonedaEquiv.symm x).app Y = TypeCat.ofHom fun y => (CategoryTheory.ConcreteCategory.hom (F.map y.down)) x - CategoryTheory.uliftCoyonedaEquiv_apply đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : Cá”á”} {F : CategoryTheory.Functor C (Type (max w vâ))} (Ï : CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.obj X â¶ F) : CategoryTheory.uliftCoyonedaEquiv Ï = (CategoryTheory.ConcreteCategory.hom (Ï.app (Opposite.unop X))) { down := CategoryTheory.CategoryStruct.id (Opposite.unop X) } - CategoryTheory.Functor.uliftYonedaReprXIso_hom_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (F : CategoryTheory.Functor Cá”á” (Type (max v vâ))) [F.IsRepresentable] (X : Cá”á”) (f : ULift.{v, vâ} (Opposite.unop X â¶ F.reprX)) : (CategoryTheory.ConcreteCategory.hom (F.uliftYonedaReprXIso.hom.app X)) f = (CategoryTheory.ConcreteCategory.hom (F.map f.down.op)) F.reprx - CategoryTheory.Functor.FullyFaithful.homNatIso_hom_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {D : Type uâ} [CategoryTheory.Category.{vâ, uâ} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xâ : Cá”á”) : (hF.homNatIso X).hom.app Xâ = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.hom - CategoryTheory.Functor.FullyFaithful.homNatIso_inv_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {D : Type uâ} [CategoryTheory.Category.{vâ, uâ} D] {F : CategoryTheory.Functor C D} (hF : F.FullyFaithful) (X : C) (Xâ : Cá”á”) : (hF.homNatIso X).inv.app Xâ = (Equiv.ulift.trans (hF.homEquiv.symm.trans Equiv.ulift.symm)).toIso.inv - CategoryTheory.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.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.uliftYonedaEquiv_symm_apply_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : C} {F : CategoryTheory.Functor Cá”á” (Type (max w vâ))} (x : F.obj (Opposite.op X)) (Y : Cá”á”) : (CategoryTheory.uliftYonedaEquiv.symm x).app Y = TypeCat.ofHom fun y => (CategoryTheory.ConcreteCategory.hom (F.map y.down.op)) x - CategoryTheory.yonedaEquiv_symm_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : C} {F : CategoryTheory.Functor Cá”á” (Type vâ)} (x : F.obj (Opposite.op X)) (Y : Cá”á”) : (CategoryTheory.yonedaEquiv.symm x).app Y = TypeCat.ofHom fun f => (CategoryTheory.ConcreteCategory.hom (F.map (Quiver.Hom.op f))) x - CategoryTheory.yoneda_map_app đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {Xâ Yâ : C} (f : Xâ â¶ Yâ) (xâ : Cá”á”) : (CategoryTheory.yoneda.map f).app xâ = TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g f - CategoryTheory.Functor.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.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.uliftCoyonedaEquiv_comp đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : Cá”á”} {F G : CategoryTheory.Functor C (Type (max w vâ))} (α : CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.obj X â¶ F) (ÎČ : F â¶ G) : CategoryTheory.uliftCoyonedaEquiv (CategoryTheory.CategoryStruct.comp α ÎČ) = (CategoryTheory.ConcreteCategory.hom (ÎČ.app (Opposite.unop X))) (CategoryTheory.uliftCoyonedaEquiv α) - 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.uliftCoyonedaEquiv_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.uliftCoyoneda.{w, vâ, uâ}.obj (Opposite.op X) â¶ F) (g : X â¶ Y) : (CategoryTheory.ConcreteCategory.hom (F.map g)) (CategoryTheory.uliftCoyonedaEquiv f) = CategoryTheory.uliftCoyonedaEquiv (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.map g.op) f) - CategoryTheory.uliftCoyonedaEquiv_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.uliftCoyonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.map f.op) (CategoryTheory.uliftCoyonedaEquiv.symm t) - CategoryTheory.coyonedaPairingExt đ Mathlib.CategoryTheory.Yoneda
(C : Type uâ) [CategoryTheory.Category.{vâ, uâ} C] {X : C Ă CategoryTheory.Functor C (Type vâ)} {x y : (CategoryTheory.coyonedaPairing C).obj X} (w : â (Y : C), x.app Y = y.app Y) : x = y - CategoryTheory.coyonedaPairingExt_iff đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X : C Ă CategoryTheory.Functor C (Type vâ)} {x y : (CategoryTheory.coyonedaPairing C).obj X} : x = y â â (Y : C), x.app Y = y.app Y - CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso_apply đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] (F : CategoryTheory.Functor Cá”á” (Type (max w vâ))) (X : C) (R : F.RepresentableBy X) : (CategoryTheory.Functor.RepresentableBy.equivUliftYonedaIso F X) R = CategoryTheory.NatIso.ofComponents (fun X_1 => equivEquivIso (Equiv.ulift.trans R.homEquiv)) ⯠- CategoryTheory.uliftCoyonedaEquiv_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.uliftCoyonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftCoyoneda.{w, vâ, uâ}.map f.op) (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftCoyonedaEquiv.symm t) h) - 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_comp đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {F G : CategoryTheory.Functor Cá”á” (Type (max w vâ))} {X : Cá”á”} (x : F.obj X) (f : F â¶ G) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm x) f = CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op (Opposite.unop X)))) x) - CategoryTheory.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.uliftYonedaEquiv_symm_comp_assoc đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {F G : CategoryTheory.Functor Cá”á” (Type (max w vâ))} {X : Cá”á”} (x : F.obj X) (f : F â¶ G) {Z : CategoryTheory.Functor Cá”á” (Type (max w vâ))} (h : G â¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm x) (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (f.app (Opposite.op (Opposite.unop X)))) x)) h - CategoryTheory.uliftYonedaEquiv_symm_map_assoc đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {X Y : Cá”á”} (f : X â¶ Y) {F : CategoryTheory.Functor Cá”á” (Type (max w vâ))} (t : F.obj X) {Z : CategoryTheory.Functor Cá”á” (Type (max w vâ))} (h : F â¶ Z) : CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm ((CategoryTheory.ConcreteCategory.hom (F.map f)) t)) h = CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYoneda.{w, vâ, uâ}.map f.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.uliftYonedaEquiv.symm t) h) - CategoryTheory.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.Functor.RepresentableBy.uniqueUpToIso_hom đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {F : CategoryTheory.Functor Cá”á” (Type v)} {Y Y' : C} (e : F.RepresentableBy Y) (e' : F.RepresentableBy Y') : (e.uniqueUpToIso e').hom = CategoryTheory.Yoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (âe'.homEquiv.symm â âe.homEquiv), inv := TypeCat.ofHom (âe.homEquiv.symm â âe'.homEquiv), hom_inv_id := âŻ, inv_hom_id := ⯠}) âŻ).hom - CategoryTheory.Functor.RepresentableBy.uniqueUpToIso_inv đ Mathlib.CategoryTheory.Yoneda
{C : Type uâ} [CategoryTheory.Category.{vâ, uâ} C] {F : CategoryTheory.Functor Cá”á” (Type v)} {Y Y' : C} (e : F.RepresentableBy Y) (e' : F.RepresentableBy Y') : (e.uniqueUpToIso e').inv = CategoryTheory.Yoneda.fullyFaithful.preimage (CategoryTheory.NatIso.ofComponents (fun Z => { hom := TypeCat.ofHom (âe'.homEquiv.symm â âe.homEquiv), inv := TypeCat.ofHom (âe.homEquiv.symm â âe'.homEquiv), hom_inv_id := âŻ, inv_hom_id := ⯠}) âŻ).inv - CategoryTheory.Adjunction.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.coconeLeftOpOfCone_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) : (CategoryTheory.Limits.coconeLeftOpOfCone c).pt = Opposite.unop c.pt - CategoryTheory.Limits.coneLeftOpOfCocone_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) : (CategoryTheory.Limits.coneLeftOpOfCocone c).pt = Opposite.unop c.pt - CategoryTheory.Limits.coconeOfConeRightOp_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.rightOp) : (CategoryTheory.Limits.coconeOfConeRightOp c).pt = Opposite.unop c.pt - CategoryTheory.Limits.coneOfCoconeRightOp_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.rightOp) : (CategoryTheory.Limits.coneOfCoconeRightOp c).pt = Opposite.unop 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.coconeUnopOfCone_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) : (CategoryTheory.Limits.coconeUnopOfCone c).pt = Opposite.unop c.pt - CategoryTheory.Limits.coneUnopOfCocone_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) : (CategoryTheory.Limits.coneUnopOfCocone c).pt = Opposite.unop c.pt - CategoryTheory.Limits.Cone.equiv đ 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 â (X : Cá”á”) Ă ((CategoryTheory.Functor.const J).obj (Opposite.unop X) â¶ F) - CategoryTheory.Functor.cones_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) (X : Cá”á”) : F.cones.obj X = ((CategoryTheory.Functor.const J).obj (Opposite.unop X) â¶ F) - CategoryTheory.cones_obj_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) (X : Cá”á”) : ((CategoryTheory.cones J C).obj F).obj X = ((CategoryTheory.Functor.const J).obj (Opposite.unop X) â¶ F) - CategoryTheory.cocones_obj_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)á”á”) (X : C) : ((CategoryTheory.cocones J C).obj F).obj X = (Opposite.unop F â¶ (CategoryTheory.Functor.const J).obj X) - 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.Ï
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
đReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
đ"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
đ_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
đReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
đ(?a -> ?b) -> List ?a -> List ?b
đList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
đ|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allâandâ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
đ|- _ < _ â tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
âą (_ : Type _)finds all definitions which provide data whileâą (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
đ Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ â _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision ce5dd8c