Loogle!
Result
Found 146 declarations mentioning CategoryTheory.NatIso.ofComponents.
- CategoryTheory.NatIso.ofComponents π Mathlib.CategoryTheory.NatIso
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F G : CategoryTheory.Functor C D} (app : (X : C) β F.obj X β G.obj X) (naturality : β {X Y : C} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.map f) := by cat_disch) : F β G - CategoryTheory.NatIso.ofComponents.app π Mathlib.CategoryTheory.NatIso
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F G : CategoryTheory.Functor C D} (app' : (X : C) β F.obj X β G.obj X) (naturality : β {X Y : C} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f) (app' Y).hom = CategoryTheory.CategoryStruct.comp (app' X).hom (G.map f)) (X : C) : (CategoryTheory.NatIso.ofComponents app' naturality).app X = app' X - CategoryTheory.NatIso.ofComponents_hom_app π Mathlib.CategoryTheory.NatIso
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F G : CategoryTheory.Functor C D} (app : (X : C) β F.obj X β G.obj X) (naturality : β {X Y : C} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.map f) := by cat_disch) (X : C) : (CategoryTheory.NatIso.ofComponents app naturality).hom.app X = (app X).hom - CategoryTheory.NatIso.ofComponents_inv_app π Mathlib.CategoryTheory.NatIso
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F G : CategoryTheory.Functor C D} (app : (X : C) β F.obj X β G.obj X) (naturality : β {X Y : C} (f : X βΆ Y), CategoryTheory.CategoryStruct.comp (F.map f) (app Y).hom = CategoryTheory.CategoryStruct.comp (app X).hom (G.map f) := by cat_disch) (X : C) : (CategoryTheory.NatIso.ofComponents app naturality).inv.app X = (app X).inv - 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.Functor.opUnopEquiv_counitIso π Mathlib.CategoryTheory.Opposites
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] : (CategoryTheory.Functor.opUnopEquiv C D).counitIso = CategoryTheory.NatIso.ofComponents (fun F => F.unopOpIso) β― - CategoryTheory.Equivalence.induced_counitIso π Mathlib.CategoryTheory.EqToHom
{D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : Type u_2} (e : T β D) : (CategoryTheory.Equivalence.induced e).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - CategoryTheory.Equivalence.induced_unitIso π Mathlib.CategoryTheory.EqToHom
{D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : Type u_2} (e : T β D) : (CategoryTheory.Equivalence.induced e).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - CategoryTheory.piEquivalenceFunctorDiscrete_counitIso π Mathlib.CategoryTheory.Discrete.Basic
(J : Type uβ) (C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.piEquivalenceFunctorDiscrete J C).counitIso = CategoryTheory.NatIso.ofComponents (fun F => CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((({ obj := fun F j => F.obj { as := j }, map := fun {X Y} f j => f.app { as := j }, map_id := β―, map_comp := β― }.comp { obj := fun F => CategoryTheory.Discrete.functor F, map := fun {X Y} f => CategoryTheory.Discrete.natTrans fun j => f j.as, map_id := β―, map_comp := β― }).obj F).obj x)) β―) β― - CategoryTheory.Comma.opEquiv_unitIso π Mathlib.CategoryTheory.Comma.Basic
{A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Comma L R)).obj X)) β― - CategoryTheory.Comma.opEquiv_counitIso π Mathlib.CategoryTheory.Comma.Basic
{A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) (R : CategoryTheory.Functor B T) : (CategoryTheory.Comma.opEquiv L R).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl (((CategoryTheory.Comma.unopFunctor R L).leftOp.comp (CategoryTheory.Comma.opFunctor L R)).obj X)) β― - CategoryTheory.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.Functor.CorepresentableBy.equivUliftCoyonedaIso_apply π Mathlib.CategoryTheory.Yoneda
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor C (Type (max w vβ))) (X : C) (R : F.CorepresentableBy X) : (CategoryTheory.Functor.CorepresentableBy.equivUliftCoyonedaIso F X) R = CategoryTheory.NatIso.ofComponents (fun X_1 => equivEquivIso (Equiv.ulift.trans R.homEquiv)) β― - 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.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.Limits.Cone.postcomposeEquivalence_unitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F G : CategoryTheory.Functor J C} (Ξ± : F β G) : (CategoryTheory.Limits.Cone.postcomposeEquivalence Ξ±).unitIso = CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cone F)).obj s).pt) β―) β― - CategoryTheory.Limits.Cone.postcomposeEquivalence_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F G : CategoryTheory.Functor J C} (Ξ± : F β G) : (CategoryTheory.Limits.Cone.postcomposeEquivalence Ξ±).counitIso = CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl (((CategoryTheory.Limits.Cone.postcompose Ξ±.inv).comp (CategoryTheory.Limits.Cone.postcompose Ξ±.hom)).obj s).pt) β―) β― - CategoryTheory.Limits.Cone.whiskeringEquivalence_unitIso π Mathlib.CategoryTheory.Limits.Cones
{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} (e : K β J) : (CategoryTheory.Limits.Cone.whiskeringEquivalence e).unitIso = CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cone F)).obj s).pt) β―) β― - CategoryTheory.Limits.Cone.functorialityEquivalence_unitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor J C) (e : C β D) : (CategoryTheory.Limits.Cone.functorialityEquivalence F e).unitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cone.ext (e.unitIso.app ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cone F)).obj c).1) β―) β― - CategoryTheory.Limits.Cone.whiskeringEquivalence_counitIso π Mathlib.CategoryTheory.Limits.Cones
{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} (e : K β J) : (CategoryTheory.Limits.Cone.whiskeringEquivalence e).counitIso = CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)).comp (CategoryTheory.Limits.Cone.whiskering e.functor)).obj s).pt) β―) β― - CategoryTheory.Limits.Cone.functorialityEquivalence_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor J C) (e : C β D) : (CategoryTheory.Limits.Cone.functorialityEquivalence F e).counitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cone.ext (e.counitIso.app c.pt) β―) β― - CategoryTheory.Limits.Cone.equivalenceOfReindexing_counitIso π Mathlib.CategoryTheory.Limits.Cones
{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} {G : CategoryTheory.Functor K C} (e : K β J) (Ξ± : e.functor.comp F β G) : (CategoryTheory.Limits.Cone.equivalenceOfReindexing e Ξ±).counitIso = (((CategoryTheory.Limits.Cone.postcompose Ξ±.inv).comp ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom))).associator (CategoryTheory.Limits.Cone.whiskering e.functor) (CategoryTheory.Limits.Cone.postcompose Ξ±.hom)).symm βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cone.postcompose Ξ±.inv).associator ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)) (CategoryTheory.Limits.Cone.whiskering e.functor)) (CategoryTheory.Limits.Cone.postcompose Ξ±.hom) βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cone.postcompose Ξ±.inv).isoWhiskerLeft (CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl s.pt) β―) β―)) (CategoryTheory.Limits.Cone.postcompose Ξ±.hom) βͺβ« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.Limits.Cone.postcompose Ξ±.inv).rightUnitor (CategoryTheory.Limits.Cone.postcompose Ξ±.hom) βͺβ« CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl s.pt) β―) β― - CategoryTheory.Limits.Cone.equivalenceOfReindexing_unitIso π Mathlib.CategoryTheory.Limits.Cones
{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} {G : CategoryTheory.Functor K C} (e : K β J) (Ξ± : e.functor.comp F β G) : (CategoryTheory.Limits.Cone.equivalenceOfReindexing e Ξ±).unitIso = CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl s.pt) β―) β― βͺβ« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.Limits.Cone.whiskering e.functor).rightUnitor.symm ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)) βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cone.whiskering e.functor).isoWhiskerLeft (CategoryTheory.NatIso.ofComponents (fun s => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl s.pt) β―) β―)) ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)) βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cone.whiskering e.functor).associator (CategoryTheory.Limits.Cone.postcompose Ξ±.hom) (CategoryTheory.Limits.Cone.postcompose Ξ±.inv)).symm ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)) βͺβ« ((CategoryTheory.Limits.Cone.whiskering e.functor).comp (CategoryTheory.Limits.Cone.postcompose Ξ±.hom)).associator (CategoryTheory.Limits.Cone.postcompose Ξ±.inv) ((CategoryTheory.Limits.Cone.whiskering e.inverse).comp (CategoryTheory.Limits.Cone.postcompose (e.invFunIdAssoc F).hom)) - CategoryTheory.AsSmall.equiv_unitIso π Mathlib.CategoryTheory.Category.ULift
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.AsSmall.equiv.unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - CategoryTheory.AsSmall.equiv_counitIso π Mathlib.CategoryTheory.Category.ULift
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.AsSmall.equiv.counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - OrderIso.equivalence_counitIso π Mathlib.CategoryTheory.Category.Preorder
{X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X βo Y) : e.equivalence.counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - OrderIso.equivalence_unitIso π Mathlib.CategoryTheory.Category.Preorder
{X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (e : X βo Y) : e.equivalence.unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - CategoryTheory.skeletonEquivalence_counitIso π Mathlib.CategoryTheory.Skeletal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.skeletonEquivalence C).counitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.fromSkeletonToSkeletonIso β― - CategoryTheory.skeletonEquivalence_unitIso π Mathlib.CategoryTheory.Skeletal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.skeletonEquivalence C).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.InducedCategory.isoMk (Nonempty.some β―).symm) β― - CategoryTheory.ShrinkHoms.equivalence_unitIso π Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id C).obj x)) β― - CategoryTheory.ShrinkHoms.equivalence_counitIso π Mathlib.CategoryTheory.EssentiallySmall
(C : Type u) [CategoryTheory.Category.{v, u} C] [CategoryTheory.LocallySmall.{w, v, u} C] : (CategoryTheory.ShrinkHoms.equivalence C).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.ShrinkHoms.inverse C).comp (CategoryTheory.ShrinkHoms.functor C)).obj x)) β― - CategoryTheory.Functor.equiv_counitIso π Mathlib.CategoryTheory.PUnit
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.Functor.equiv.counitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.Iso.refl β― - CategoryTheory.Functor.equiv_unitIso π Mathlib.CategoryTheory.PUnit
{C : Type u} [CategoryTheory.Category.{v, u} C] : CategoryTheory.Functor.equiv.unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Discrete.natIso fun x_1 => CategoryTheory.Iso.refl (((CategoryTheory.Functor.id (CategoryTheory.Functor (CategoryTheory.Discrete PUnit.{w + 1}) C)).obj x).obj x_1)) β― - CategoryTheory.CostructuredArrow.prodEquivalence_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C' : Type uβ} [CategoryTheory.Category.{vβ, uβ} C'] {D' : Type uβ} [CategoryTheory.Category.{vβ, uβ} D'] (S : CategoryTheory.Functor C D) (S' : CategoryTheory.Functor C' D') (T : D) (T' : D') : (CategoryTheory.CostructuredArrow.prodEquivalence S S' T T').counitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Iso.refl (((CategoryTheory.CostructuredArrow.prodInverse S S' T T').comp (CategoryTheory.CostructuredArrow.prodFunctor S S' T T')).obj f)) β― - CategoryTheory.StructuredArrow.prodEquivalence_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C' : Type uβ} [CategoryTheory.Category.{vβ, uβ} C'] {D' : Type uβ} [CategoryTheory.Category.{vβ, uβ} D'] (S : D) (S' : D') (T : CategoryTheory.Functor C D) (T' : CategoryTheory.Functor C' D') : (CategoryTheory.StructuredArrow.prodEquivalence S S' T T').counitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Iso.refl (((CategoryTheory.StructuredArrow.prodInverse S S' T T').comp (CategoryTheory.StructuredArrow.prodFunctor S S' T T')).obj f)) β― - CategoryTheory.CostructuredArrow.prodEquivalence_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C' : Type uβ} [CategoryTheory.Category.{vβ, uβ} C'] {D' : Type uβ} [CategoryTheory.Category.{vβ, uβ} D'] (S : CategoryTheory.Functor C D) (S' : CategoryTheory.Functor C' D') (T : D) (T' : D') : (CategoryTheory.CostructuredArrow.prodEquivalence S S' T T').unitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.CostructuredArrow (S.prod S') (T, T'))).obj f)) β― - CategoryTheory.StructuredArrow.prodEquivalence_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C' : Type uβ} [CategoryTheory.Category.{vβ, uβ} C'] {D' : Type uβ} [CategoryTheory.Category.{vβ, uβ} D'] (S : D) (S' : D') (T : CategoryTheory.Functor C D) (T' : CategoryTheory.Functor C' D') : (CategoryTheory.StructuredArrow.prodEquivalence S S' T T').unitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.StructuredArrow (S, S') (T.prod T'))).obj f)) β― - CategoryTheory.CostructuredArrow.preEquivalence_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D E} {e : E} (f : CategoryTheory.CostructuredArrow G e) : (CategoryTheory.CostructuredArrow.preEquivalence F f).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.CostructuredArrow.preEquivalence.inverse F f).comp (CategoryTheory.CostructuredArrow.preEquivalence.functor F f)).obj x).left) β―) β― - CategoryTheory.StructuredArrow.preEquivalence_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D E} {e : E} (f : CategoryTheory.StructuredArrow e G) : (CategoryTheory.StructuredArrow.preEquivalence F f).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.StructuredArrow.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.StructuredArrow.preEquivalenceInverse F f).comp (CategoryTheory.StructuredArrow.preEquivalenceFunctor F f)).obj x).right) β―) β― - CategoryTheory.CostructuredArrow.preEquivalence_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D E} {e : E} (f : CategoryTheory.CostructuredArrow G e) : (CategoryTheory.CostructuredArrow.preEquivalence F f).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.CostructuredArrow (CategoryTheory.CostructuredArrow.pre F G e) f)).obj X).left.left) β―) β―) β― - CategoryTheory.StructuredArrow.preEquivalence_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (F : CategoryTheory.Functor C D) {G : CategoryTheory.Functor D E} {e : E} (f : CategoryTheory.StructuredArrow e G) : (CategoryTheory.StructuredArrow.preEquivalence F f).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.StructuredArrow.isoMk (CategoryTheory.StructuredArrow.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.StructuredArrow f (CategoryTheory.StructuredArrow.pre e F G))).obj X).right.right) β―) β―) β― - CategoryTheory.Over.equivalenceOfIsTerminal_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (hX : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.Over.equivalenceOfIsTerminal hX).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (({ obj := fun Y => CategoryTheory.Over.mk (hX.from Y), map := fun {X_1 Y} f => CategoryTheory.Over.homMk f β―, map_id := β―, map_comp := β― }.comp (CategoryTheory.Over.forget X)).obj x)) β― - CategoryTheory.Under.equivalenceOfIsInitial_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (hX : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.Under.equivalenceOfIsInitial hX).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (({ obj := fun Y => CategoryTheory.Under.mk (hX.to Y), map := fun {X_1 Y} f => CategoryTheory.Under.homMk f β―, map_id := β―, map_comp := β― }.comp (CategoryTheory.Under.forget X)).obj x)) β― - CategoryTheory.Over.equivalenceOfIsTerminal_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (hX : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.Over.equivalenceOfIsTerminal hX).unitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Over X)).obj Y).left) β―) β― - CategoryTheory.Under.equivalenceOfIsInitial_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (hX : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.Under.equivalenceOfIsInitial hX).unitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Under.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Under X)).obj Y).right) β―) β― - CategoryTheory.Over.iteratedSliceEquiv_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (f : CategoryTheory.Over X) : f.iteratedSliceEquiv.counitIso = CategoryTheory.NatIso.ofComponents (fun g => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((f.iteratedSliceBackward.comp f.iteratedSliceForward).obj g).left) β―) β― - CategoryTheory.Over.iteratedSliceEquiv_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {X : T} (f : CategoryTheory.Over X) : f.iteratedSliceEquiv.unitIso = CategoryTheory.NatIso.ofComponents (fun g => CategoryTheory.Over.isoMk (CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Over f)).obj g).left.left) β―) β―) β― - CategoryTheory.Over.postEquiv_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : T) (F : T β D) : (CategoryTheory.Over.postEquiv X F).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Over.isoMk (F.unitIso.app A.left) β―) β― - CategoryTheory.Under.postEquiv_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : T) (F : T β D) : (CategoryTheory.Under.postEquiv X F).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Under.isoMk (F.unitIso.app A.right) β―) β― - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.CostructuredArrow (CategoryTheory.Comma.fst F G) c)).obj x)) β― - CategoryTheory.StructuredArrow.ofCommaSndEquivalence_unitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.StructuredArrow.ofCommaSndEquivalence F G c).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.StructuredArrow c (CategoryTheory.Comma.fst F G))).obj x)) β― - CategoryTheory.Over.postEquiv_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : T) (F : T β D) : (CategoryTheory.Over.postEquiv X F).counitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Over.isoMk (F.counitIso.app A.left) β―) β― - CategoryTheory.Under.postEquiv_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : T) (F : T β D) : (CategoryTheory.Under.postEquiv X F).counitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Under.isoMk (F.counitIso.app A.right) β―) β― - CategoryTheory.CostructuredArrow.ofCommaFstEquivalence_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.CostructuredArrow.ofCommaFstEquivalence F G c).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceInverse F G c).comp (CategoryTheory.CostructuredArrow.ofCommaFstEquivalenceFunctor F G c)).obj x)) β― - CategoryTheory.StructuredArrow.ofCommaSndEquivalence_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor C T) (G : CategoryTheory.Functor D T) (c : C) : (CategoryTheory.StructuredArrow.ofCommaSndEquivalence F G c).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.StructuredArrow.ofCommaSndEquivalenceInverse F G c).comp (CategoryTheory.StructuredArrow.ofCommaSndEquivalenceFunctor F G c)).obj x)) β― - CategoryTheory.shrinkCoyonedaIsoCoyoneda_hom_app π Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : Cα΅α΅) : CategoryTheory.shrinkCoyonedaIsoCoyoneda.hom.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkCoyonedaObjObjEquiv.toIso) β―).hom - CategoryTheory.shrinkCoyonedaIsoCoyoneda_inv_app π Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : Cα΅α΅) : CategoryTheory.shrinkCoyonedaIsoCoyoneda.inv.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkCoyonedaObjObjEquiv.toIso) β―).inv - CategoryTheory.shrinkYonedaIsoYoneda_hom_app π Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.shrinkYonedaIsoYoneda.hom.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkYonedaObjObjEquiv.toIso) β―).hom - CategoryTheory.shrinkYonedaIsoYoneda_inv_app π Mathlib.CategoryTheory.ShrinkYoneda
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) : CategoryTheory.shrinkYonedaIsoYoneda.inv.app X = (CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.shrinkYonedaObjObjEquiv.toIso) β―).inv - CategoryTheory.Comon.Comon_EquivMon_OpOp_unitIso π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] : (CategoryTheory.Comon.Comon_EquivMon_OpOp C).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Comon C)).obj x)) β― - CategoryTheory.Comon.Comon_EquivMon_OpOp_counitIso π Mathlib.CategoryTheory.Monoidal.Comon_
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] : (CategoryTheory.Comon.Comon_EquivMon_OpOp C).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.Comon.MonOpOpToComon C).comp (CategoryTheory.Comon.ComonToMonOpOp C)).obj x)) β― - CoalgCat.comonEquivalence_unitIso π Mathlib.Algebra.Category.CoalgCat.ComonEquivalence
(R : Type u) [CommRing R] : (CoalgCat.comonEquivalence R).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CoalgCat R)).obj x)) β― - CoalgCat.comonEquivalence_counitIso π Mathlib.Algebra.Category.CoalgCat.ComonEquivalence
(R : Type u) [CommRing R] : (CoalgCat.comonEquivalence R).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CoalgCat.ofComon R).comp (CoalgCat.toComon R)).obj x)) β― - CategoryTheory.algebraEquivUnder_counitIso π Mathlib.CategoryTheory.Monad.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryCoproducts C] : (CategoryTheory.algebraEquivUnder X).counitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Under.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.underToAlgebra X).comp (CategoryTheory.algebraToUnder X)).obj f).right) β―) β― - CategoryTheory.coalgebraEquivOver_counitIso π Mathlib.CategoryTheory.Monad.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryProducts C] : (CategoryTheory.coalgebraEquivOver X).counitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.overToCoalgebra X).comp (CategoryTheory.coalgebraToOver X)).obj f).left) β―) β― - CategoryTheory.algebraEquivUnder_unitIso π Mathlib.CategoryTheory.Monad.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryCoproducts C] : (CategoryTheory.algebraEquivUnder X).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Monad.Algebra.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.coprodMonad X).Algebra).obj A).A) β―) β― - CategoryTheory.coalgebraEquivOver_unitIso π Mathlib.CategoryTheory.Monad.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] (X : C) [CategoryTheory.Limits.HasBinaryProducts C] : (CategoryTheory.coalgebraEquivOver X).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Comonad.Coalgebra.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.prodComonad X).Coalgebra).obj A).A) β―) β― - CategoryTheory.Over.postAdjunctionLeft_counit_app_left π Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.Limits.HasPullbacks C] {X : C} {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (a : F β£ G) (Xβ : CategoryTheory.Over ((CategoryTheory.Functor.id D).obj (F.obj X))) : ((CategoryTheory.Over.postAdjunctionLeft a).counit.app Xβ).left = CategoryTheory.CategoryStruct.comp ((CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (F.obj Y.left)) β―) β―).inv.app ((CategoryTheory.Over.pullback (a.unit.app X)).obj (CategoryTheory.Over.mk (G.map Xβ.hom)))).left (CategoryTheory.CategoryStruct.comp (F.map (CategoryTheory.Limits.pullback.fst (G.map Xβ.hom) (a.unit.app X))) (CategoryTheory.Over.Hom.left (CategoryTheory.Over.homMk (a.counit.app Xβ.left) β―))) - CategoryTheory.Over.postAdjunctionLeft_unit_app_left π Mathlib.CategoryTheory.Comma.Over.Pullback
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] [CategoryTheory.Limits.HasPullbacks C] {X : C} {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (a : F β£ G) (Xβ : CategoryTheory.Over ((CategoryTheory.Functor.id C).obj X)) : ((CategoryTheory.Over.postAdjunctionLeft a).unit.app Xβ).left = CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.id Xβ.left) Xβ.hom β―) (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.lift (CategoryTheory.CategoryStruct.comp (CategoryTheory.Limits.pullback.fst (CategoryTheory.CategoryStruct.comp Xβ.hom (a.unit.app X)) (a.unit.app X)) (a.unit.app Xβ.left)) (CategoryTheory.Limits.pullback.snd (CategoryTheory.CategoryStruct.comp Xβ.hom (a.unit.app X)) (a.unit.app X)) β―) (((CategoryTheory.Over.post G).comp (CategoryTheory.Over.pullback (a.unit.app X))).map ((CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (F.obj Y.left)) β―) β―).hom.app Xβ)).left) - CategoryTheory.Limits.Cocone.equivStructuredArrow_unitIso π Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor J C) : (CategoryTheory.Limits.Cocone.equivStructuredArrow F).unitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.Limits.Cocone.eta β― - CategoryTheory.Limits.Cone.equivCostructuredArrow_unitIso π Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor J C) : (CategoryTheory.Limits.Cone.equivCostructuredArrow F).unitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.Limits.Cone.eta β― - CategoryTheory.Limits.Cocone.equivStructuredArrow_counitIso π Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor J C) : (CategoryTheory.Limits.Cocone.equivStructuredArrow F).counitIso = CategoryTheory.NatIso.ofComponents (fun x => x.eta.symm) β― - CategoryTheory.Limits.Cone.equivCostructuredArrow_counitIso π Mathlib.CategoryTheory.Limits.ConeCategory
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (F : CategoryTheory.Functor J C) : (CategoryTheory.Limits.Cone.equivCostructuredArrow F).counitIso = CategoryTheory.NatIso.ofComponents (fun x => x.eta.symm) β― - commAlgCatEquivUnder_unitIso π Mathlib.Algebra.Category.CommAlgCat.Basic
(R : CommRingCat) : (commAlgCatEquivUnder R).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CommAlgCat.isoMk (let __RingEquiv := RingEquiv.refl βA; { toEquiv := __RingEquiv.toEquiv, map_mul' := β―, map_add' := β―, commutes' := β― })) β― - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_unitIso π Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cα΅α΅ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).unitIso = CategoryTheory.NatIso.ofComponents (fun X => (CategoryTheory.CategoryOfElements.isoMk ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj (Opposite.op ((CategoryTheory.CategoryOfElements.toCostructuredArrow F).obj X))) (Opposite.unop X) (CategoryTheory.Iso.refl ((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).obj (Opposite.op ((CategoryTheory.CategoryOfElements.toCostructuredArrow F).obj X))).fst) β―).op) β― - CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence_counitIso π Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cα΅α΅ (Type v)) : (CategoryTheory.CategoryOfElements.costructuredArrowYonedaEquivalence F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl (((CategoryTheory.CategoryOfElements.fromCostructuredArrow F).rightOp.comp (CategoryTheory.CategoryOfElements.toCostructuredArrow F)).obj X).left) β―) β― - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_counitIso π Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cα΅α΅ (Type (max w v))) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.CostructuredArrow.isoMk (CategoryTheory.Iso.refl (({ obj := fun X => Opposite.op (F.elementsMk (Opposite.op X.left) (CategoryTheory.uliftYonedaEquiv X.hom)), map := fun {X Y} f => (CategoryTheory.CategoryOfElements.homMk (F.elementsMk (Opposite.op Y.left) (CategoryTheory.uliftYonedaEquiv Y.hom)) (F.elementsMk (Opposite.op X.left) (CategoryTheory.uliftYonedaEquiv X.hom)) f.left.op β―).op, map_id := β―, map_comp := β― }.comp { obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (β(Opposite.unop f)).unop β―, map_id := β―, map_comp := β― }).obj X).left) β―) β― - CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence_unitIso π Mathlib.CategoryTheory.Elements
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor Cα΅α΅ (Type (max w v))) : (CategoryTheory.CategoryOfElements.costructuredArrowULiftYonedaEquivalence F).unitIso = CategoryTheory.NatIso.ofComponents (fun x => (CategoryTheory.CategoryOfElements.isoMk (F.elementsMk (Opposite.op ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (β(Opposite.unop f)).unop β―, map_id := β―, map_comp := β― }.obj x).left) (CategoryTheory.uliftYonedaEquiv ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (β(Opposite.unop f)).unop β―, map_id := β―, map_comp := β― }.obj x).hom)) (Opposite.unop x) (CategoryTheory.Iso.refl (F.elementsMk (Opposite.op ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (β(Opposite.unop f)).unop β―, map_id := β―, map_comp := β― }.obj x).left) (CategoryTheory.uliftYonedaEquiv ({ obj := fun x => CategoryTheory.CostructuredArrow.mk (CategoryTheory.uliftYonedaEquiv.symm (Opposite.unop x).snd), map := fun {X Y} f => CategoryTheory.CostructuredArrow.homMk (β(Opposite.unop f)).unop β―, map_id := β―, map_comp := β― }.obj x).hom)).fst) β―).op) β― - CategoryTheory.Functor.Final.coconesEquiv_counitIso π Mathlib.CategoryTheory.Limits.Final
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.Final] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (G : CategoryTheory.Functor D E) : (CategoryTheory.Functor.Final.coconesEquiv F G).counitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cocone.ext (CategoryTheory.Iso.refl (((CategoryTheory.Limits.Cocone.whiskering F).comp CategoryTheory.Functor.Final.extendCocone).obj c).pt) β―) β― - CategoryTheory.Functor.Initial.conesEquiv_counitIso π Mathlib.CategoryTheory.Limits.Final
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.Initial] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (G : CategoryTheory.Functor D E) : (CategoryTheory.Functor.Initial.conesEquiv F G).counitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl (((CategoryTheory.Limits.Cone.whiskering F).comp CategoryTheory.Functor.Initial.extendCone).obj c).pt) β―) β― - CategoryTheory.Functor.Final.coconesEquiv_unitIso π Mathlib.CategoryTheory.Limits.Final
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.Final] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (G : CategoryTheory.Functor D E) : (CategoryTheory.Functor.Final.coconesEquiv F G).unitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cocone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cocone (F.comp G))).obj c).pt) β―) β― - CategoryTheory.Functor.Initial.conesEquiv_unitIso π Mathlib.CategoryTheory.Limits.Final
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.Initial] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (G : CategoryTheory.Functor D E) : (CategoryTheory.Functor.Initial.conesEquiv F G).unitIso = CategoryTheory.NatIso.ofComponents (fun c => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Cone (F.comp G))).obj c).pt) β―) β― - CategoryTheory.equivEssImageOfReflective_counitIso π Mathlib.CategoryTheory.Adjunction.Reflective
{C : Type uβ} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Category.{vβ, uβ} D] {i : CategoryTheory.Functor D C} [CategoryTheory.Reflective i] : CategoryTheory.equivEssImageOfReflective.counitIso = CategoryTheory.Functor.fullyFaithfulCancelRight i.essImage.ΞΉ (CategoryTheory.NatIso.ofComponents (fun X => (CategoryTheory.asIso ((CategoryTheory.reflectorAdjunction i).unit.app X.obj)).symm) β―) - CategoryTheory.MonoOver.congr_unitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).unitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.MonoOver.isoMk (e.unitIso.app Y.obj.left) β―) β― - CategoryTheory.MonoOver.congr_counitIso π Mathlib.CategoryTheory.Subobject.MonoOver
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (X : C) {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.MonoOver.congr X e).counitIso = CategoryTheory.NatIso.ofComponents (fun Y => CategoryTheory.MonoOver.isoMk (e.counitIso.app Y.obj.left) β―) β― - CategoryTheory.CostructuredArrow.grothendieckPrecompFunctorEquivalence_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Functor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (L : CategoryTheory.Functor C D) (R : CategoryTheory.Functor E D) : (CategoryTheory.CostructuredArrow.grothendieckPrecompFunctorEquivalence L R).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.CostructuredArrow.commaToGrothendieckPrecompFunctor L R).comp (CategoryTheory.CostructuredArrow.grothendieckPrecompFunctorToComma L R)).obj x)) β― - CategoryTheory.CostructuredArrow.grothendieckPrecompFunctorEquivalence_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Functor
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (L : CategoryTheory.Functor C D) (R : CategoryTheory.Functor E D) : (CategoryTheory.CostructuredArrow.grothendieckPrecompFunctorEquivalence L R).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Grothendieck (R.comp (CategoryTheory.CostructuredArrow.functor L)))).obj x)) β― - CategoryTheory.Limits.WalkingParallelFamily.equivalenceOfEquiv_unitIso π Mathlib.CategoryTheory.Limits.Shapes.WideEqualizers
{J : Type w} {J' : Type w'} (e : J β J') : (CategoryTheory.Limits.WalkingParallelFamily.equivalenceOfEquiv e).unitIso = CategoryTheory.NatIso.ofComponents (fun x => match x with | CategoryTheory.Limits.WalkingParallelFamily.zero => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.WalkingParallelFamily J)).obj CategoryTheory.Limits.WalkingParallelFamily.zero) | CategoryTheory.Limits.WalkingParallelFamily.one => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.WalkingParallelFamily J)).obj CategoryTheory.Limits.WalkingParallelFamily.one)) β― - CategoryTheory.Limits.WalkingParallelFamily.equivalenceOfEquiv_counitIso π Mathlib.CategoryTheory.Limits.Shapes.WideEqualizers
{J : Type w} {J' : Type w'} (e : J β J') : (CategoryTheory.Limits.WalkingParallelFamily.equivalenceOfEquiv e).counitIso = CategoryTheory.NatIso.ofComponents (fun x => match x with | CategoryTheory.Limits.WalkingParallelFamily.zero => CategoryTheory.Iso.refl (((CategoryTheory.Limits.parallelFamily fun j => CategoryTheory.Limits.WalkingParallelFamily.Hom.line (e.symm j)).comp (CategoryTheory.Limits.parallelFamily fun j => CategoryTheory.Limits.WalkingParallelFamily.Hom.line (e j))).obj CategoryTheory.Limits.WalkingParallelFamily.zero) | CategoryTheory.Limits.WalkingParallelFamily.one => CategoryTheory.Iso.refl (((CategoryTheory.Limits.parallelFamily fun j => CategoryTheory.Limits.WalkingParallelFamily.Hom.line (e.symm j)).comp (CategoryTheory.Limits.parallelFamily fun j => CategoryTheory.Limits.WalkingParallelFamily.Hom.line (e j))).obj CategoryTheory.Limits.WalkingParallelFamily.one)) β― - CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiForkOfIsLimit_unitIso π Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MulticospanShape} (I : CategoryTheory.Limits.MulticospanIndex J C) {c : CategoryTheory.Limits.Fan I.left} (hc : CategoryTheory.Limits.IsLimit c) {d : CategoryTheory.Limits.Fan I.right} (hd : CategoryTheory.Limits.IsLimit d) : (I.multiforkEquivPiForkOfIsLimit hc hd).unitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Cone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Multifork I)).obj K).pt) β―) β― - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_unitIso π Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).unitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Cocone.ext (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Limits.Multicofork I)).obj K).pt) β―) β― - CategoryTheory.Limits.MulticospanIndex.multiforkEquivPiForkOfIsLimit_counitIso π Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MulticospanShape} (I : CategoryTheory.Limits.MulticospanIndex J C) {c : CategoryTheory.Limits.Fan I.left} (hc : CategoryTheory.Limits.IsLimit c) {d : CategoryTheory.Limits.Fan I.right} (hd : CategoryTheory.Limits.IsLimit d) : (I.multiforkEquivPiForkOfIsLimit hc hd).counitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Fork.ext (CategoryTheory.Iso.refl (((I.ofPiForkFunctor hd).comp (I.toPiForkFunctor hc hd)).obj K).pt) β―) β― - CategoryTheory.Limits.MultispanIndex.multicoforkEquivSigmaCoforkOfIsColimit_counitIso π Mathlib.CategoryTheory.Limits.Shapes.Multiequalizer
{C : Type u} [CategoryTheory.Category.{v, u} C] {J : CategoryTheory.Limits.MultispanShape} (I : CategoryTheory.Limits.MultispanIndex J C) {c : CategoryTheory.Limits.Cofan I.left} (hc : CategoryTheory.Limits.IsColimit c) {d : CategoryTheory.Limits.Cofan I.right} (hd : CategoryTheory.Limits.IsColimit d) : (I.multicoforkEquivSigmaCoforkOfIsColimit hc hd).counitIso = CategoryTheory.NatIso.ofComponents (fun K => CategoryTheory.Limits.Cofork.ext (CategoryTheory.Iso.refl (((I.ofSigmaCoforkFunctor hc).comp (I.toSigmaCoforkFunctor hc hd)).obj K).pt) β―) β― - TopologicalSpace.Opens.mapMapIso_counitIso π Mathlib.Topology.Category.TopCat.Opens
{X Y : TopCat} (H : X β Y) : (TopologicalSpace.Opens.mapMapIso H).counitIso = CategoryTheory.NatIso.ofComponents (fun U => CategoryTheory.eqToIso β―) β― - TopologicalSpace.Opens.mapMapIso_unitIso π Mathlib.Topology.Category.TopCat.Opens
{X Y : TopCat} (H : X β Y) : (TopologicalSpace.Opens.mapMapIso H).unitIso = CategoryTheory.NatIso.ofComponents (fun U => CategoryTheory.eqToIso β―) β― - CategoryTheory.Limits.pullbackConeEquivBinaryFan_unitIso π Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y βΆ X} {g : Z βΆ X} : CategoryTheory.Limits.pullbackConeEquivBinaryFan.unitIso = CategoryTheory.NatIso.ofComponents (fun c => c.eta) β― - CategoryTheory.Limits.pushoutCoconeEquivBinaryCofan_unitIso π Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X βΆ Y} {g : X βΆ Z} : CategoryTheory.Limits.pushoutCoconeEquivBinaryCofan.unitIso = CategoryTheory.NatIso.ofComponents (fun c => c.eta) β― - CategoryTheory.Limits.pullbackConeEquivBinaryFan_counitIso π Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : Y βΆ X} {g : Z βΆ X} : CategoryTheory.Limits.pullbackConeEquivBinaryFan.counitIso = CategoryTheory.NatIso.ofComponents (fun X_1 => CategoryTheory.Limits.BinaryFan.ext (CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl (({ obj := fun c => CategoryTheory.Limits.PullbackCone.mk (CategoryTheory.Over.Hom.left c.fst) (CategoryTheory.Over.Hom.left c.snd) β―, map := fun {cβ cβ} a => { hom := CategoryTheory.Over.Hom.left a.hom, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.BinaryFan.mk (CategoryTheory.Over.homMk c.fst β―) (CategoryTheory.Over.homMk c.snd β―), map := fun {cβ cβ} a => { hom := CategoryTheory.Over.homMk a.hom β―, w := β― }, map_id := β―, map_comp := β― }).obj X_1).pt.left) β―) β― β―) β― - CategoryTheory.Limits.pushoutCoconeEquivBinaryCofan_counitIso π Mathlib.CategoryTheory.Limits.Constructions.Over.Products
{C : Type u} [CategoryTheory.Category.{v, u} C] {X Y Z : C} {f : X βΆ Y} {g : X βΆ Z} : CategoryTheory.Limits.pushoutCoconeEquivBinaryCofan.counitIso = CategoryTheory.NatIso.ofComponents (fun X_1 => CategoryTheory.Limits.BinaryCofan.ext (CategoryTheory.Under.isoMk (CategoryTheory.Iso.refl (({ obj := fun c => CategoryTheory.Limits.PushoutCocone.mk (CategoryTheory.Under.Hom.right c.inl) (CategoryTheory.Under.Hom.right c.inr) β―, map := fun {cβ cβ} a => { hom := CategoryTheory.Under.Hom.right a.hom, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.BinaryCofan.mk (CategoryTheory.Under.homMk c.inl β―) (CategoryTheory.Under.homMk c.inr β―), map := fun {cβ cβ} a => { hom := CategoryTheory.Under.homMk a.hom β―, w := β― }, map_id := β―, map_comp := β― }).obj X_1).pt.right) β―) β― β―) β― - FinPartOrd.dualEquiv_counitIso π Mathlib.Order.Category.FinPartOrd
: FinPartOrd.dualEquiv.counitIso = CategoryTheory.NatIso.ofComponents (fun X => FinPartOrd.Iso.mk (OrderIso.dualDual βX.toPartOrd)) @FinPartOrd.dualEquiv._proof_2 - FinPartOrd.dualEquiv_unitIso π Mathlib.Order.Category.FinPartOrd
: FinPartOrd.dualEquiv.unitIso = CategoryTheory.NatIso.ofComponents (fun X => FinPartOrd.Iso.mk (OrderIso.dualDual βX.toPartOrd)) @FinPartOrd.dualEquiv._proof_1 - CategoryTheory.underEquivOfIsTerminal_unitIso π Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.underEquivOfIsTerminal.{w, v_1, u_1} X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Under.isoMk (CategoryTheory.asIso A.hom).symm β―) β― - CategoryTheory.overEquivOfIsInitial_unitIso π Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.overEquivOfIsInitial.{w, v_1, u_1} X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.Over.isoMk (CategoryTheory.asIso A.hom) β―) β― - CategoryTheory.MorphismProperty.underEquivOfIsTerminal_unitIso π Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictTerminalObjects C] (X : C) (h : CategoryTheory.Limits.IsTerminal X) : (CategoryTheory.MorphismProperty.underEquivOfIsTerminal.{w, v_1, u_1} P Q X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.MorphismProperty.Under.isoMk (CategoryTheory.asIso A.hom).symm β―) β― - CategoryTheory.MorphismProperty.overEquivOfIsInitial_unitIso π Mathlib.CategoryTheory.Comma.Over.StrictInitial
{C : Type u_1} [CategoryTheory.Category.{v_1, u_1} C] (P Q : CategoryTheory.MorphismProperty C) [P.ContainsIdentities] [Q.IsMultiplicative] [Q.RespectsIso] [CategoryTheory.Limits.HasStrictInitialObjects C] (X : C) (h : CategoryTheory.Limits.IsInitial X) : (CategoryTheory.MorphismProperty.overEquivOfIsInitial.{w, v_1, u_1} P Q X h).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.MorphismProperty.Over.isoMk (CategoryTheory.asIso A.hom) β―) β― - FundamentalGroupoid.punitEquivDiscretePUnit_unitIso π Mathlib.AlgebraicTopology.FundamentalGroupoid.PUnit
: FundamentalGroupoid.punitEquivDiscretePUnit.unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (FundamentalGroupoid PUnit.{u + 1})).obj x)) @FundamentalGroupoid.punitEquivDiscretePUnit._proof_2 - CategoryTheory.ForgetEnrichment.equiv_counitIso π Mathlib.CategoryTheory.Enriched.Ordinary.Basic
(V : Type u') [CategoryTheory.Category.{v', u'} V] [CategoryTheory.MonoidalCategory V] {D : Type u''} [CategoryTheory.Category.{v'', u''} D] [CategoryTheory.EnrichedOrdinaryCategory V D] : (CategoryTheory.ForgetEnrichment.equiv V).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl (((CategoryTheory.ForgetEnrichment.equivInverse V D).comp (CategoryTheory.ForgetEnrichment.equivFunctor V D)).obj X)) β― - CategoryTheory.ForgetEnrichment.equiv_unitIso π Mathlib.CategoryTheory.Enriched.Ordinary.Basic
(V : Type u') [CategoryTheory.Category.{v', u'} V] [CategoryTheory.MonoidalCategory V] {D : Type u''} [CategoryTheory.Category.{v'', u''} D] [CategoryTheory.EnrichedOrdinaryCategory V D] : (CategoryTheory.ForgetEnrichment.equiv V).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.ForgetEnrichment V D)).obj X)) β― - CategoryTheory.TransportEnrichment.forgetEnrichmentEquiv_unitIso π Mathlib.CategoryTheory.Enriched.Ordinary.Basic
{V : Type u'} [CategoryTheory.Category.{v', u'} V] [CategoryTheory.MonoidalCategory V] {W : Type u''} [CategoryTheory.Category.{v'', u''} W] [CategoryTheory.MonoidalCategory W] (F : CategoryTheory.Functor V W) [F.LaxMonoidal] (D : Type u) [CategoryTheory.EnrichedCategory V D] (e : (v : V) β (CategoryTheory.MonoidalCategoryStruct.tensorUnit V βΆ v) β (CategoryTheory.MonoidalCategoryStruct.tensorUnit W βΆ F.obj v)) (h : β (v : V) (f : CategoryTheory.MonoidalCategoryStruct.tensorUnit V βΆ v), (e v) f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.Ξ΅ F) (F.map f)) : (CategoryTheory.TransportEnrichment.forgetEnrichmentEquiv F D e h).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.TransportEnrichment F (CategoryTheory.ForgetEnrichment V D))).obj x)) β― - CategoryTheory.TransportEnrichment.forgetEnrichmentEquiv_counitIso π Mathlib.CategoryTheory.Enriched.Ordinary.Basic
{V : Type u'} [CategoryTheory.Category.{v', u'} V] [CategoryTheory.MonoidalCategory V] {W : Type u''} [CategoryTheory.Category.{v'', u''} W] [CategoryTheory.MonoidalCategory W] (F : CategoryTheory.Functor V W) [F.LaxMonoidal] (D : Type u) [CategoryTheory.EnrichedCategory V D] (e : (v : V) β (CategoryTheory.MonoidalCategoryStruct.tensorUnit V βΆ v) β (CategoryTheory.MonoidalCategoryStruct.tensorUnit W βΆ F.obj v)) (h : β (v : V) (f : CategoryTheory.MonoidalCategoryStruct.tensorUnit V βΆ v), (e v) f = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.Ξ΅ F) (F.map f)) : (CategoryTheory.TransportEnrichment.forgetEnrichmentEquiv F D e h).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.TransportEnrichment.forgetEnrichmentEquivInverse F D e h).comp (CategoryTheory.TransportEnrichment.forgetEnrichmentEquivFunctor F D e h)).obj x)) β― - CategoryTheory.Sigma.mapId_hom_app π Mathlib.CategoryTheory.Sigma.Basic
(I : Type wβ) (C : I β Type uβ) [(i : I) β CategoryTheory.Category.{vβ, uβ} (C i)] (xβ : (i : I) Γ (fun i => C (id i)) i) : (CategoryTheory.Sigma.mapId I C).hom.app xβ = (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl β¨xβ.fst, xβ©) β―).hom.app xβ.snd - CategoryTheory.Sigma.mapId_inv_app π Mathlib.CategoryTheory.Sigma.Basic
(I : Type wβ) (C : I β Type uβ) [(i : I) β CategoryTheory.Category.{vβ, uβ} (C i)] (xβ : (i : I) Γ (fun i => C (id i)) i) : (CategoryTheory.Sigma.mapId I C).inv.app xβ = (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl β¨xβ.fst, xβ©) β―).inv.app xβ.snd - CategoryTheory.Cat.opEquivalence_counitIso π Mathlib.CategoryTheory.Category.Cat.Op
: CategoryTheory.Cat.opEquivalence.counitIso = CategoryTheory.NatIso.ofComponents (fun x => { hom := (CategoryTheory.unopUnop βx).toCatHom, inv := (CategoryTheory.opOp βx).toCatHom, hom_inv_id := β―, inv_hom_id := β― }) @CategoryTheory.Cat.opEquivalence._proof_4 - CategoryTheory.Cat.opEquivalence_unitIso π Mathlib.CategoryTheory.Category.Cat.Op
: CategoryTheory.Cat.opEquivalence.unitIso = CategoryTheory.NatIso.ofComponents (fun x => { hom := (CategoryTheory.opOp βx).toCatHom, inv := (CategoryTheory.unopUnop βx).toCatHom, hom_inv_id := β―, inv_hom_id := β― }) @CategoryTheory.Cat.opEquivalence._proof_3 - CategoryTheory.comonEquiv_counitIso π Mathlib.CategoryTheory.Monoidal.Cartesian.Comon_
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.comonEquiv.counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.cartesianComon C).comp (CategoryTheory.Comon.forget C)).obj x)) β― - CategoryTheory.comonEquiv_unitIso π Mathlib.CategoryTheory.Monoidal.Cartesian.Comon_
{C : Type u} [CategoryTheory.Category.{v, u} C] [CategoryTheory.CartesianMonoidalCategory C] : CategoryTheory.comonEquiv.unitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.isoCartesianComon β― - CategoryTheory.forgetEnrichmentOppositeEquivalence_counitIso π Mathlib.CategoryTheory.Enriched.Opposite
(V : Type uβ) [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory V] [CategoryTheory.BraidedCategory V] (C : Type u) [CategoryTheory.EnrichedCategory V C] : (CategoryTheory.forgetEnrichmentOppositeEquivalence V C).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl (((CategoryTheory.forgetEnrichmentOppositeEquivalence.inverse V C).comp (CategoryTheory.forgetEnrichmentOppositeEquivalence.functor V C)).obj x)) β― - CategoryTheory.forgetEnrichmentOppositeEquivalence_unitIso π Mathlib.CategoryTheory.Enriched.Opposite
(V : Type uβ) [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory V] [CategoryTheory.BraidedCategory V] (C : Type u) [CategoryTheory.EnrichedCategory V C] : (CategoryTheory.forgetEnrichmentOppositeEquivalence V C).unitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.ForgetEnrichment V Cα΅α΅)).obj x)) β― - CategoryTheory.Equivalence.symmEquiv_unitIso π 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).unitIso = CategoryTheory.NatIso.ofComponents (fun e => CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (C β D)).obj e)) β― - 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.equivToOverUnit_counitIso π Mathlib.CategoryTheory.LocallyCartesianClosed.Over
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.CartesianMonoidalCategory C] : (CategoryTheory.equivToOverUnit C).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl (((CategoryTheory.toOverUnit C).comp (CategoryTheory.Over.forget (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))).obj X)) β― - CategoryTheory.equivToOverUnit_unitIso π Mathlib.CategoryTheory.LocallyCartesianClosed.Over
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.CartesianMonoidalCategory C] : (CategoryTheory.equivToOverUnit C).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Over.isoMk (CategoryTheory.Iso.refl ((CategoryTheory.Functor.id (CategoryTheory.Over (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))).obj X).left) β―) β― - CategoryTheory.kleisliCatEquivKleisli_unitIso π Mathlib.CategoryTheory.Monad.Types
(m : Type u β Type u) [Monad m] [LawfulMonad m] : (CategoryTheory.kleisliCatEquivKleisli m).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl X) β― - CategoryTheory.kleisliCatEquivKleisli_counitIso π Mathlib.CategoryTheory.Monad.Types
(m : Type u β Type u) [Monad m] [LawfulMonad m] : (CategoryTheory.kleisliCatEquivKleisli m).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl X) β― - CategoryTheory.subterminalsEquivMonoOverTerminal_unitIso π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).unitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.Iso.refl X) β― - CategoryTheory.subterminalsEquivMonoOverTerminal_counitIso π Mathlib.CategoryTheory.Subterminal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Limits.HasTerminal C] : (CategoryTheory.subterminalsEquivMonoOverTerminal C).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.MonoOver.isoMk (CategoryTheory.Iso.refl (({ obj := fun X => { obj := X.obj.left, property := β― }, map := fun {X Y} f => CategoryTheory.ObjectProperty.homMk f.hom.left, map_id := β―, map_comp := β― }.comp { obj := fun X => { obj := CategoryTheory.Over.mk (CategoryTheory.Limits.terminal.from X.obj), property := β― }, map := fun {X Y} f => CategoryTheory.MonoOver.homMk f.hom β―, map_id := β―, map_comp := β― }).obj X).obj.left) β―) β― - CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitorCorepresentingIso_hom_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F X : CategoryTheory.Functor C V) (aβ : (((CategoryTheory.Functor.whiskeringLeft (C Γ C) C V).obj (CategoryTheory.MonoidalCategory.tensor C)).comp (((CategoryTheory.Functor.whiskeringLeft (CategoryTheory.Discrete PUnit.{1} Γ C) (C Γ C) V).obj ((CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).prod (CategoryTheory.Functor.id C))).comp (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.MonoidalCategory.externalProduct (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V)) F))))).obj X) (Xβ : C) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitorCorepresentingIso F).hom.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor (F.obj Xβ)).inv (((CategoryTheory.CategoryStruct.comp (CategoryTheory.prod.leftUnitorEquivalence C).congrLeft.fullyFaithfulFunctor.homEquiv.toIso.hom (TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft C C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.leftUnitor x) β―).hom).app X))).hom' aβ).app Xβ) - CategoryTheory.MonoidalCategory.DayConvolutionUnit.rightUnitorCorepresentingIso_hom_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F X : CategoryTheory.Functor C V) (aβ : (((CategoryTheory.Functor.whiskeringLeft (C Γ C) C V).obj (CategoryTheory.MonoidalCategory.tensor C)).comp (((CategoryTheory.Functor.whiskeringLeft (C Γ CategoryTheory.Discrete PUnit.{1}) (C Γ C) V).obj ((CategoryTheory.Functor.id C).prod (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)))).comp (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.MonoidalCategory.externalProduct F (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V))))))).obj X) (Xβ : C) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolutionUnit.rightUnitorCorepresentingIso F).hom.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.rightUnitor (F.obj Xβ)).inv (((CategoryTheory.CategoryStruct.comp (CategoryTheory.prod.rightUnitorEquivalence C).congrLeft.fullyFaithfulFunctor.homEquiv.toIso.hom (TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft C C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.rightUnitor x) β―).hom).app X))).hom' aβ).app Xβ) - CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitorCorepresentingIso_inv_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F X : CategoryTheory.Functor C V) (aβ : (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V), F).2)).obj X) (Xβ : CategoryTheory.Discrete PUnit.{1} Γ C) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolutionUnit.leftUnitorCorepresentingIso F).inv.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor (F.obj Xβ.2)).hom (CategoryTheory.CategoryStruct.comp (F.map ((CategoryTheory.prod.leftUnitorEquivalence C).unit.app Xβ).2) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.leftUnitor (F.obj Xβ.2)).inv (CategoryTheory.CategoryStruct.comp (((CategoryTheory.CategoryStruct.id ((CategoryTheory.prod.leftInverseUnitor C).comp (CategoryTheory.MonoidalCategory.externalProduct (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V)) F) βΆ (CategoryTheory.prod.leftInverseUnitor C).comp (((CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).prod (CategoryTheory.Functor.id C)).comp ((CategoryTheory.MonoidalCategory.tensor C).comp X)))).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft C C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.leftUnitor x) β―).inv).app X)).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp (CategoryTheory.NatIso.ofComponents (fun x => (CategoryTheory.MonoidalCategoryStruct.leftUnitor (F.obj x)).symm) β―).inv g).hom' aβ))).app Xβ.2) (CategoryTheory.CategoryStruct.comp (X.map (CategoryTheory.MonoidalCategoryStruct.leftUnitor Xβ.2).hom) (CategoryTheory.CategoryStruct.comp (X.map ((CategoryTheory.prod.leftUnitorEquivalence C).unitInv.app Xβ).2) (X.map (CategoryTheory.MonoidalCategoryStruct.leftUnitor Xβ.2).inv)))))) - CategoryTheory.MonoidalCategory.DayConvolutionUnit.rightUnitorCorepresentingIso_inv_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F X : CategoryTheory.Functor C V) (aβ : (CategoryTheory.coyoneda.obj (Opposite.op (F, CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V)).1)).obj X) (Xβ : C Γ CategoryTheory.Discrete PUnit.{1}) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolutionUnit.rightUnitorCorepresentingIso F).inv.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.rightUnitor (F.obj Xβ.1)).hom (CategoryTheory.CategoryStruct.comp (F.map ((CategoryTheory.prod.rightUnitorEquivalence C).unit.app Xβ).1) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.rightUnitor (F.obj Xβ.1)).inv (CategoryTheory.CategoryStruct.comp (((CategoryTheory.CategoryStruct.id ((CategoryTheory.prod.rightInverseUnitor C).comp (CategoryTheory.MonoidalCategory.externalProduct F (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit V))) βΆ (CategoryTheory.prod.rightInverseUnitor C).comp (((CategoryTheory.Functor.id C).prod (CategoryTheory.Functor.fromPUnit (CategoryTheory.MonoidalCategoryStruct.tensorUnit C))).comp ((CategoryTheory.MonoidalCategory.tensor C).comp X)))).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft C C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.rightUnitor x) β―).inv).app X)).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp (CategoryTheory.NatIso.ofComponents (fun x => (CategoryTheory.MonoidalCategoryStruct.rightUnitor (F.obj x)).symm) β―).inv g).hom' aβ))).app Xβ.1) (CategoryTheory.CategoryStruct.comp (X.map (CategoryTheory.MonoidalCategoryStruct.rightUnitor Xβ.1).hom) (CategoryTheory.CategoryStruct.comp (X.map ((CategoryTheory.prod.rightUnitorEquivalence C).unitInv.app Xβ).1) (X.map (CategoryTheory.MonoidalCategoryStruct.rightUnitor Xβ.1).inv)))))) - CategoryTheory.MonoidalCategory.DayConvolution.associatorCorepresentingIso_hom_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F G H X : CategoryTheory.Functor C V) (aβ : (((CategoryTheory.Functor.whiskeringLeft (C Γ C) C V).obj (CategoryTheory.MonoidalCategory.tensor C)).comp (((CategoryTheory.Functor.whiskeringLeft ((C Γ C) Γ C) (C Γ C) V).obj ((CategoryTheory.MonoidalCategory.tensor C).prod (CategoryTheory.Functor.id C))).comp (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.MonoidalCategory.externalProduct (CategoryTheory.MonoidalCategory.externalProduct F G) H))))).obj X) (Xβ : C Γ C Γ C) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolution.associatorCorepresentingIso F G H).hom.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator (F.obj Xβ.1) (G.obj Xβ.2.1) (H.obj Xβ.2.2)).inv (((CategoryTheory.CategoryStruct.comp (CategoryTheory.prod.associativity C C C).congrLeft.fullyFaithfulFunctor.homEquiv.toIso.hom (TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft (C Γ C Γ C) C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.associator x.1 x.2.1 x.2.2) β―).hom).app X))).hom' aβ).app Xβ) - CategoryTheory.MonoidalCategory.DayConvolution.associatorCorepresentingIso_inv_app_hom_apply_app π Mathlib.CategoryTheory.Monoidal.DayConvolution
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {V : Type uβ} [CategoryTheory.Category.{vβ, uβ} V] [CategoryTheory.MonoidalCategory C] [CategoryTheory.MonoidalCategory V] (F G H X : CategoryTheory.Functor C V) (aβ : (((CategoryTheory.Functor.whiskeringLeft (C Γ C Γ C) C V).obj (((CategoryTheory.Functor.id C).prod (CategoryTheory.MonoidalCategory.tensor C)).comp (CategoryTheory.MonoidalCategory.tensor C))).comp (CategoryTheory.coyoneda.obj (Opposite.op (CategoryTheory.MonoidalCategory.externalProduct F (CategoryTheory.MonoidalCategory.externalProduct G H))))).obj X) (Xβ : (C Γ C) Γ C) : ((CategoryTheory.ConcreteCategory.hom ((CategoryTheory.MonoidalCategory.DayConvolution.associatorCorepresentingIso F G H).inv.app X)) aβ).app Xβ = CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerRight (CategoryTheory.MonoidalCategoryStruct.whiskerRight (F.map ((CategoryTheory.prod.associativity C C C).unit.app Xβ).1.1) (G.obj Xβ.1.2)) (H.obj Xβ.2)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator (F.obj Xβ.1.1) (G.obj Xβ.1.2) (H.obj Xβ.2)).hom (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft (F.obj Xβ.1.1) (CategoryTheory.MonoidalCategoryStruct.whiskerRight (G.map ((CategoryTheory.prod.associativity C C C).unit.app Xβ).1.2) (H.obj Xβ.2))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.whiskerLeft (F.obj Xβ.1.1) (CategoryTheory.MonoidalCategoryStruct.whiskerLeft (G.obj Xβ.1.2) (H.map ((CategoryTheory.prod.associativity C C C).unit.app Xβ).2))) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.associator (F.obj Xβ.1.1) (G.obj Xβ.1.2) (H.obj Xβ.2)).inv (CategoryTheory.CategoryStruct.comp (((CategoryTheory.CategoryStruct.id ((CategoryTheory.prod.inverseAssociator C C C).comp (CategoryTheory.MonoidalCategory.externalProduct (CategoryTheory.MonoidalCategory.externalProduct F G) H) βΆ (CategoryTheory.prod.inverseAssociator C C C).comp (((CategoryTheory.MonoidalCategory.tensor C).prod (CategoryTheory.Functor.id C)).comp ((CategoryTheory.MonoidalCategory.tensor C).comp X)))).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp g (((CategoryTheory.Functor.whiskeringLeft (C Γ C Γ C) C V).map (CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.MonoidalCategoryStruct.associator x.1 x.2.1 x.2.2) β―).inv).app X)).hom' ((TypeCat.ofHom fun g => CategoryTheory.CategoryStruct.comp (CategoryTheory.NatIso.ofComponents (fun x => (CategoryTheory.MonoidalCategoryStruct.associator (F.obj x.1) (G.obj x.2.1) (H.obj x.2.2)).symm) β―).inv g).hom' aβ))).app (Xβ.1.1, Xβ.1.2, Xβ.2)) (CategoryTheory.CategoryStruct.comp (X.map (CategoryTheory.MonoidalCategoryStruct.associator Xβ.1.1 Xβ.1.2 Xβ.2).hom) (CategoryTheory.CategoryStruct.comp (X.map (CategoryTheory.MonoidalCategoryStruct.tensorHom ((CategoryTheory.prod.associativity C C C).unitInv.app Xβ).1.1 (CategoryTheory.MonoidalCategoryStruct.tensorHom ((CategoryTheory.prod.associativity C C C).unitInv.app Xβ).1.2 ((CategoryTheory.prod.associativity C C C).unitInv.app Xβ).2))) (X.map (CategoryTheory.MonoidalCategoryStruct.associator Xβ.1.1 Xβ.1.2 Xβ.2).inv)))))))) - CategoryTheory.Pseudofunctor.DescentData'.descentDataEquivalence_counitIso π Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cα΅α΅) CategoryTheory.Cat) {ΞΉ : Type t} {S : C} {X : ΞΉ β C} {f : (i : ΞΉ) β X i βΆ S} (sq : (i j : ΞΉ) β CategoryTheory.Limits.ChosenPullback (f i) (f j)) (sqβ : (iβ iβ iβ : ΞΉ) β CategoryTheory.Limits.ChosenPullbackβ (sq iβ iβ) (sq iβ iβ) (sq iβ iβ)) : (CategoryTheory.Pseudofunctor.DescentData'.descentDataEquivalence F sq sqβ).counitIso = CategoryTheory.NatIso.ofComponents (fun D => CategoryTheory.Pseudofunctor.DescentData.isoMk (fun x => CategoryTheory.Iso.refl ((((CategoryTheory.Pseudofunctor.DescentData'.fromDescentDataFunctor F sq sqβ).comp (CategoryTheory.Pseudofunctor.DescentData'.toDescentDataFunctor F sq sqβ)).obj D).obj x)) β―) β― - CategoryTheory.Pseudofunctor.DescentData'.descentDataEquivalence_unitIso π Mathlib.CategoryTheory.Sites.Descent.DescentDataPrime
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Pseudofunctor (CategoryTheory.LocallyDiscrete Cα΅α΅) CategoryTheory.Cat) {ΞΉ : Type t} {S : C} {X : ΞΉ β C} {f : (i : ΞΉ) β X i βΆ S} (sq : (i j : ΞΉ) β CategoryTheory.Limits.ChosenPullback (f i) (f j)) (sqβ : (iβ iβ iβ : ΞΉ) β CategoryTheory.Limits.ChosenPullbackβ (sq iβ iβ) (sq iβ iβ) (sq iβ iβ)) : (CategoryTheory.Pseudofunctor.DescentData'.descentDataEquivalence F sq sqβ).unitIso = CategoryTheory.NatIso.ofComponents (fun D => CategoryTheory.Pseudofunctor.DescentData'.isoMk (fun x => CategoryTheory.Iso.refl (((CategoryTheory.Functor.id (F.DescentData' sq sqβ)).obj D).obj x)) β―) β― - CategoryTheory.Subfunctor.equivalenceMonoOver_unitIso π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).unitIso = CategoryTheory.NatIso.ofComponents (fun A => CategoryTheory.eqToIso β―) β― - CategoryTheory.Subfunctor.equivalenceMonoOver_counitIso π Mathlib.CategoryTheory.Subfunctor.Subobject
{C : Type u} [CategoryTheory.Category.{v, u} C] (F : CategoryTheory.Functor C (Type w)) : (CategoryTheory.Subfunctor.equivalenceMonoOver F).counitIso = CategoryTheory.NatIso.ofComponents (fun X => CategoryTheory.MonoOver.isoMk (CategoryTheory.asIso (CategoryTheory.Subfunctor.toRange X.arrow)).symm β―) β― - Types.monoOverEquivalenceSet_counitIso π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) : (Types.monoOverEquivalenceSet Ξ±).counitIso = CategoryTheory.NatIso.ofComponents (fun x => CategoryTheory.eqToIso β―) β― - Types.monoOverEquivalenceSet_unitIso π Mathlib.CategoryTheory.Subobject.Types
(Ξ± : Type u) : (Types.monoOverEquivalenceSet Ξ±).unitIso = CategoryTheory.NatIso.ofComponents (fun f => CategoryTheory.MonoOver.isoMk (Equiv.ofInjective β(CategoryTheory.ConcreteCategory.hom f.obj.hom) β―).toIso β―) β― - CategoryTheory.Sum.functorEquiv_unitIso π Mathlib.CategoryTheory.Sums.Products
(A : Type u_1) [CategoryTheory.Category.{v_1, u_1} A] (A' : Type u_2) [CategoryTheory.Category.{v_2, u_2} A'] (B : Type u) [CategoryTheory.Category.{v, u} B] : (CategoryTheory.Sum.functorEquiv A A' B).unitIso = CategoryTheory.NatIso.ofComponents (fun F => F.isoSum) β― - CategoryTheory.Sum.functorEquiv_counitIso π Mathlib.CategoryTheory.Sums.Products
(A : Type u_1) [CategoryTheory.Category.{v_1, u_1} A] (A' : Type u_2) [CategoryTheory.Category.{v_2, u_2} A'] (B : Type u) [CategoryTheory.Category.{v, u} B] : (CategoryTheory.Sum.functorEquiv A A' B).counitIso = CategoryTheory.NatIso.ofComponents (fun F => (F.1.inlCompSum' F.2).prod (F.1.inrCompSum' F.2) βͺβ« CategoryTheory.prod.etaIso F) β― - alexDiscEquivPreord_unitIso π Mathlib.Topology.Order.Category.AlexDisc
: alexDiscEquivPreord.unitIso = CategoryTheory.NatIso.ofComponents (fun X => AlexDisc.Iso.mk (id (homeoWithUpperSetTopologyorderIso βX.toTopCat))) @alexDiscEquivPreord._proof_3 - alexDiscEquivPreord_counitIso π Mathlib.Topology.Order.Category.AlexDisc
: alexDiscEquivPreord.counitIso = CategoryTheory.NatIso.ofComponents (fun X => Preord.Iso.mk (id (orderIsoSpecializationWithUpperSetTopology βX).symm)) @alexDiscEquivPreord._proof_4
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
πReal.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
π"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
π_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
πReal.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
π(?a -> ?b) -> List ?a -> List ?b
πList ?a -> (?a -> ?b) -> List ?bBy main conclusion:
π|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of allβandβ) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
π|- _ < _ β tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
β’ (_ : Type _)finds all definitions which provide data whileβ’ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
π Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ β _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59