Loogle!
Result
Found 89 declarations mentioning CategoryTheory.Equivalence.symm.
- CategoryTheory.Equivalence.symm π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : D β C - CategoryTheory.Equivalence.symm_functor π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.functor = e.inverse - CategoryTheory.Equivalence.symm_inverse π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.inverse = e.functor - CategoryTheory.Equivalence.pow_neg_one π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (e : C β C) : e ^ (-1) = e.symm - CategoryTheory.Equivalence.symm_counit π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.counit = e.unitInv - CategoryTheory.Equivalence.symm_unit π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.unit = e.counitInv - CategoryTheory.Equivalence.symm_counitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.counitIso = e.unitIso.symm - CategoryTheory.Equivalence.symm_unitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.symm.unitIso = e.counitIso.symm - CategoryTheory.Equivalence.mkHom_id_inverse π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {e : C β D} : CategoryTheory.Equivalence.mkHom (CategoryTheory.CategoryStruct.id e.inverse) = CategoryTheory.CategoryStruct.id e.symm - CategoryTheory.Iso.isoFunctorOfIsoInverse_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {G G' : C β D} (i : G.inverse β G'.inverse) (X : C) : i.isoFunctorOfIsoInverse.hom.app X = CategoryTheory.CategoryStruct.comp (G'.counitIso.inv.app (G.functor.obj X)) (CategoryTheory.CategoryStruct.comp (G'.functor.map (i.inv.app (G.functor.obj X))) (G'.functor.map (G.unitIso.inv.app X))) - CategoryTheory.Iso.isoFunctorOfIsoInverse_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {G G' : C β D} (i : G.inverse β G'.inverse) (X : C) : i.isoFunctorOfIsoInverse.inv.app X = CategoryTheory.CategoryStruct.comp (G'.functor.map (G.unitIso.hom.app X)) (CategoryTheory.CategoryStruct.comp (G'.functor.map (i.hom.app (G.functor.obj X))) (G'.counitIso.hom.app (G.functor.obj X))) - CategoryTheory.Equivalence.rightOp_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.rightOp.functor.map f = (e.functor.map f.op).op - 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.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.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.Limits.IsColimit.coconePointsIsoOfEquivalence_inv π Mathlib.CategoryTheory.Limits.IsLimit
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {K : Type uβ} [CategoryTheory.Category.{vβ, uβ} K] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J C} {s : CategoryTheory.Limits.Cocone F} {G : CategoryTheory.Functor K C} {t : CategoryTheory.Limits.Cocone G} (P : CategoryTheory.Limits.IsColimit s) (Q : CategoryTheory.Limits.IsColimit t) (e : J β K) (w : e.functor.comp G β F) : (P.coconePointsIsoOfEquivalence Q e w).inv = Q.desc ((CategoryTheory.Limits.Cocone.equivalenceOfReindexing e.symm ((e.inverse.isoWhiskerLeft w).symm βͺβ« e.invFunIdAssoc G)).functor.obj s) - CategoryTheory.Limits.IsLimit.conePointsIsoOfEquivalence_hom π Mathlib.CategoryTheory.Limits.IsLimit
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {K : Type uβ} [CategoryTheory.Category.{vβ, uβ} K] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J C} {s : CategoryTheory.Limits.Cone F} {G : CategoryTheory.Functor K C} {t : CategoryTheory.Limits.Cone G} (P : CategoryTheory.Limits.IsLimit s) (Q : CategoryTheory.Limits.IsLimit t) (e : J β K) (w : e.functor.comp G β F) : (P.conePointsIsoOfEquivalence Q e w).hom = Q.lift ((CategoryTheory.Limits.Cone.equivalenceOfReindexing e.symm ((e.inverse.isoWhiskerLeft w).symm βͺβ« e.invFunIdAssoc G)).functor.obj s) - CategoryTheory.Equivalence.instMonoidalFunctorSymmOfInverse π Mathlib.CategoryTheory.Monoidal.Functor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.MonoidalCategory D] (e : C β D) [e.inverse.Monoidal] : e.symm.functor.Monoidal - CategoryTheory.Equivalence.instMonoidalInverseSymmOfFunctor π Mathlib.CategoryTheory.Monoidal.Functor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.MonoidalCategory D] (e : C β D) [e.functor.Monoidal] : e.symm.inverse.Monoidal - CategoryTheory.Equivalence.isMonoidal_symm π Mathlib.CategoryTheory.Monoidal.Functor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.MonoidalCategory D] (e : C β D) [e.functor.Monoidal] [e.inverse.Monoidal] [e.IsMonoidal] : e.symm.IsMonoidal - CategoryTheory.Monoidal.instIsMonoidalTransportedSymmEquivalenceTransported π Mathlib.CategoryTheory.Monoidal.Transport
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.Monoidal.equivalenceTransported e).symm.IsMonoidal - CategoryTheory.Monoidal.instMonoidalTransportedFunctorSymmEquivalenceTransported π Mathlib.CategoryTheory.Monoidal.Transport
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.Monoidal.equivalenceTransported e).symm.functor.Monoidal - CategoryTheory.Monoidal.instMonoidalTransportedInverseSymmEquivalenceTransported π Mathlib.CategoryTheory.Monoidal.Transport
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.Monoidal.equivalenceTransported e).symm.inverse.Monoidal - Bipointed.swapEquiv_symm π Mathlib.CategoryTheory.Category.Bipointed
: Bipointed.swapEquiv.symm = Bipointed.swapEquiv - CategoryTheory.Comon.monoidal_whiskerLeft_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X xβ xβΒΉ : CategoryTheory.Comon C) (f : xβ βΆ xβΒΉ) : (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X f).hom = CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.X f.hom - CategoryTheory.Comon.monoidal_whiskerRight_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] {Xββ Xββ : CategoryTheory.Comon C} (f : Xββ βΆ Xββ) (X : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.whiskerRight f X).hom = CategoryTheory.MonoidalCategoryStruct.whiskerRight f.hom X.X - CategoryTheory.Comon.monoidal_tensorHom_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] {Xββ Yββ Xββ Yββ : CategoryTheory.Comon C} (f : Xββ βΆ Yββ) (g : Xββ βΆ Yββ) : (CategoryTheory.MonoidalCategoryStruct.tensorHom f g).hom = CategoryTheory.MonoidalCategoryStruct.tensorHom f.hom g.hom - CategoryTheory.Comon.monoidal_tensorObj_comon_comul π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X Y : CategoryTheory.Comon C) : CategoryTheory.ComonObj.comul = CategoryTheory.MonObj.mul.unop - CategoryTheory.Comon.monoidal_leftUnitor_hom_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).hom.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorUnit (CategoryTheory.Mon Cα΅α΅))).ComonToMonOpOpObj)).unop.hom.unop X.X) (CategoryTheory.MonoidalCategoryStruct.leftUnitor X.X).hom - CategoryTheory.Comon.monoidal_leftUnitor_inv_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).inv.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor X.X).inv (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorUnit (CategoryTheory.Mon Cα΅α΅))).ComonToMonOpOpObj)).unop.hom.unop X.X) - CategoryTheory.Comon.monoidal_rightUnitor_hom_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).hom.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.X (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorUnit (CategoryTheory.Mon Cα΅α΅))).ComonToMonOpOpObj)).unop.hom.unop) (CategoryTheory.MonoidalCategoryStruct.rightUnitor X.X).hom - CategoryTheory.Comon.monoidal_rightUnitor_inv_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).inv.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.rightUnitor X.X).inv (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.X (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorUnit (CategoryTheory.Mon Cα΅α΅))).ComonToMonOpOpObj)).unop.hom.unop) - CategoryTheory.Comon.monoidal_associator_hom_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X Y Z : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).hom.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorObj X.ComonToMonOpOpObj Y.ComonToMonOpOpObj)).ComonToMonOpOpObj)).unop.hom.unop Z.X) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator X.X Y.X Z.X).hom (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.X (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorObj Y.ComonToMonOpOpObj Z.ComonToMonOpOpObj)).ComonToMonOpOpObj)).unop.hom.unop)) - CategoryTheory.Comon.monoidal_associator_inv_hom π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] [CategoryTheory.BraidedCategory C] (X Y Z : CategoryTheory.Comon C) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).inv.hom = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.X (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorObj Y.ComonToMonOpOpObj Z.ComonToMonOpOpObj)).ComonToMonOpOpObj)).unop.hom.unop) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator X.X Y.X Z.X).inv (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.CategoryStruct.id (Opposite.op (CategoryTheory.Comon.MonOpOpToComonObj (CategoryTheory.MonoidalCategoryStruct.tensorObj X.ComonToMonOpOpObj Y.ComonToMonOpOpObj)).ComonToMonOpOpObj)).unop.hom.unop Z.X)) - CategoryTheory.WithInitial.isColimitEquiv_apply_desc_right π Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} {K : CategoryTheory.Functor J (CategoryTheory.Under X)} {t : CategoryTheory.Limits.Cocone K} (P : CategoryTheory.Limits.IsColimit (CategoryTheory.WithInitial.coconeEquiv.functor.obj t)) (s : CategoryTheory.Limits.Cocone K) : ((CategoryTheory.WithInitial.isColimitEquiv P).desc s).right = ((CategoryTheory.Limits.IsColimit.ofLeftAdjoint CategoryTheory.WithInitial.coconeEquiv.symm.toAdjunction P).desc s).right - CategoryTheory.WithTerminal.isLimitEquiv_symm_apply_lift π Mathlib.CategoryTheory.WithTerminal.Cone
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {J : Type w} [CategoryTheory.Category.{w', w} J] {X : C} {K : CategoryTheory.Functor J (CategoryTheory.Over X)} {t : CategoryTheory.Limits.Cone K} (tβ : CategoryTheory.Limits.IsLimit t) (s : CategoryTheory.Limits.Cone (CategoryTheory.WithTerminal.liftFromOver.obj K)) : (CategoryTheory.WithTerminal.isLimitEquiv.symm tβ).lift s = ((CategoryTheory.WithTerminal.coneEquiv.symm.toAdjunction.homEquiv s t) (tβ.liftConeMorphism (CategoryTheory.WithTerminal.coneEquiv.inverse.obj s))).hom - CategoryTheory.MonoidalClosed.ofEquiv_curry_def π Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.MonoidalCategory D] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D C} (adj : F β£ G) [F.Monoidal] [F.IsEquivalence] [CategoryTheory.MonoidalClosed D] {X Y Z : C} (f : CategoryTheory.MonoidalCategoryStruct.tensorObj X Y βΆ Z) : CategoryTheory.MonoidalClosed.curry f = (adj.homEquiv Y (F.obj X βΉ F.obj Z)) (CategoryTheory.MonoidalClosed.curry ((adj.toEquivalence.symm.toAdjunction.homEquiv (CategoryTheory.MonoidalCategoryStruct.tensorObj (F.obj X) (F.obj Y)) Z) (CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.Monoidal.commTensorLeft F X).compInverseIso.hom.app Y) f))) - CategoryTheory.MonoidalClosed.ofEquiv_uncurry_def π Mathlib.CategoryTheory.Monoidal.Closed.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.MonoidalCategory C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.MonoidalCategory D] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D C} (adj : F β£ G) [F.Monoidal] [F.IsEquivalence] [CategoryTheory.MonoidalClosed D] {X Y Z : C} (f : Y βΆ X βΉ Z) : CategoryTheory.MonoidalClosed.uncurry f = CategoryTheory.CategoryStruct.comp ((CategoryTheory.Functor.Monoidal.commTensorLeft F X).compInverseIso.inv.app Y) ((adj.toEquivalence.symm.toAdjunction.homEquiv ((F.comp (CategoryTheory.MonoidalCategory.tensorLeft (F.obj X))).obj Y) Z).symm (CategoryTheory.MonoidalClosed.uncurry ((adj.homEquiv Y (F.obj X βΉ adj.toEquivalence.symm.inverse.obj Z)).symm f))) - CategoryTheory.ComposableArrows.opEquivalence_functor_obj_map π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) (X : (CategoryTheory.Functor (Fin (n + 1)) C)α΅α΅) {Xβ Yβ : Fin (n + 1)} (f : Xβ βΆ Yβ) : ((CategoryTheory.ComposableArrows.opEquivalence C n).functor.obj X).map f = ((Opposite.unop X).map (β―.functor.map (CategoryTheory.homOfLE β―))).op - CategoryTheory.ComposableArrows.opEquivalence_inverse_map π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) {Xβ Yβ : CategoryTheory.ComposableArrows Cα΅α΅ n} (f : Xβ βΆ Yβ) : (CategoryTheory.ComposableArrows.opEquivalence C n).inverse.map f = ((β―.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (CategoryTheory.NatTrans.leftOp f)).op - CategoryTheory.ComposableArrows.opEquivalence_functor_map_app π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) {Xβ Yβ : (CategoryTheory.Functor (Fin (n + 1)) C)α΅α΅} (f : Xβ βΆ Yβ) (xβ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).functor.map f).app xβ = (f.unop.app xβ.rev).op - CategoryTheory.ComposableArrows.opEquivalence_counitIso_inv_app_app π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) (X : CategoryTheory.ComposableArrows Cα΅α΅ n) (Xβ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).counitIso.inv.app X).app Xβ = X.map (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).unitInv.app (Opposite.op Xβ)).unop - CategoryTheory.ComposableArrows.opEquivalence_counitIso_hom_app_app π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) (X : CategoryTheory.ComposableArrows Cα΅α΅ n) (Xβ : Fin (n + 1)) : ((CategoryTheory.ComposableArrows.opEquivalence C n).counitIso.hom.app X).app Xβ = X.map (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.counitInv.app (Opposite.op Xβ)).unop - CategoryTheory.ComposableArrows.opEquivalence_unitIso_hom_app π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) (X : (CategoryTheory.Functor (Fin (n + 1)) C)α΅α΅) : (CategoryTheory.ComposableArrows.opEquivalence C n).unitIso.hom.app X = CategoryTheory.CategoryStruct.comp (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.funInvIdAssoc (Opposite.unop X)).hom.op ((β―.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).inverse.comp β―.functor).comp (Opposite.unop X)).rightOpLeftOpIso.hom.op.unop).op - CategoryTheory.ComposableArrows.opEquivalence_unitIso_inv_app π Mathlib.CategoryTheory.ComposableArrows.Basic
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (n : β) (X : (CategoryTheory.Functor (Fin (n + 1)) C)α΅α΅) : (CategoryTheory.ComposableArrows.opEquivalence C n).unitIso.inv.app X = CategoryTheory.CategoryStruct.comp ((β―.functor.comp (CategoryTheory.orderDualEquivalence (Fin (n + 1))).functor).whiskerLeft (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).inverse.comp β―.functor).comp (Opposite.unop X)).rightOpLeftOpIso.inv.op.unop).op (((CategoryTheory.orderDualEquivalence (Fin (n + 1))).symm.trans Fin.revOrderIso.equivalence).symm.funInvIdAssoc (Opposite.unop X)).inv.op - CategoryTheory.Localization.uniq_symm π Mathlib.CategoryTheory.Localization.Predicate
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] {Dβ : Type u_4} {Dβ : Type u_5} [CategoryTheory.Category.{v_4, u_4} Dβ] [CategoryTheory.Category.{v_5, u_5} Dβ] (Lβ : CategoryTheory.Functor C Dβ) (Lβ : CategoryTheory.Functor C Dβ) (W' : CategoryTheory.MorphismProperty C) [Lβ.IsLocalization W'] [Lβ.IsLocalization W'] : (CategoryTheory.Localization.uniq Lβ Lβ W').symm = CategoryTheory.Localization.uniq Lβ Lβ W' - CategoryTheory.CatCommSq.hInv_hInv π Mathlib.CategoryTheory.CatCommSq
{Cβ : Type u_1} {Cβ : Type u_2} {Cβ : Type u_3} {Cβ : Type u_4} [CategoryTheory.Category.{v_1, u_1} Cβ] [CategoryTheory.Category.{v_2, u_2} Cβ] [CategoryTheory.Category.{v_3, u_3} Cβ] [CategoryTheory.Category.{v_4, u_4} Cβ] (T : Cβ β Cβ) (L : CategoryTheory.Functor Cβ Cβ) (R : CategoryTheory.Functor Cβ Cβ) (B : Cβ β Cβ) (h : CategoryTheory.CatCommSq T.functor L R B.functor) : CategoryTheory.CatCommSq.hInv T.symm R L B.symm (CategoryTheory.CatCommSq.hInv T L R B h) = h - CategoryTheory.CatCommSq.vInv_vInv π Mathlib.CategoryTheory.CatCommSq
{Cβ : Type u_1} {Cβ : Type u_2} {Cβ : Type u_3} {Cβ : Type u_4} [CategoryTheory.Category.{v_1, u_1} Cβ] [CategoryTheory.Category.{v_2, u_2} Cβ] [CategoryTheory.Category.{v_3, u_3} Cβ] [CategoryTheory.Category.{v_4, u_4} Cβ] (T : CategoryTheory.Functor Cβ Cβ) (L : Cβ β Cβ) (R : Cβ β Cβ) (B : CategoryTheory.Functor Cβ Cβ) (h : CategoryTheory.CatCommSq T L.functor R.functor B) : CategoryTheory.CatCommSq.vInv B L.symm R.symm T (CategoryTheory.CatCommSq.vInv T L R B h) = h - CategoryTheory.Equivalence.CommShift.instCommShiftFunctorSymm π Mathlib.CategoryTheory.Shift.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (E : C β D) (A : Type u_3) [AddMonoid A] [CategoryTheory.HasShift C A] [CategoryTheory.HasShift D A] [E.inverse.CommShift A] : E.symm.functor.CommShift A - CategoryTheory.Equivalence.CommShift.instCommShiftInverseSymm π Mathlib.CategoryTheory.Shift.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (E : C β D) (A : Type u_3) [AddMonoid A] [CategoryTheory.HasShift C A] [CategoryTheory.HasShift D A] [E.functor.CommShift A] : E.symm.inverse.CommShift A - CategoryTheory.Equivalence.CommShift.instSymm π Mathlib.CategoryTheory.Shift.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] (E : C β D) (A : Type u_3) [AddMonoid A] [CategoryTheory.HasShift C A] [CategoryTheory.HasShift D A] [E.functor.CommShift A] [E.inverse.CommShift A] [E.CommShift A] : E.symm.CommShift A - CategoryTheory.prod.prodΞΌ_functor_map π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] {Xβ Yβ : (A Γ C) Γ D Γ E} (f : Xβ βΆ Yβ) : (CategoryTheory.prod.prodΞΌ C D E A).functor.map f = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom f.1.1 f.2.1) (CategoryTheory.Prod.mkHom f.1.2 f.2.2) - CategoryTheory.prod.prodΞΌ_inverse_map π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] {Xβ Yβ : (A Γ D) Γ C Γ E} (f : Xβ βΆ Yβ) : (CategoryTheory.prod.prodΞΌ C D E A).inverse.map f = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom f.1.1 f.2.1) (CategoryTheory.Prod.mkHom f.1.2 f.2.2) - CategoryTheory.prod.prodΞΌ_counitIso_hom_app π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] (X : (A Γ D) Γ C Γ E) : (CategoryTheory.prod.prodΞΌ C D E A).counitIso.hom.app X = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1.1) (CategoryTheory.CategoryStruct.id X.1.2)) (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.2.1) (CategoryTheory.CategoryStruct.id X.2.2)) - CategoryTheory.prod.prodΞΌ_counitIso_inv_app π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] (X : (A Γ D) Γ C Γ E) : (CategoryTheory.prod.prodΞΌ C D E A).counitIso.inv.app X = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1.1) (CategoryTheory.CategoryStruct.id X.1.2)) (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.2.1) (CategoryTheory.CategoryStruct.id X.2.2)) - CategoryTheory.prod.prodΞΌ_unitIso_hom_app π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] (X : (A Γ C) Γ D Γ E) : (CategoryTheory.prod.prodΞΌ C D E A).unitIso.hom.app X = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1.1) (CategoryTheory.CategoryStruct.id X.1.2)) (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.2.1) (CategoryTheory.CategoryStruct.id X.2.2)) - CategoryTheory.prod.prodΞΌ_unitIso_inv_app π Mathlib.CategoryTheory.Products.Associator
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (E : Type uβ) [CategoryTheory.Category.{vβ, uβ} E] (A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] (X : (A Γ C) Γ D Γ E) : (CategoryTheory.prod.prodΞΌ C D E A).unitIso.inv.app X = CategoryTheory.Prod.mkHom (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1.1) (CategoryTheory.CategoryStruct.id X.1.2)) (CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.2.1) (CategoryTheory.CategoryStruct.id X.2.2)) - CategoryTheory.Adjunction.leftOp_eq π Mathlib.CategoryTheory.Adjunction.Opposites
{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α΅α΅} (a : F β£ G.leftOp) : a.leftOp = (CategoryTheory.opOpEquivalence D).symm.toAdjunction.comp a.op - CategoryTheory.Adjunction.rightOp_eq π Mathlib.CategoryTheory.Adjunction.Opposites
{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} (a : F.rightOp β£ G) : a.rightOp = (CategoryTheory.opOpEquivalence D).symm.toAdjunction.comp a.op - TopCat.Presheaf.presheafEquivOfIso_functor_obj_map π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (G : CategoryTheory.Functor (TopologicalSpace.Opens βX)α΅α΅ C) {Xβ Yβ : (TopologicalSpace.Opens βY)α΅α΅} (f : Xβ βΆ Yβ) : ((TopCat.Presheaf.presheafEquivOfIso C H).functor.obj G).map f = G.map ((TopologicalSpace.Opens.map H.hom).map f.unop).op - TopCat.Presheaf.presheafEquivOfIso_inverse_obj_map π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (G : CategoryTheory.Functor (TopologicalSpace.Opens βY)α΅α΅ C) {Xβ Yβ : (TopologicalSpace.Opens βX)α΅α΅} (f : Xβ βΆ Yβ) : ((TopCat.Presheaf.presheafEquivOfIso C H).inverse.obj G).map f = G.map ((TopologicalSpace.Opens.map H.inv).map f.unop).op - TopCat.Presheaf.presheafEquivOfIso_functor_map_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) {Xβ Yβ : CategoryTheory.Functor (TopologicalSpace.Opens βX)α΅α΅ C} (Ξ± : Xβ βΆ Yβ) (XβΒΉ : (TopologicalSpace.Opens βY)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).functor.map Ξ±).app XβΒΉ = Ξ±.app (Opposite.op ((TopologicalSpace.Opens.map H.hom).obj (Opposite.unop XβΒΉ))) - TopCat.Presheaf.presheafEquivOfIso_inverse_map_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) {Xβ Yβ : CategoryTheory.Functor (TopologicalSpace.Opens βY)α΅α΅ C} (Ξ± : Xβ βΆ Yβ) (XβΒΉ : (TopologicalSpace.Opens βX)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).inverse.map Ξ±).app XβΒΉ = Ξ±.app (Opposite.op ((TopologicalSpace.Opens.map H.inv).obj (Opposite.unop XβΒΉ))) - TopCat.Presheaf.presheafEquivOfIso_counitIso_hom_app_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (Xβ : CategoryTheory.Functor (TopologicalSpace.Opens βY)α΅α΅ C) (XβΒΉ : (TopologicalSpace.Opens βY)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).counitIso.hom.app Xβ).app XβΒΉ = Xβ.map (CategoryTheory.eqToHom β―) - TopCat.Presheaf.presheafEquivOfIso_unitIso_hom_app_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (Xβ : CategoryTheory.Functor (TopologicalSpace.Opens βX)α΅α΅ C) (XβΒΉ : (TopologicalSpace.Opens βX)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).unitIso.hom.app Xβ).app XβΒΉ = Xβ.map (CategoryTheory.eqToHom β―) - TopCat.Presheaf.presheafEquivOfIso_counitIso_inv_app_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (Xβ : CategoryTheory.Functor (TopologicalSpace.Opens βY)α΅α΅ C) (XβΒΉ : (TopologicalSpace.Opens βY)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).counitIso.inv.app Xβ).app XβΒΉ = Xβ.map (CategoryTheory.eqToHom β―) - TopCat.Presheaf.presheafEquivOfIso_unitIso_inv_app_app π Mathlib.Topology.Sheaves.Presheaf
(C : Type u) [CategoryTheory.Category.{v, u} C] {X Y : TopCat} (H : X β Y) (Xβ : CategoryTheory.Functor (TopologicalSpace.Opens βX)α΅α΅ C) (XβΒΉ : (TopologicalSpace.Opens βX)α΅α΅) : ((TopCat.Presheaf.presheafEquivOfIso C H).unitIso.inv.app Xβ).app XβΒΉ = Xβ.map (CategoryTheory.eqToHom β―) - TopologicalSpace.Opens.instIsDenseSubsiteOverSubtypeMemOverGrothendieckTopologyInverseSymmOverEquivalence π Mathlib.Topology.Sheaves.Over
{X : Type u} [TopologicalSpace X] (U : TopologicalSpace.Opens X) : CategoryTheory.Functor.IsDenseSubsite ((Opens.grothendieckTopology X).over U) (Opens.grothendieckTopology β₯U) U.overEquivalence.symm.inverse - Action.whiskerLeft_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X : Action V G) {Yβ Yβ : Action V G} (f : Yβ βΆ Yβ) : (CategoryTheory.MonoidalCategoryStruct.whiskerLeft X f).hom = CategoryTheory.MonoidalCategoryStruct.whiskerLeft X.V f.hom - Action.whiskerRight_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] {Xβ Xβ : Action V G} (f : Xβ βΆ Xβ) (Y : Action V G) : (CategoryTheory.MonoidalCategoryStruct.whiskerRight f Y).hom = CategoryTheory.MonoidalCategoryStruct.whiskerRight f.hom Y.V - Action.tensorHom_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] {Xβ Yβ Xβ Yβ : Action V G} (f : Xβ βΆ Yβ) (g : Xβ βΆ Yβ) : (CategoryTheory.MonoidalCategoryStruct.tensorHom f g).hom = CategoryTheory.MonoidalCategoryStruct.tensorHom f.hom g.hom - Action.leftUnitor_hom_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X : Action V G) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).hom.hom = (CategoryTheory.MonoidalCategoryStruct.leftUnitor X.V).hom - Action.leftUnitor_inv_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X : Action V G) : (CategoryTheory.MonoidalCategoryStruct.leftUnitor X).inv.hom = (CategoryTheory.MonoidalCategoryStruct.leftUnitor X.V).inv - Action.rightUnitor_hom_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X : Action V G) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).hom.hom = (CategoryTheory.MonoidalCategoryStruct.rightUnitor X.V).hom - Action.rightUnitor_inv_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X : Action V G) : (CategoryTheory.MonoidalCategoryStruct.rightUnitor X).inv.hom = (CategoryTheory.MonoidalCategoryStruct.rightUnitor X.V).inv - Action.associator_hom_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X Y Z : Action V G) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).hom.hom = (CategoryTheory.MonoidalCategoryStruct.associator X.V Y.V Z.V).hom - Action.associator_inv_hom π Mathlib.CategoryTheory.Action.Monoidal
{V : Type u_1} [CategoryTheory.Category.{v_1, u_1} V] {G : Type u_2} [Monoid G] [CategoryTheory.MonoidalCategory V] (X Y Z : Action V G) : (CategoryTheory.MonoidalCategoryStruct.associator X Y Z).inv.hom = (CategoryTheory.MonoidalCategoryStruct.associator X.V Y.V Z.V).inv - TwoP.swapEquiv_symm π Mathlib.CategoryTheory.Category.TwoP
: TwoP.swapEquiv.symm = TwoP.swapEquiv - CategoryTheory.Equivalence.symmEquivFunctor_obj π Mathlib.CategoryTheory.Equivalence.Symmetry
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (D : Type u_2) [CategoryTheory.Category.{v_2, u_2} D] (e : C β D) : (CategoryTheory.Equivalence.symmEquivFunctor C D).obj e = Opposite.op e.symm - CategoryTheory.Equivalence.symmEquiv_counitIso π Mathlib.CategoryTheory.Equivalence.Symmetry
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (D : Type u_2) [CategoryTheory.Category.{v_2, u_2} D] : (CategoryTheory.Equivalence.symmEquiv C D).counitIso = CategoryTheory.NatIso.ofComponents (fun e => (CategoryTheory.Iso.refl (Opposite.unop e)).op) β― - CategoryTheory.Equivalence.symmEquivFunctor_map π Mathlib.CategoryTheory.Equivalence.Symmetry
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (D : Type u_2) [CategoryTheory.Category.{v_2, u_2} D] {e f : C β D} (Ξ± : e βΆ f) : (CategoryTheory.Equivalence.symmEquivFunctor C D).map Ξ± = (CategoryTheory.Equivalence.mkHom ((CategoryTheory.conjugateEquiv f.toAdjunction e.toAdjunction) (CategoryTheory.Equivalence.asNatTrans Ξ±))).op - CategoryTheory.Equivalence.symmEquivInverse_map_app π Mathlib.CategoryTheory.Equivalence.Symmetry
(C : Type u_1) [CategoryTheory.Category.{v_1, u_1} C] (D : Type u_2) [CategoryTheory.Category.{v_2, u_2} D] {Xβ Yβ : (D β C)α΅α΅} (f : Xβ βΆ Yβ) (X : C) : ((CategoryTheory.Equivalence.symmEquivInverse C D).map f).app X = CategoryTheory.CategoryStruct.comp ((Opposite.unop Xβ).inverse.map ((Opposite.unop Yβ).counitInv.app X)) (CategoryTheory.CategoryStruct.comp ((Opposite.unop Xβ).inverse.map ((CategoryTheory.Equivalence.asNatTrans f.unop).app ((Opposite.unop Yβ).inverse.obj X))) ((Opposite.unop Xβ).unitInv.app ((Opposite.unop Yβ).inverse.obj X))) - CategoryTheory.toOverIteratedSliceForwardIsoPullback_hom_app_left π Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.ChosenPullbacks C] {X Y : C} (f : Y βΆ X) (Xβ : CategoryTheory.Over X) : ((CategoryTheory.toOverIteratedSliceForwardIsoPullback f).hom.app Xβ).left = (CategoryTheory.CategoryStruct.comp (((((((CategoryTheory.Over.map f).leftUnitor.symm.homCongr ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))).rightUnitor.symm).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.Functor.id (CategoryTheory.Over Y)) ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))) (CategoryTheory.Over.map f) (CategoryTheory.Functor.id (CategoryTheory.Over X))).symm).trans (CategoryTheory.mateEquiv ((CategoryTheory.Over.mk f).iteratedSliceEquiv.symm.toAdjunction.comp (CategoryTheory.forgetAdjToOver (CategoryTheory.Over.mk f))) (CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f))).trans (CategoryTheory.TwoSquare.equivNatTrans ((CategoryTheory.toOver (CategoryTheory.Over.mk f)).comp (CategoryTheory.Over.mk f).iteratedSliceForward) (CategoryTheory.Functor.id (CategoryTheory.Over X)) (CategoryTheory.Functor.id (CategoryTheory.Over Y)) (CategoryTheory.ChosenPullbacksAlong.pullback f))) (CategoryTheory.eqToIso β―).hom).app Xβ) (CategoryTheory.CategoryStruct.id ((CategoryTheory.ChosenPullbacksAlong.pullback f).obj Xβ))).left - CategoryTheory.toOverIteratedSliceForwardIsoPullback_inv_app_left π Mathlib.CategoryTheory.LocallyCartesianClosed.Over
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.ChosenPullbacks C] {X Y : C} (f : Y βΆ X) (Xβ : CategoryTheory.Over X) : ((CategoryTheory.toOverIteratedSliceForwardIsoPullback f).inv.app Xβ).left = (CategoryTheory.CategoryStruct.comp ((((((((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))).leftUnitor.symm.homCongr (CategoryTheory.Over.map f).rightUnitor.symm).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.Functor.id (CategoryTheory.Over Y)) (CategoryTheory.Over.map f) ((CategoryTheory.Over.mk f).iteratedSliceBackward.comp (CategoryTheory.Over.forget (CategoryTheory.Over.mk f))) (CategoryTheory.Functor.id (CategoryTheory.Over X))).symm).trans (CategoryTheory.mateEquiv (CategoryTheory.ChosenPullbacksAlong.mapPullbackAdj f) ((CategoryTheory.Over.mk f).iteratedSliceEquiv.symm.toAdjunction.comp (CategoryTheory.forgetAdjToOver (CategoryTheory.Over.mk f))))).trans (CategoryTheory.TwoSquare.equivNatTrans (CategoryTheory.ChosenPullbacksAlong.pullback f) (CategoryTheory.Functor.id (CategoryTheory.Over X)) (CategoryTheory.Functor.id (CategoryTheory.Over Y)) ((CategoryTheory.toOver (CategoryTheory.Over.mk f)).comp (CategoryTheory.Over.mk f).iteratedSliceForward))) (CategoryTheory.eqToIso β―).inv).app Xβ) (CategoryTheory.CategoryStruct.id (CategoryTheory.Over.mk (CategoryTheory.Over.Hom.left (CategoryTheory.SemiCartesianMonoidalCategory.snd Xβ (CategoryTheory.Over.mk f)))))).left - CategoryTheory.Equivalence.IsTriangulated.instIsTriangulatedFunctorSymmOfInverse π Mathlib.CategoryTheory.Triangulated.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] [CategoryTheory.HasShift C β€] [CategoryTheory.HasShift D β€] [β (n : β€), (CategoryTheory.shiftFunctor C n).Additive] [β (n : β€), (CategoryTheory.shiftFunctor D n).Additive] [CategoryTheory.Pretriangulated C] [CategoryTheory.Pretriangulated D] (E : C β D) [E.inverse.CommShift β€] [h : E.inverse.IsTriangulated] : E.symm.functor.IsTriangulated - CategoryTheory.Equivalence.IsTriangulated.instIsTriangulatedInverseSymmOfFunctor π Mathlib.CategoryTheory.Triangulated.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] [CategoryTheory.HasShift C β€] [CategoryTheory.HasShift D β€] [β (n : β€), (CategoryTheory.shiftFunctor C n).Additive] [β (n : β€), (CategoryTheory.shiftFunctor D n).Additive] [CategoryTheory.Pretriangulated C] [CategoryTheory.Pretriangulated D] (E : C β D) [E.functor.CommShift β€] [h : E.functor.IsTriangulated] : E.symm.inverse.IsTriangulated - CategoryTheory.Equivalence.IsTriangulated.symm π Mathlib.CategoryTheory.Triangulated.Adjunction
{C : Type u_1} {D : Type u_2} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Category.{v_2, u_2} D] [CategoryTheory.Limits.HasZeroObject C] [CategoryTheory.Limits.HasZeroObject D] [CategoryTheory.Preadditive C] [CategoryTheory.Preadditive D] [CategoryTheory.HasShift C β€] [CategoryTheory.HasShift D β€] [β (n : β€), (CategoryTheory.shiftFunctor C n).Additive] [β (n : β€), (CategoryTheory.shiftFunctor D n).Additive] [CategoryTheory.Pretriangulated C] [CategoryTheory.Pretriangulated D] (E : C β D) [E.functor.CommShift β€] [E.inverse.CommShift β€] [E.CommShift β€] [E.IsTriangulated] : E.symm.IsTriangulated
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