Loogle!
Result
Found 430 declarations mentioning CategoryTheory.Equivalence.counitIso. Of these, only the first 200 are shown.
- CategoryTheory.Equivalence.counitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Category.{vβ, uβ} D] (self : C β D) : self.inverse.comp self.functor β CategoryTheory.Functor.id D - CategoryTheory.Equivalence.refl_counitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] : CategoryTheory.Equivalence.refl.counitIso = CategoryTheory.Iso.refl ((CategoryTheory.Functor.id C).comp (CategoryTheory.Functor.id C)) - 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.Functor.asEquivalence_counitIso_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.IsEquivalence] (X : D) : F.asEquivalence.counitIso.hom.app X = (F.objObjPreimageIso X).hom - CategoryTheory.Functor.asEquivalence_counitIso_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (F : CategoryTheory.Functor C D) [F.IsEquivalence] (X : D) : F.asEquivalence.counitIso.inv.app X = (F.objObjPreimageIso X).inv - CategoryTheory.Equivalence.ext π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} {D : Type uβ} {instβ : CategoryTheory.Category.{vβ, uβ} C} {instβΒΉ : CategoryTheory.Category.{vβ, uβ} D} {x y : C β D} (functor : x.functor = y.functor) (inverse : x.inverse = y.inverse) (unitIso : x.unitIso β y.unitIso) (counitIso : x.counitIso β y.counitIso) : x = y - CategoryTheory.Equivalence.ext_iff π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} {D : Type uβ} {instβ : CategoryTheory.Category.{vβ, uβ} C} {instβΒΉ : CategoryTheory.Category.{vβ, uβ} D} {x y : C β D} : x = y β x.functor = y.functor β§ x.inverse = y.inverse β§ x.unitIso β y.unitIso β§ x.counitIso β y.counitIso - CategoryTheory.ObjectProperty.fullSubcategoryCongr_counitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {P P' : CategoryTheory.ObjectProperty C} (h : P = P') : (CategoryTheory.ObjectProperty.fullSubcategoryCongr h).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.ObjectProperty.ΞΉOfLE β―).comp (CategoryTheory.ObjectProperty.ΞΉOfLE β―)) - CategoryTheory.Equivalence.changeFunctor_counitIso_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) {G : CategoryTheory.Functor C D} (iso : e.functor β G) (X : D) : (e.changeFunctor iso).counitIso.hom.app X = CategoryTheory.CategoryStruct.comp (iso.inv.app (e.inverse.obj X)) (e.counitIso.hom.app X) - CategoryTheory.Equivalence.changeFunctor_counitIso_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) {G : CategoryTheory.Functor C D} (iso : e.functor β G) (X : D) : (e.changeFunctor iso).counitIso.inv.app X = CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app X) (iso.hom.app (e.inverse.obj X)) - CategoryTheory.Equivalence.counitIso_functor_comp π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) (X : C) : CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app (e.functor.obj X)) (e.functor.map (e.unitIso.inv.app X)) = CategoryTheory.CategoryStruct.id (e.functor.obj X) - CategoryTheory.Equivalence.functor_unitIso_comp π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.Category.{vβ, uβ} D] (self : C β D) (X : C) : CategoryTheory.CategoryStruct.comp (self.functor.map (self.unitIso.hom.app X)) (self.counitIso.hom.app (self.functor.obj X)) = CategoryTheory.CategoryStruct.id (self.functor.obj X) - CategoryTheory.Equivalence.changeInverse_counitIso_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) {G : CategoryTheory.Functor D C} (iso : e.inverse β G) (X : D) : (e.changeInverse iso).counitIso.hom.app X = CategoryTheory.CategoryStruct.comp (e.functor.map (iso.inv.app X)) (e.counitIso.hom.app X) - CategoryTheory.Equivalence.changeInverse_counitIso_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) {G : CategoryTheory.Functor D C} (iso : e.inverse β G) (X : D) : (e.changeInverse iso).counitIso.inv.app X = CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app X) (e.functor.map (iso.hom.app X)) - CategoryTheory.Iso.inverseCompIso_hom_app π Mathlib.CategoryTheory.Equivalence
{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 E} {H : CategoryTheory.Functor D E} {G : C β D} (i : F β G.functor.comp H) (X : D) : i.inverseCompIso.hom.app X = CategoryTheory.CategoryStruct.comp (i.hom.app (G.inverse.obj X)) (H.map (G.counitIso.hom.app X)) - CategoryTheory.Iso.inverseCompIso_inv_app π Mathlib.CategoryTheory.Equivalence
{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 E} {H : CategoryTheory.Functor D E} {G : C β D} (i : F β G.functor.comp H) (X : D) : i.inverseCompIso.inv.app X = CategoryTheory.CategoryStruct.comp (H.map (G.counitIso.inv.app X)) (i.inv.app (G.inverse.obj X)) - CategoryTheory.Iso.isoInverseComp_hom_app π Mathlib.CategoryTheory.Equivalence
{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 E} {H : CategoryTheory.Functor D E} {G : C β D} (i : G.functor.comp H β F) (X : D) : i.isoInverseComp.hom.app X = CategoryTheory.CategoryStruct.comp (H.map (G.counitIso.inv.app X)) (i.hom.app (G.inverse.obj X)) - CategoryTheory.Iso.isoInverseComp_inv_app π Mathlib.CategoryTheory.Equivalence
{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 E} {H : CategoryTheory.Functor D E} {G : C β D} (i : G.functor.comp H β F) (X : D) : i.isoInverseComp.inv.app X = CategoryTheory.CategoryStruct.comp (i.inv.app (G.inverse.obj X)) (H.map (G.counitIso.hom.app X)) - CategoryTheory.Iso.isoInverseOfIsoFunctor_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.functor β G'.functor) (X : D) : i.isoInverseOfIsoFunctor.hom.app X = CategoryTheory.CategoryStruct.comp (G'.unitIso.hom.app (G.inverse.obj X)) (CategoryTheory.CategoryStruct.comp (G'.inverse.map (i.inv.app (G.inverse.obj X))) (G'.inverse.map (G.counitIso.hom.app X))) - CategoryTheory.Iso.isoInverseOfIsoFunctor_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.functor β G'.functor) (X : D) : i.isoInverseOfIsoFunctor.inv.app X = CategoryTheory.CategoryStruct.comp (G'.inverse.map (G.counitIso.inv.app X)) (CategoryTheory.CategoryStruct.comp (G'.inverse.map (i.hom.app (G.inverse.obj X))) (G'.unitIso.inv.app (G.inverse.obj X))) - 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.trans_counitIso π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (e : C β D) (f : D β E) : (e.trans f).counitIso = ((f.inverse.comp e.inverse).associator e.functor f.functor).symm βͺβ« CategoryTheory.Functor.isoWhiskerRight (f.inverse.associator e.inverse e.functor βͺβ« f.inverse.isoWhiskerLeft e.counitIso βͺβ« f.inverse.rightUnitor) f.functor βͺβ« f.counitIso - CategoryTheory.Equivalence.congrLeft_counitIso_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (e : C β D) (X : CategoryTheory.Functor D E) : e.congrLeft.counitIso.hom.app X = (e.invFunIdAssoc X).hom - CategoryTheory.Equivalence.congrLeft_counitIso_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (e : C β D) (X : CategoryTheory.Functor D E) : e.congrLeft.counitIso.inv.app X = (e.invFunIdAssoc X).inv - CategoryTheory.Equivalence.congrRight_counitIso_hom_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (e : C β D) (X : CategoryTheory.Functor E D) : e.congrRight.counitIso.hom.app X = CategoryTheory.CategoryStruct.comp (X.associator e.inverse e.functor).hom (CategoryTheory.CategoryStruct.comp (X.whiskerLeft e.counitIso.hom) X.rightUnitor.hom) - CategoryTheory.Equivalence.congrRight_counitIso_inv_app π Mathlib.CategoryTheory.Equivalence
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (e : C β D) (X : CategoryTheory.Functor E D) : e.congrRight.counitIso.inv.app X = CategoryTheory.CategoryStruct.comp X.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (X.whiskerLeft e.counitIso.inv) (X.associator e.inverse e.functor).inv) - CategoryTheory.opOpEquivalence_counitIso π Mathlib.CategoryTheory.Opposites
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.opOpEquivalence C).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.opOp C).comp (CategoryTheory.unopUnop C)) - CategoryTheory.Equivalence.op_counitIso π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : e.op.counitIso = (CategoryTheory.NatIso.op e.counitIso).symm - CategoryTheory.Equivalence.unop_counitIso π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : Cα΅α΅ β Dα΅α΅) : e.unop.counitIso = (CategoryTheory.NatIso.unop e.counitIso).symm - 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.leftOp_counitIso_hom_app π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β Dα΅α΅) (X : D) : e.leftOp.counitIso.hom.app X = (e.counitIso.inv.app (Opposite.op X)).unop - CategoryTheory.Equivalence.leftOp_counitIso_inv_app π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β Dα΅α΅) (X : D) : e.leftOp.counitIso.inv.app X = (e.counitIso.hom.app (Opposite.op X)).unop - CategoryTheory.Equivalence.rightOp_counitIso_hom_app π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : Cα΅α΅ β D) (X : Dα΅α΅) : e.rightOp.counitIso.hom.app X = (e.counitIso.inv.app (Opposite.unop X)).op - CategoryTheory.Equivalence.rightOp_counitIso_inv_app π Mathlib.CategoryTheory.Opposites
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : Cα΅α΅ β D) (X : Dα΅α΅) : e.rightOp.counitIso.inv.app X = (e.counitIso.hom.app (Opposite.unop X)).op - CategoryTheory.Functor.leftOpRightOpEquiv_counitIso_hom_app_app π Mathlib.CategoryTheory.Opposites
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (X : CategoryTheory.Functor C Dα΅α΅) (Xβ : C) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).counitIso.hom.app X).app Xβ = CategoryTheory.CategoryStruct.id (X.obj Xβ) - CategoryTheory.Functor.leftOpRightOpEquiv_counitIso_inv_app_app π Mathlib.CategoryTheory.Opposites
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] (X : CategoryTheory.Functor C Dα΅α΅) (Xβ : C) : ((CategoryTheory.Functor.leftOpRightOpEquiv C D).counitIso.inv.app X).app Xβ = CategoryTheory.CategoryStruct.id (X.obj Xβ) - CategoryTheory.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.Prod.braiding_counitIso π Mathlib.CategoryTheory.Products.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (D : Type uβ) [CategoryTheory.Category.{vβ, uβ} D] : (CategoryTheory.Prod.braiding C D).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.Prod.swap D C).comp (CategoryTheory.Prod.swap C D)) - CategoryTheory.Equivalence.prod_counitIso π Mathlib.CategoryTheory.Products.Basic
{A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (Eβ : A β B) (Eβ : C β D) : (Eβ.prod Eβ).counitIso = CategoryTheory.NatIso.prod Eβ.counitIso Eβ.counitIso - CategoryTheory.functorProdFunctorEquiv_counitIso π Mathlib.CategoryTheory.Products.Basic
(A : Type uβ) [CategoryTheory.Category.{vβ, uβ} A] (B : Type uβ) [CategoryTheory.Category.{vβ, uβ} B] (C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.functorProdFunctorEquiv A B C).counitIso = CategoryTheory.functorProdFunctorEquivCounitIso A B C - CategoryTheory.prodOpEquiv_counitIso_hom_app π Mathlib.CategoryTheory.Products.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : Cα΅α΅ Γ Dα΅α΅) : (CategoryTheory.prodOpEquiv C).counitIso.hom.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - CategoryTheory.prodOpEquiv_counitIso_inv_app π Mathlib.CategoryTheory.Products.Basic
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (X : Cα΅α΅ Γ Dα΅α΅) : (CategoryTheory.prodOpEquiv C).counitIso.inv.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - CategoryTheory.Equivalence.pi_counitIso π Mathlib.CategoryTheory.Pi.Basic
{I : Type wβ} {C : I β Type uβ} [(i : I) β CategoryTheory.Category.{vβ, uβ} (C i)] {D : I β Type uβ} [(i : I) β CategoryTheory.Category.{vβ, uβ} (D i)] (E : (i : I) β C i β D i) : (CategoryTheory.Equivalence.pi E).counitIso = CategoryTheory.NatIso.pi fun i => (E i).counitIso - CategoryTheory.Pi.optionEquivalence_counitIso π Mathlib.CategoryTheory.Pi.Basic
{J : Type wβ} (C' : Option J β Type uβ) [(i : Option J) β CategoryTheory.Category.{vβ, uβ} (C' i)] : (CategoryTheory.Pi.optionEquivalence C').counitIso = CategoryTheory.Iso.refl ((CategoryTheory.Functor.pi' fun i => match i with | none => CategoryTheory.Prod.fst (C' none) ((j : J) β C' (some j)) | some i => (CategoryTheory.Prod.snd (C' none) ((j : J) β C' (some j))).comp (CategoryTheory.Pi.eval (fun j => C' (some j)) i)).comp ((CategoryTheory.Pi.eval C' none).prod' (CategoryTheory.Functor.pi' fun i => CategoryTheory.Pi.eval C' (some i)))) - CategoryTheory.Pi.equivalenceOfEquiv_counitIso π Mathlib.CategoryTheory.Pi.Basic
{I : Type wβ} {J : Type wβ} (C : I β Type uβ) [(i : I) β CategoryTheory.Category.{vβ, uβ} (C i)] (e : J β I) : (CategoryTheory.Pi.equivalenceOfEquiv C e).counitIso = CategoryTheory.NatIso.pi' fun i => ((CategoryTheory.Functor.pi' fun i' => CategoryTheory.Pi.eval C (e i')).associator (CategoryTheory.Pi.eval (fun j => C (e j)) (e.symm i)) (CategoryTheory.Pi.eqToEquivalence C β―).functor).symm βͺβ« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.Functor.pi'CompEval (fun i' => CategoryTheory.Pi.eval C (e i')) (e.symm i)) (CategoryTheory.Pi.eqToEquivalence C β―).functor βͺβ« CategoryTheory.Pi.evalCompEqToEquivalenceFunctor C β― βͺβ« (CategoryTheory.Pi.eval C i).leftUnitor.symm - CategoryTheory.Discrete.equivalence_counitIso π Mathlib.CategoryTheory.Discrete.Basic
{I : Type uβ} {J : Type uβ} (e : I β J) : (CategoryTheory.Discrete.equivalence e).counitIso = CategoryTheory.Discrete.natIso fun j => 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.prod.leftUnitorEquivalence_counitIso π Mathlib.CategoryTheory.Products.Unitor
(C : Type u) [CategoryTheory.Category.{v, u} C] : (CategoryTheory.prod.leftUnitorEquivalence C).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.prod.leftInverseUnitor C).comp (CategoryTheory.prod.leftUnitor C)) - CategoryTheory.prod.rightUnitorEquivalence_counitIso π Mathlib.CategoryTheory.Products.Unitor
(C : Type u) [CategoryTheory.Category.{v, u} C] : (CategoryTheory.prod.rightUnitorEquivalence C).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.prod.rightInverseUnitor C).comp (CategoryTheory.prod.rightUnitor C)) - CategoryTheory.Comma.equivProd_counitIso_hom_app π Mathlib.CategoryTheory.Comma.Basic
{A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] (L : CategoryTheory.Functor A (CategoryTheory.Discrete PUnit.{u_1 + 1})) (R : CategoryTheory.Functor B (CategoryTheory.Discrete PUnit.{u_1 + 1})) (X : A Γ B) : (CategoryTheory.Comma.equivProd L R).counitIso.hom.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - CategoryTheory.Comma.equivProd_counitIso_inv_app π Mathlib.CategoryTheory.Comma.Basic
{A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] (L : CategoryTheory.Functor A (CategoryTheory.Discrete PUnit.{u_1 + 1})) (R : CategoryTheory.Functor B (CategoryTheory.Discrete PUnit.{u_1 + 1})) (X : A Γ B) : (CategoryTheory.Comma.equivProd L R).counitIso.inv.app X = CategoryTheory.Prod.mkHom (CategoryTheory.CategoryStruct.id X.1) (CategoryTheory.CategoryStruct.id X.2) - CategoryTheory.Comma.mapLeftIso_counitIso_hom_app_left π 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] (R : CategoryTheory.Functor B T) {Lβ Lβ : CategoryTheory.Functor A T} (i : Lβ β Lβ) (X : CategoryTheory.Comma Lβ R) : ((CategoryTheory.Comma.mapLeftIso R i).counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.mapLeftIso_counitIso_hom_app_right π 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] (R : CategoryTheory.Functor B T) {Lβ Lβ : CategoryTheory.Functor A T} (i : Lβ β Lβ) (X : CategoryTheory.Comma Lβ R) : ((CategoryTheory.Comma.mapLeftIso R i).counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.Comma.mapLeftIso_counitIso_inv_app_left π 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] (R : CategoryTheory.Functor B T) {Lβ Lβ : CategoryTheory.Functor A T} (i : Lβ β Lβ) (X : CategoryTheory.Comma Lβ R) : ((CategoryTheory.Comma.mapLeftIso R i).counitIso.inv.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.mapLeftIso_counitIso_inv_app_right π 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] (R : CategoryTheory.Functor B T) {Lβ Lβ : CategoryTheory.Functor A T} (i : Lβ β Lβ) (X : CategoryTheory.Comma Lβ R) : ((CategoryTheory.Comma.mapLeftIso R i).counitIso.inv.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.Comma.mapRightIso_counitIso_hom_app_left π Mathlib.CategoryTheory.Comma.Basic
{B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) {Rβ Rβ : CategoryTheory.Functor B T} (i : Rβ β Rβ) (X : CategoryTheory.Comma L Rβ) : ((CategoryTheory.Comma.mapRightIso L i).counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.mapRightIso_counitIso_hom_app_right π Mathlib.CategoryTheory.Comma.Basic
{B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) {Rβ Rβ : CategoryTheory.Functor B T} (i : Rβ β Rβ) (X : CategoryTheory.Comma L Rβ) : ((CategoryTheory.Comma.mapRightIso L i).counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.Comma.mapRightIso_counitIso_inv_app_left π Mathlib.CategoryTheory.Comma.Basic
{B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) {Rβ Rβ : CategoryTheory.Functor B T} (i : Rβ β Rβ) (X : CategoryTheory.Comma L Rβ) : ((CategoryTheory.Comma.mapRightIso L i).counitIso.inv.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.Comma.mapRightIso_counitIso_inv_app_right π Mathlib.CategoryTheory.Comma.Basic
{B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (L : CategoryTheory.Functor A T) {Rβ Rβ : CategoryTheory.Functor B T} (i : Rβ β Rβ) (X : CategoryTheory.Comma L Rβ) : ((CategoryTheory.Comma.mapRightIso L i).counitIso.inv.app X).right = CategoryTheory.CategoryStruct.id X.right - 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.Functor.mapArrowEquivalence_counitIso π Mathlib.CategoryTheory.Comma.Arrow
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] (e : C β D) : (CategoryTheory.Functor.mapArrowEquivalence e).counitIso = (CategoryTheory.Functor.mapArrowFunctor D D).mapIso e.counitIso - 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)) β― - AddMonCat.equivalence_counitIso π Mathlib.Algebra.Category.MonCat.Basic
: AddMonCat.equivalence.counitIso = CategoryTheory.Iso.refl ({ obj := fun X => AddMonCat.of (Additive βX), map := fun {X Y} f => AddMonCat.ofHom (MonoidHom.toAdditive (MonCat.Hom.hom f)), map_id := AddMonCat.equivalence._proof_3, map_comp := @AddMonCat.equivalence._proof_4 }.comp { obj := fun X => MonCat.of (Multiplicative βX), map := fun {X Y} f => MonCat.ofHom (AddMonoidHom.toMultiplicative (AddMonCat.Hom.hom f)), map_id := AddMonCat.equivalence._proof_1, map_comp := @AddMonCat.equivalence._proof_2 }) - AddCommMonCat.equivalence_counitIso π Mathlib.Algebra.Category.MonCat.Basic
: AddCommMonCat.equivalence.counitIso = CategoryTheory.Iso.refl ({ obj := fun X => AddCommMonCat.of (Additive βX), map := fun {X Y} f => AddCommMonCat.ofHom (MonoidHom.toAdditive (CommMonCat.Hom.hom f)), map_id := AddCommMonCat.equivalence._proof_3, map_comp := @AddCommMonCat.equivalence._proof_4 }.comp { obj := fun X => CommMonCat.of (Multiplicative βX), map := fun {X Y} f => CommMonCat.ofHom (AddMonoidHom.toMultiplicative (AddCommMonCat.Hom.hom f)), map_id := AddCommMonCat.equivalence._proof_1, map_comp := @AddCommMonCat.equivalence._proof_2 }) - CategoryTheory.Adjunction.toEquivalence_counitIso_hom_app π Mathlib.CategoryTheory.Adjunction.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F β£ G) [β (X : C), CategoryTheory.IsIso (adj.unit.app X)] [β (Y : D), CategoryTheory.IsIso (adj.counit.app Y)] (X : D) : adj.toEquivalence.counitIso.hom.app X = adj.counit.app X - CategoryTheory.Adjunction.toEquivalence_counitIso_inv_app π Mathlib.CategoryTheory.Adjunction.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {F : CategoryTheory.Functor C D} {G : CategoryTheory.Functor D C} (adj : F β£ G) [β (X : C), CategoryTheory.IsIso (adj.unit.app X)] [β (Y : D), CategoryTheory.IsIso (adj.counit.app Y)] (X : D) : adj.toEquivalence.counitIso.inv.app X = CategoryTheory.inv (adj.counit.app X) - CategoryTheory.Limits.Cocone.precomposeEquivalence_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.Cocone.precomposeEquivalence Ξ±).counitIso = CategoryTheory.NatIso.ofComponents' (fun s => CategoryTheory.Limits.Cocone.extInv (CategoryTheory.Iso.refl (((CategoryTheory.Limits.Cocone.precompose Ξ±.hom).comp (CategoryTheory.Limits.Cocone.precompose Ξ±.inv)).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.Cocone.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.Cocone.whiskeringEquivalence e).counitIso = CategoryTheory.NatIso.ofComponents' (fun s => CategoryTheory.Limits.Cocone.extInv (CategoryTheory.Iso.refl ((((CategoryTheory.Limits.Cocone.whiskering e.inverse).comp (CategoryTheory.Limits.Cocone.precompose (e.invFunIdAssoc F).inv)).comp (CategoryTheory.Limits.Cocone.whiskering e.functor)).obj s).pt) β―) β― - 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.Cocone.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.Cocone.functorialityEquivalence F e).counitIso = CategoryTheory.NatIso.ofComponents' (fun c => CategoryTheory.Limits.Cocone.extInv (e.counitIso.app c.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.coneOpEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J C} : CategoryTheory.Limits.coneOpEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op c.unop, map := fun {X Y} f => Opposite.op { hom := f.hom.unop, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => (Opposite.unop c).op, map := fun {X Y} f => { hom := f.unop.hom.op, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coconeLeftOpOfConeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J Cα΅α΅} : CategoryTheory.Limits.coconeLeftOpOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeLeftOp c), map := fun {X Y} f => Opposite.op { hom := f.hom.op, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coconeLeftOpOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.unop, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coconeRightOpOfConeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor Jα΅α΅ C} : CategoryTheory.Limits.coconeRightOpOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeRightOp c), map := fun {X Y} f => Opposite.op { hom := f.hom.unop, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coconeRightOpOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.op, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coconeUnopOfConeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor Jα΅α΅ Cα΅α΅} : CategoryTheory.Limits.coconeUnopOfConeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coneOfCoconeUnop c), map := fun {X Y} f => Opposite.op { hom := f.hom.op, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coconeUnopOfCone (Opposite.unop c), map := fun {X Y} f => { hom := f.unop.hom.unop, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coconeOpEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J C} : CategoryTheory.Limits.coconeOpEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op c.unop, map := fun {Y X} f => Opposite.op { hom := f.hom.unop, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => (Opposite.unop c).op, map := fun {Y X} f => { hom := f.unop.hom.op, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coneLeftOpOfCoconeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor J Cα΅α΅} : CategoryTheory.Limits.coneLeftOpOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeLeftOp c), map := fun {Y X} f => Opposite.op { hom := f.hom.op, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coneLeftOpOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.unop, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coneRightOpOfCoconeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor Jα΅α΅ C} : CategoryTheory.Limits.coneRightOpOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeRightOp c), map := fun {Y X} f => Opposite.op { hom := f.hom.unop, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coneRightOpOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.op, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.coneUnopOfCoconeEquiv_counitIso π Mathlib.CategoryTheory.Limits.Cones
{J : Type uβ} [CategoryTheory.Category.{vβ, uβ} J] {C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {F : CategoryTheory.Functor Jα΅α΅ Cα΅α΅} : CategoryTheory.Limits.coneUnopOfCoconeEquiv.counitIso = CategoryTheory.Iso.refl ({ obj := fun c => Opposite.op (CategoryTheory.Limits.coconeOfConeUnop c), map := fun {Y X} f => Opposite.op { hom := f.hom.op, w := β― }, map_id := β―, map_comp := β― }.comp { obj := fun c => CategoryTheory.Limits.coneUnopOfCocone (Opposite.unop c), map := fun {Y X} f => { hom := f.unop.hom.unop, w := β― }, map_id := β―, map_comp := β― }) - CategoryTheory.Limits.Cocone.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.Cocone.equivalenceOfReindexing e Ξ±).counitIso = (((CategoryTheory.Limits.Cocone.precompose Ξ±.hom).comp ((CategoryTheory.Limits.Cocone.whiskering e.inverse).comp (CategoryTheory.Limits.Cocone.precompose (e.invFunIdAssoc F).inv))).associator (CategoryTheory.Limits.Cocone.whiskering e.functor) (CategoryTheory.Limits.Cocone.precompose Ξ±.inv)).symm βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cocone.precompose Ξ±.hom).associator ((CategoryTheory.Limits.Cocone.whiskering e.inverse).comp (CategoryTheory.Limits.Cocone.precompose (e.invFunIdAssoc F).inv)) (CategoryTheory.Limits.Cocone.whiskering e.functor)) (CategoryTheory.Limits.Cocone.precompose Ξ±.inv) βͺβ« CategoryTheory.Functor.isoWhiskerRight ((CategoryTheory.Limits.Cocone.precompose Ξ±.hom).isoWhiskerLeft (CategoryTheory.NatIso.ofComponents' (fun s => CategoryTheory.Limits.Cocone.extInv (CategoryTheory.Iso.refl s.pt) β―) β―)) (CategoryTheory.Limits.Cocone.precompose Ξ±.inv) βͺβ« CategoryTheory.Functor.isoWhiskerRight (CategoryTheory.Limits.Cocone.precompose Ξ±.hom).rightUnitor (CategoryTheory.Limits.Cocone.precompose Ξ±.inv) βͺβ« CategoryTheory.NatIso.ofComponents' (fun s => CategoryTheory.Limits.Cocone.extInv (CategoryTheory.Iso.refl s.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.IsColimit.ofCoconeEquiv_symm_apply_desc π 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} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {G : CategoryTheory.Functor K D} (h : CategoryTheory.Limits.Cocone G β CategoryTheory.Limits.Cocone F) {c : CategoryTheory.Limits.Cocone G} (P : CategoryTheory.Limits.IsColimit c) (s : CategoryTheory.Limits.Cocone F) : ((CategoryTheory.Limits.IsColimit.ofCoconeEquiv h).symm P).desc s = CategoryTheory.CategoryStruct.comp (h.functor.map (P.descCoconeMorphism (h.inverse.obj s))).hom (h.counitIso.hom.app s).hom - CategoryTheory.Limits.IsLimit.ofConeEquiv_symm_apply_desc π 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} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {G : CategoryTheory.Functor K D} (h : CategoryTheory.Limits.Cone G β CategoryTheory.Limits.Cone F) {c : CategoryTheory.Limits.Cone G} (P : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone F) : ((CategoryTheory.Limits.IsLimit.ofConeEquiv h).symm P).lift s = CategoryTheory.CategoryStruct.comp (h.counitIso.inv.app s).hom (h.functor.map (P.liftConeMorphism (h.inverse.obj s))).hom - CategoryTheory.Limits.IsLimit.ofConeEquiv_symm_apply_lift π 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} {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {G : CategoryTheory.Functor K D} (h : CategoryTheory.Limits.Cone G β CategoryTheory.Limits.Cone F) {c : CategoryTheory.Limits.Cone G} (P : CategoryTheory.Limits.IsLimit c) (s : CategoryTheory.Limits.Cone F) : ((CategoryTheory.Limits.IsLimit.ofConeEquiv h).symm P).lift s = CategoryTheory.CategoryStruct.comp (h.counitIso.inv.app s).hom (h.functor.map (P.liftConeMorphism (h.inverse.obj s))).hom - CategoryTheory.ULift.equivalence_counitIso_inv_app π Mathlib.CategoryTheory.Category.ULift
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (xβ : ULift.{uβ, uβ} C) : CategoryTheory.ULift.equivalence.counitIso.inv.app xβ = CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id (ULift.{uβ, uβ} C)).obj xβ) - 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 β―) β― - CategoryTheory.ULift.equivalence_counitIso_hom_app π Mathlib.CategoryTheory.Category.ULift
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] (xβ : ULift.{uβ, uβ} C) : CategoryTheory.ULift.equivalence.counitIso.hom.app xβ = CategoryTheory.CategoryStruct.id ((CategoryTheory.ULift.downFunctor.comp CategoryTheory.ULift.upFunctor).obj xβ) - 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 β―) β― - CategoryTheory.orderDualEquivalence_counitIso π Mathlib.CategoryTheory.Category.Preorder
(X : Type u) [Preorder X] : (CategoryTheory.orderDualEquivalence X).counitIso = CategoryTheory.Iso.refl ({ obj := fun x => OrderDual.toDual (Opposite.unop x), map := fun {X_1 Y} f => CategoryTheory.homOfLE β―, map_id := β―, map_comp := β― }.comp { obj := fun x => Opposite.op (OrderDual.ofDual x), map := fun {X_1 Y} f => (CategoryTheory.homOfLE β―).op, map_id := β―, map_comp := β― }) - OrderHom.equivalenceFunctor_counitIso_hom_app_app π Mathlib.CategoryTheory.Category.Preorder
{X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (Xβ : CategoryTheory.Functor X Y) (XβΒΉ : X) : (OrderHom.equivalenceFunctor.counitIso.hom.app Xβ).app XβΒΉ = CategoryTheory.CategoryStruct.id (Xβ.obj XβΒΉ) - OrderHom.equivalenceFunctor_counitIso_inv_app_app π Mathlib.CategoryTheory.Category.Preorder
{X : Type u} {Y : Type v} [Preorder X] [Preorder Y] (Xβ : CategoryTheory.Functor X Y) (XβΒΉ : X) : (OrderHom.equivalenceFunctor.counitIso.inv.app Xβ).app XβΒΉ = CategoryTheory.CategoryStruct.id (Xβ.obj XβΒΉ) - CategoryTheory.Cat.isoOfEquiv π Mathlib.CategoryTheory.Category.Cat
{C D : CategoryTheory.Cat} (e : βC β βD) (hβ : β (X : βC), e.inverse.obj (e.functor.obj X) = X) (hβ : β (Y : βD), e.functor.obj (e.inverse.obj Y) = Y) (hβ : β (X : βC), e.unitIso.hom.app X = CategoryTheory.eqToHom β― := by cat_disch) (hβ : β (Y : βD), e.counitIso.hom.app Y = CategoryTheory.eqToHom β― := by cat_disch) : C β D - CategoryTheory.Cat.isoOfEquiv_hom π Mathlib.CategoryTheory.Category.Cat
{C D : CategoryTheory.Cat} (e : βC β βD) (hβ : β (X : βC), e.inverse.obj (e.functor.obj X) = X) (hβ : β (Y : βD), e.functor.obj (e.inverse.obj Y) = Y) (hβ : β (X : βC), e.unitIso.hom.app X = CategoryTheory.eqToHom β― := by cat_disch) (hβ : β (Y : βD), e.counitIso.hom.app Y = CategoryTheory.eqToHom β― := by cat_disch) : (CategoryTheory.Cat.isoOfEquiv e hβ hβ hβ hβ).hom = e.functor.toCatHom - CategoryTheory.Cat.isoOfEquiv_inv π Mathlib.CategoryTheory.Category.Cat
{C D : CategoryTheory.Cat} (e : βC β βD) (hβ : β (X : βC), e.inverse.obj (e.functor.obj X) = X) (hβ : β (Y : βD), e.functor.obj (e.inverse.obj Y) = Y) (hβ : β (X : βC), e.unitIso.hom.app X = CategoryTheory.eqToHom β― := by cat_disch) (hβ : β (Y : βD), e.counitIso.hom.app Y = CategoryTheory.eqToHom β― := by cat_disch) : (CategoryTheory.Cat.isoOfEquiv e hβ hβ hβ hβ).inv = e.inverse.toCatHom - CategoryTheory.skeletonEquivalence_counitIso π Mathlib.CategoryTheory.Skeletal
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.skeletonEquivalence C).counitIso = CategoryTheory.NatIso.ofComponents CategoryTheory.fromSkeletonToSkeletonIso β― - 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.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.mapNatIso_counitIso_hom_app_left π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S S' : CategoryTheory.Functor C D} (i : S β S') (X : CategoryTheory.Comma S' (CategoryTheory.Functor.fromPUnit T)) : ((CategoryTheory.CostructuredArrow.mapNatIso i).counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.CostructuredArrow.mapNatIso_counitIso_inv_app_left π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S S' : CategoryTheory.Functor C D} (i : S β S') (X : CategoryTheory.Comma S' (CategoryTheory.Functor.fromPUnit T)) : ((CategoryTheory.CostructuredArrow.mapNatIso i).counitIso.inv.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.StructuredArrow.mapNatIso_counitIso_hom_app_right π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {S : D} {T T' : CategoryTheory.Functor C D} (i : T β T') (X : CategoryTheory.Comma (CategoryTheory.Functor.fromPUnit S) T') : ((CategoryTheory.StructuredArrow.mapNatIso i).counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.StructuredArrow.mapNatIso_counitIso_inv_app_right π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {S : D} {T T' : CategoryTheory.Functor C D} (i : T β T') (X : CategoryTheory.Comma (CategoryTheory.Functor.fromPUnit S) T') : ((CategoryTheory.StructuredArrow.mapNatIso i).counitIso.inv.app X).right = CategoryTheory.CategoryStruct.id X.right - 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.mapIso_counitIso_hom_app_left π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T T' : D} {S : CategoryTheory.Functor C D} (i : T β T') (X : CategoryTheory.Comma S (CategoryTheory.Functor.fromPUnit T')) : ((CategoryTheory.CostructuredArrow.mapIso i).counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.CostructuredArrow.mapIso_counitIso_inv_app_left π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T T' : D} {S : CategoryTheory.Functor C D} (i : T β T') (X : CategoryTheory.Comma S (CategoryTheory.Functor.fromPUnit T')) : ((CategoryTheory.CostructuredArrow.mapIso i).counitIso.inv.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.StructuredArrow.mapIso_counitIso_hom_app_right π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {S S' : D} {T : CategoryTheory.Functor C D} (i : S β S') (X : CategoryTheory.Comma (CategoryTheory.Functor.fromPUnit S') T) : ((CategoryTheory.StructuredArrow.mapIso i).counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.StructuredArrow.mapIso_counitIso_inv_app_right π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {S S' : D} {T : CategoryTheory.Functor C D} (i : S β S') (X : CategoryTheory.Comma (CategoryTheory.Functor.fromPUnit S') T) : ((CategoryTheory.StructuredArrow.mapIso i).counitIso.inv.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.CostructuredArrow.mapβIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S : CategoryTheory.Functor C D} {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {U : CategoryTheory.Functor A B} {V : B} {F : C β A} {G : D β B} (Ξ± : F.functor.comp U βΆ S.comp G.functor) (Ξ±' : F.inverse.comp S βΆ U.comp G.inverse) (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp S.leftUnitor.hom (CategoryTheory.CategoryStruct.comp S.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (S.whiskerLeft G.unitIso.hom) (S.associator G.functor G.inverse).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom S) (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.Functor.whiskerRight Ξ± G.inverse))))) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (CategoryTheory.CategoryStruct.comp (U.associator G.inverse G.functor).hom (U.whiskerLeft G.counitIso.hom)))) = CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.counitIso.hom U) (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv))) (Ξ² : G.functor.obj T βΆ V) (Ξ²' : G.inverse.obj V βΆ T) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²' = G.unitIso.inv.app T) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ² = G.counitIso.hom.app V) : CategoryTheory.CostructuredArrow S T β CategoryTheory.CostructuredArrow U V - CategoryTheory.StructuredArrow.mapβIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {L : D} {R : CategoryTheory.Functor C D} {L' : B} {R' : CategoryTheory.Functor A B} {F : C β A} {G : D β B} (Ξ± : L' βΆ G.functor.obj L) (Ξ±' : L βΆ G.inverse.obj L') (Ξ² : R.comp G.functor βΆ F.functor.comp R') (Ξ²' : R'.comp G.inverse βΆ F.inverse.comp R) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±') = G.counitIso.inv.app L') (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±) = G.unitIso.hom.app L) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp R.rightUnitor.hom (CategoryTheory.CategoryStruct.comp R.leftUnitor.inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom R) (F.functor.associator F.inverse R).hom)) = CategoryTheory.CategoryStruct.comp (R.whiskerLeft G.unitIso.hom) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (F.functor.whiskerLeft Ξ²'))))) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor R').inv (CategoryTheory.Functor.whiskerRight F.counitIso.hom R')))) = CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).hom (CategoryTheory.CategoryStruct.comp (R'.whiskerLeft G.counitIso.hom) (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv))) : CategoryTheory.StructuredArrow L R β CategoryTheory.StructuredArrow L' R' - CategoryTheory.CostructuredArrow.mapβIso_functor π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S : CategoryTheory.Functor C D} {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {U : CategoryTheory.Functor A B} {V : B} {F : C β A} {G : D β B} (Ξ± : F.functor.comp U βΆ S.comp G.functor) (Ξ±' : F.inverse.comp S βΆ U.comp G.inverse) (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp S.leftUnitor.hom (CategoryTheory.CategoryStruct.comp S.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (S.whiskerLeft G.unitIso.hom) (S.associator G.functor G.inverse).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom S) (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.Functor.whiskerRight Ξ± G.inverse))))) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (CategoryTheory.CategoryStruct.comp (U.associator G.inverse G.functor).hom (U.whiskerLeft G.counitIso.hom)))) = CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.counitIso.hom U) (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv))) (Ξ² : G.functor.obj T βΆ V) (Ξ²' : G.inverse.obj V βΆ T) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²' = G.unitIso.inv.app T) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ² = G.counitIso.hom.app V) : (CategoryTheory.CostructuredArrow.mapβIso Ξ± Ξ±' hΞ±'Ξ± hΞ±Ξ±' Ξ² Ξ²' hΞ²Ξ²' hΞ²'Ξ²).functor = CategoryTheory.CostructuredArrow.mapβ Ξ± Ξ² - CategoryTheory.CostructuredArrow.mapβIso_inverse π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S : CategoryTheory.Functor C D} {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {U : CategoryTheory.Functor A B} {V : B} {F : C β A} {G : D β B} (Ξ± : F.functor.comp U βΆ S.comp G.functor) (Ξ±' : F.inverse.comp S βΆ U.comp G.inverse) (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp S.leftUnitor.hom (CategoryTheory.CategoryStruct.comp S.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (S.whiskerLeft G.unitIso.hom) (S.associator G.functor G.inverse).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom S) (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.Functor.whiskerRight Ξ± G.inverse))))) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (CategoryTheory.CategoryStruct.comp (U.associator G.inverse G.functor).hom (U.whiskerLeft G.counitIso.hom)))) = CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.counitIso.hom U) (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv))) (Ξ² : G.functor.obj T βΆ V) (Ξ²' : G.inverse.obj V βΆ T) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²' = G.unitIso.inv.app T) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ² = G.counitIso.hom.app V) : (CategoryTheory.CostructuredArrow.mapβIso Ξ± Ξ±' hΞ±'Ξ± hΞ±Ξ±' Ξ² Ξ²' hΞ²Ξ²' hΞ²'Ξ²).inverse = CategoryTheory.CostructuredArrow.mapβ Ξ±' Ξ²' - CategoryTheory.StructuredArrow.mapβIso_functor π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {L : D} {R : CategoryTheory.Functor C D} {L' : B} {R' : CategoryTheory.Functor A B} {F : C β A} {G : D β B} (Ξ± : L' βΆ G.functor.obj L) (Ξ±' : L βΆ G.inverse.obj L') (Ξ² : R.comp G.functor βΆ F.functor.comp R') (Ξ²' : R'.comp G.inverse βΆ F.inverse.comp R) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±') = G.counitIso.inv.app L') (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±) = G.unitIso.hom.app L) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp R.rightUnitor.hom (CategoryTheory.CategoryStruct.comp R.leftUnitor.inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom R) (F.functor.associator F.inverse R).hom)) = CategoryTheory.CategoryStruct.comp (R.whiskerLeft G.unitIso.hom) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (F.functor.whiskerLeft Ξ²'))))) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor R').inv (CategoryTheory.Functor.whiskerRight F.counitIso.hom R')))) = CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).hom (CategoryTheory.CategoryStruct.comp (R'.whiskerLeft G.counitIso.hom) (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv))) : (CategoryTheory.StructuredArrow.mapβIso Ξ± Ξ±' Ξ² Ξ²' hΞ±Ξ±' hΞ±'Ξ± hΞ²Ξ²' hΞ²'Ξ²).functor = CategoryTheory.StructuredArrow.mapβ Ξ± Ξ² - CategoryTheory.StructuredArrow.mapβIso_inverse π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {L : D} {R : CategoryTheory.Functor C D} {L' : B} {R' : CategoryTheory.Functor A B} {F : C β A} {G : D β B} (Ξ± : L' βΆ G.functor.obj L) (Ξ±' : L βΆ G.inverse.obj L') (Ξ² : R.comp G.functor βΆ F.functor.comp R') (Ξ²' : R'.comp G.inverse βΆ F.inverse.comp R) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±') = G.counitIso.inv.app L') (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±) = G.unitIso.hom.app L) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp R.rightUnitor.hom (CategoryTheory.CategoryStruct.comp R.leftUnitor.inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom R) (F.functor.associator F.inverse R).hom)) = CategoryTheory.CategoryStruct.comp (R.whiskerLeft G.unitIso.hom) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (F.functor.whiskerLeft Ξ²'))))) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor R').inv (CategoryTheory.Functor.whiskerRight F.counitIso.hom R')))) = CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).hom (CategoryTheory.CategoryStruct.comp (R'.whiskerLeft G.counitIso.hom) (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv))) : (CategoryTheory.StructuredArrow.mapβIso Ξ± Ξ±' Ξ² Ξ²' hΞ±Ξ±' hΞ±'Ξ± hΞ²Ξ²' hΞ²'Ξ²).inverse = CategoryTheory.StructuredArrow.mapβ Ξ±' Ξ²' - CategoryTheory.StructuredArrow.mapβIso_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {L : D} {R : CategoryTheory.Functor C D} {L' : B} {R' : CategoryTheory.Functor A B} {F : C β A} {G : D β B} (Ξ± : L' βΆ G.functor.obj L) (Ξ±' : L βΆ G.inverse.obj L') (Ξ² : R.comp G.functor βΆ F.functor.comp R') (Ξ²' : R'.comp G.inverse βΆ F.inverse.comp R) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±') = G.counitIso.inv.app L') (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±) = G.unitIso.hom.app L) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp R.rightUnitor.hom (CategoryTheory.CategoryStruct.comp R.leftUnitor.inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom R) (F.functor.associator F.inverse R).hom)) = CategoryTheory.CategoryStruct.comp (R.whiskerLeft G.unitIso.hom) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (F.functor.whiskerLeft Ξ²'))))) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor R').inv (CategoryTheory.Functor.whiskerRight F.counitIso.hom R')))) = CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).hom (CategoryTheory.CategoryStruct.comp (R'.whiskerLeft G.counitIso.hom) (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv))) : (CategoryTheory.StructuredArrow.mapβIso Ξ± Ξ±' Ξ² Ξ²' hΞ±Ξ±' hΞ±'Ξ± hΞ²Ξ²' hΞ²'Ξ²).counitIso = CategoryTheory.StructuredArrow.mapβCompMapβIso Ξ± Ξ² Ξ±' Ξ²' βͺβ« CategoryTheory.StructuredArrow.mapβCongr (CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±')) (CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (F.inverse.associator F.functor R').inv)))) F.counitIso G.counitIso (CategoryTheory.CategoryStruct.id L') (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv) β― β― βͺβ« CategoryTheory.StructuredArrow.mapβIdIso L' (CategoryTheory.CategoryStruct.id L') (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv) β― β― - CategoryTheory.CostructuredArrow.mapβIso_counitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S : CategoryTheory.Functor C D} {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {U : CategoryTheory.Functor A B} {V : B} {F : C β A} {G : D β B} (Ξ± : F.functor.comp U βΆ S.comp G.functor) (Ξ±' : F.inverse.comp S βΆ U.comp G.inverse) (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp S.leftUnitor.hom (CategoryTheory.CategoryStruct.comp S.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (S.whiskerLeft G.unitIso.hom) (S.associator G.functor G.inverse).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom S) (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.Functor.whiskerRight Ξ± G.inverse))))) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (CategoryTheory.CategoryStruct.comp (U.associator G.inverse G.functor).hom (U.whiskerLeft G.counitIso.hom)))) = CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.counitIso.hom U) (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv))) (Ξ² : G.functor.obj T βΆ V) (Ξ²' : G.inverse.obj V βΆ T) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²' = G.unitIso.inv.app T) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ² = G.counitIso.hom.app V) : (CategoryTheory.CostructuredArrow.mapβIso Ξ± Ξ±' hΞ±'Ξ± hΞ±Ξ±' Ξ² Ξ²' hΞ²Ξ²' hΞ²'Ξ²).counitIso = CategoryTheory.CostructuredArrow.mapβCompMapβIso Ξ± Ξ² Ξ±' Ξ²' βͺβ« CategoryTheory.CostructuredArrow.mapβCongr (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (U.associator G.inverse G.functor).hom)))) (CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ²) F.counitIso G.counitIso (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv) (CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id B).obj V)) β― β― βͺβ« CategoryTheory.CostructuredArrow.mapβIdIso (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv) V (CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id B).obj V)) β― β― - CategoryTheory.StructuredArrow.mapβIso_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {L : D} {R : CategoryTheory.Functor C D} {L' : B} {R' : CategoryTheory.Functor A B} {F : C β A} {G : D β B} (Ξ± : L' βΆ G.functor.obj L) (Ξ±' : L βΆ G.inverse.obj L') (Ξ² : R.comp G.functor βΆ F.functor.comp R') (Ξ²' : R'.comp G.inverse βΆ F.inverse.comp R) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp Ξ± (G.functor.map Ξ±') = G.counitIso.inv.app L') (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±) = G.unitIso.hom.app L) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp R.rightUnitor.hom (CategoryTheory.CategoryStruct.comp R.leftUnitor.inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom R) (F.functor.associator F.inverse R).hom)) = CategoryTheory.CategoryStruct.comp (R.whiskerLeft G.unitIso.hom) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (F.functor.whiskerLeft Ξ²'))))) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ²' G.functor) (CategoryTheory.CategoryStruct.comp (F.inverse.associator R G.functor).hom (CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ²) (CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor R').inv (CategoryTheory.Functor.whiskerRight F.counitIso.hom R')))) = CategoryTheory.CategoryStruct.comp (R'.associator G.inverse G.functor).hom (CategoryTheory.CategoryStruct.comp (R'.whiskerLeft G.counitIso.hom) (CategoryTheory.CategoryStruct.comp R'.rightUnitor.hom R'.leftUnitor.inv))) : (CategoryTheory.StructuredArrow.mapβIso Ξ± Ξ±' Ξ² Ξ²' hΞ±Ξ±' hΞ±'Ξ± hΞ²Ξ²' hΞ²'Ξ²).unitIso = (CategoryTheory.StructuredArrow.mapβIdIso L (CategoryTheory.CategoryStruct.id L) (CategoryTheory.CategoryStruct.comp R.rightUnitor.hom R.leftUnitor.inv) β― β―).symm βͺβ« CategoryTheory.StructuredArrow.mapβCongr (CategoryTheory.CategoryStruct.id L) (CategoryTheory.CategoryStruct.comp R.rightUnitor.hom R.leftUnitor.inv) F.unitIso G.unitIso (CategoryTheory.CategoryStruct.comp Ξ±' (G.inverse.map Ξ±)) (CategoryTheory.CategoryStruct.comp (R.associator G.functor G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ² G.inverse) (CategoryTheory.CategoryStruct.comp (F.functor.associator R' G.inverse).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ²') (F.functor.associator F.inverse R).inv)))) β― β― βͺβ« (CategoryTheory.StructuredArrow.mapβCompMapβIso Ξ±' Ξ²' Ξ± Ξ²).symm - CategoryTheory.CostructuredArrow.mapβIso_unitIso π Mathlib.CategoryTheory.Comma.StructuredArrow.Basic
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {T : D} {S : CategoryTheory.Functor C D} {A : Type uβ} [CategoryTheory.Category.{vβ, uβ} A] {B : Type uβ} [CategoryTheory.Category.{vβ, uβ} B] {U : CategoryTheory.Functor A B} {V : B} {F : C β A} {G : D β B} (Ξ± : F.functor.comp U βΆ S.comp G.functor) (Ξ±' : F.inverse.comp S βΆ U.comp G.inverse) (hΞ±'Ξ± : CategoryTheory.CategoryStruct.comp S.leftUnitor.hom (CategoryTheory.CategoryStruct.comp S.rightUnitor.inv (CategoryTheory.CategoryStruct.comp (S.whiskerLeft G.unitIso.hom) (S.associator G.functor G.inverse).inv)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.unitIso.hom S) (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.Functor.whiskerRight Ξ± G.inverse))))) (hΞ±Ξ±' : CategoryTheory.CategoryStruct.comp (F.inverse.whiskerLeft Ξ±) (CategoryTheory.CategoryStruct.comp (F.inverse.associator S G.functor).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ±' G.functor) (CategoryTheory.CategoryStruct.comp (U.associator G.inverse G.functor).hom (U.whiskerLeft G.counitIso.hom)))) = CategoryTheory.CategoryStruct.comp (F.inverse.associator F.functor U).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight F.counitIso.hom U) (CategoryTheory.CategoryStruct.comp U.leftUnitor.hom U.rightUnitor.inv))) (Ξ² : G.functor.obj T βΆ V) (Ξ²' : G.inverse.obj V βΆ T) (hΞ²Ξ²' : CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²' = G.unitIso.inv.app T) (hΞ²'Ξ² : CategoryTheory.CategoryStruct.comp (G.functor.map Ξ²') Ξ² = G.counitIso.hom.app V) : (CategoryTheory.CostructuredArrow.mapβIso Ξ± Ξ±' hΞ±'Ξ± hΞ±Ξ±' Ξ² Ξ²' hΞ²Ξ²' hΞ²'Ξ²).unitIso = (CategoryTheory.CostructuredArrow.mapβIdIso (CategoryTheory.CategoryStruct.comp S.leftUnitor.hom S.rightUnitor.inv) T (CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id D).obj T)) β― β―).symm βͺβ« CategoryTheory.CostructuredArrow.mapβCongr (CategoryTheory.CategoryStruct.comp S.leftUnitor.hom S.rightUnitor.inv) (CategoryTheory.CategoryStruct.id ((CategoryTheory.Functor.id D).obj T)) F.unitIso G.unitIso (CategoryTheory.CategoryStruct.comp (F.functor.associator F.inverse S).hom (CategoryTheory.CategoryStruct.comp (F.functor.whiskerLeft Ξ±') (CategoryTheory.CategoryStruct.comp (F.functor.associator U G.inverse).inv (CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.whiskerRight Ξ± G.inverse) (S.associator G.functor G.inverse).hom)))) (CategoryTheory.CategoryStruct.comp (G.inverse.map Ξ²) Ξ²') β― β― βͺβ« (CategoryTheory.CostructuredArrow.mapβCompMapβIso Ξ±' Ξ²' Ξ± Ξ²).symm - 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.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.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.Over.opEquivOpUnder_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (X : T) : (CategoryTheory.Over.opEquivOpUnder X).counitIso = CategoryTheory.Iso.refl ({ obj := fun Y => CategoryTheory.Over.mk (Opposite.unop Y).hom.op, map := fun {Z Y} f => CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f.unop).op β―, map_id := β―, map_comp := β― }.comp { obj := fun Y => Opposite.op (CategoryTheory.Under.mk Y.hom.unop), map := fun {Z Y} f => Opposite.op (CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f).unop β―), map_id := β―, map_comp := β― }) - CategoryTheory.Under.opEquivOpOver_counitIso π Mathlib.CategoryTheory.Comma.Over.Basic
{T : Type uβ} [CategoryTheory.Category.{vβ, uβ} T] (X : T) : (CategoryTheory.Under.opEquivOpOver X).counitIso = CategoryTheory.Iso.refl ({ obj := fun Y => CategoryTheory.Under.mk (Opposite.unop Y).hom.op, map := fun {Z Y} f => CategoryTheory.Under.homMk (CategoryTheory.Over.Hom.left f.unop).op β―, map_id := β―, map_comp := β― }.comp { obj := fun Y => Opposite.op (CategoryTheory.Over.mk Y.hom.unop), map := fun {Z Y} f => Opposite.op (CategoryTheory.Over.homMk (CategoryTheory.Under.Hom.right f).unop β―), map_id := β―, map_comp := β― }) - CategoryTheory.Limits.widePullbackShapeOpEquiv_counitIso π Mathlib.CategoryTheory.Limits.Shapes.WidePullbacks
(J : Type w) : (CategoryTheory.Limits.widePullbackShapeOpEquiv J).counitIso = CategoryTheory.Limits.widePushoutShapeUnopOp J - CategoryTheory.Limits.widePushoutShapeOpEquiv_counitIso π Mathlib.CategoryTheory.Limits.Shapes.WidePullbacks
(J : Type w) : (CategoryTheory.Limits.widePushoutShapeOpEquiv J).counitIso = CategoryTheory.Limits.widePullbackShapeUnopOp J - CategoryTheory.Limits.walkingCospanOpEquiv_counitIso_hom_app π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
(X : CategoryTheory.Limits.WidePushoutShape CategoryTheory.Limits.WalkingPair) : CategoryTheory.Limits.walkingCospanOpEquiv.counitIso.hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.walkingCospanOpEquiv_counitIso_inv_app π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
(X : CategoryTheory.Limits.WidePushoutShape CategoryTheory.Limits.WalkingPair) : CategoryTheory.Limits.walkingCospanOpEquiv.counitIso.inv.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.walkingSpanOpEquiv_counitIso_hom_app π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
(X : CategoryTheory.Limits.WidePullbackShape CategoryTheory.Limits.WalkingPair) : CategoryTheory.Limits.walkingSpanOpEquiv.counitIso.hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.walkingSpanOpEquiv_counitIso_inv_app π Mathlib.CategoryTheory.Limits.Shapes.Pullback.HasPullback
(X : CategoryTheory.Limits.WidePullbackShape CategoryTheory.Limits.WalkingPair) : CategoryTheory.Limits.walkingSpanOpEquiv.counitIso.inv.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_one π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) = CategoryTheory.Iso.refl (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_zero π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) = CategoryTheory.Iso.refl (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_hom_app_op_one π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.hom.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) = CategoryTheory.CategoryStruct.id (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_hom_app_op_zero π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.hom.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) = CategoryTheory.CategoryStruct.id (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_inv_app_op_one π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.inv.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) = CategoryTheory.CategoryStruct.id (Opposite.op CategoryTheory.Limits.WalkingParallelPair.one) - CategoryTheory.Limits.walkingParallelPairOpEquiv_counitIso_inv_app_op_zero π Mathlib.CategoryTheory.Limits.Shapes.Equalizers
: CategoryTheory.Limits.walkingParallelPairOpEquiv.counitIso.inv.app (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) = CategoryTheory.CategoryStruct.id (Opposite.op CategoryTheory.Limits.WalkingParallelPair.zero) - AlgCat.restrictScalarsEquivalenceOfRingEquiv_counitIso π Mathlib.Algebra.Category.AlgCat.Basic
{R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] (e : R β+* S) : (AlgCat.restrictScalarsEquivalenceOfRingEquiv e).counitIso = (AlgCat.restrictScalarsComp' e.toRingHom e.symm.toRingHom (RingHom.id R) β―).symm βͺβ« AlgCat.restrictScalarsId' (RingHom.id R) β― - AlgCat.intEquivalence_counitIso π Mathlib.Algebra.Category.AlgCat.Basic
: AlgCat.intEquivalence.counitIso = CategoryTheory.Iso.refl ({ obj := fun A => AlgCat.of β€ βA, map := fun {X Y} f => AlgCat.ofHom (RingCat.Hom.hom f).toIntAlgHom, map_id := AlgCat.intEquivalence._proof_1, map_comp := @AlgCat.intEquivalence._proof_2 }.comp (CategoryTheory.forgetβ (AlgCat β€) RingCat)) - CategoryTheory.Functor.currying_counitIso_hom_app_app π Mathlib.CategoryTheory.Functor.Currying
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (X : CategoryTheory.Functor (C Γ D) E) (Xβ : C Γ D) : (CategoryTheory.Functor.currying.counitIso.hom.app X).app Xβ = CategoryTheory.CategoryStruct.id (X.obj (Xβ.1, Xβ.2)) - CategoryTheory.Functor.currying_counitIso_inv_app_app π Mathlib.CategoryTheory.Functor.Currying
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (X : CategoryTheory.Functor (C Γ D) E) (Xβ : C Γ D) : (CategoryTheory.Functor.currying.counitIso.inv.app X).app Xβ = CategoryTheory.CategoryStruct.id (X.obj (Xβ.1, Xβ.2)) - CategoryTheory.Functor.flipping_counitIso_hom_app_app_app π Mathlib.CategoryTheory.Functor.Currying
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (X : CategoryTheory.Functor D (CategoryTheory.Functor C E)) (Xβ : D) (XβΒΉ : C) : ((CategoryTheory.Functor.flipping.counitIso.hom.app X).app Xβ).app XβΒΉ = CategoryTheory.CategoryStruct.id ((X.obj Xβ).obj XβΒΉ) - CategoryTheory.Functor.flipping_counitIso_inv_app_app_app π Mathlib.CategoryTheory.Functor.Currying
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {D : Type uβ} [CategoryTheory.Category.{vβ, uβ} D] {E : Type uβ} [CategoryTheory.Category.{vβ, uβ} E] (X : CategoryTheory.Functor D (CategoryTheory.Functor C E)) (Xβ : D) (XβΒΉ : C) : ((CategoryTheory.Functor.flipping.counitIso.inv.app X).app Xβ).app XβΒΉ = CategoryTheory.CategoryStruct.id ((X.obj Xβ).obj XβΒΉ) - CategoryTheory.Equivalence.functor_map_Ξ΅_inverse_comp_counitIso_hom_app π 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] : CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.LaxMonoidal.Ξ΅ e.inverse)) (e.counitIso.hom.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)) = CategoryTheory.Functor.OplaxMonoidal.Ξ· e.functor - CategoryTheory.Equivalence.counitIso_inv_app_comp_functor_map_Ξ·_inverse π 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] : CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)) (e.functor.map (CategoryTheory.Functor.OplaxMonoidal.Ξ· e.inverse)) = CategoryTheory.Functor.LaxMonoidal.Ξ΅ e.functor - CategoryTheory.Equivalence.counitIso_inv_app_comp_functor_map_Ξ·_inverse_assoc π 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] {Z : D} (h : e.functor.obj (CategoryTheory.MonoidalCategoryStruct.tensorUnit C) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)) (CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.OplaxMonoidal.Ξ· e.inverse)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.Ξ΅ e.functor) h - CategoryTheory.Equivalence.functor_map_Ξ΅_inverse_comp_counitIso_hom_app_assoc π 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] {Z : D} (h : CategoryTheory.MonoidalCategoryStruct.tensorUnit D βΆ Z) : CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.LaxMonoidal.Ξ΅ e.inverse)) (CategoryTheory.CategoryStruct.comp (e.counitIso.hom.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit D)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OplaxMonoidal.Ξ· e.functor) h - CategoryTheory.Equivalence.functor_map_ΞΌ_inverse_comp_counitIso_hom_app_tensor π 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] (X Y : D) : CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.LaxMonoidal.ΞΌ e.inverse X Y)) (e.counitIso.hom.app (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y)) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OplaxMonoidal.Ξ΄ e.functor (e.inverse.obj X) (e.inverse.obj Y)) (CategoryTheory.MonoidalCategoryStruct.tensorHom (e.counitIso.hom.app X) (e.counitIso.hom.app Y)) - CategoryTheory.Equivalence.functor_map_ΞΌ_inverse_comp_counitIso_hom_app_tensor_assoc π 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] (X Y : D) {Z : D} (h : CategoryTheory.MonoidalCategoryStruct.tensorObj X Y βΆ Z) : CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.LaxMonoidal.ΞΌ e.inverse X Y)) (CategoryTheory.CategoryStruct.comp (e.counitIso.hom.app (CategoryTheory.MonoidalCategoryStruct.tensorObj X Y)) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.OplaxMonoidal.Ξ΄ e.functor (e.inverse.obj X) (e.inverse.obj Y)) (CategoryTheory.CategoryStruct.comp (CategoryTheory.MonoidalCategoryStruct.tensorHom (e.counitIso.hom.app X) (e.counitIso.hom.app Y)) h) - CategoryTheory.Equivalence.counitIso_inv_app_tensor_comp_functor_map_Ξ΄_inverse π 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] (X Y : C) : CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app (CategoryTheory.MonoidalCategoryStruct.tensorObj (e.functor.obj X) (e.functor.obj Y))) (e.functor.map (CategoryTheory.Functor.OplaxMonoidal.Ξ΄ e.inverse (e.functor.obj X) (e.functor.obj Y))) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.ΞΌ e.functor X Y) (e.functor.map (CategoryTheory.MonoidalCategoryStruct.tensorHom (e.unitIso.hom.app X) (e.unitIso.hom.app Y))) - CategoryTheory.Equivalence.counitIso_inv_app_tensor_comp_functor_map_Ξ΄_inverse_assoc π 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] (X Y : C) {Z : D} (h : e.functor.obj (CategoryTheory.MonoidalCategoryStruct.tensorObj (e.inverse.obj (e.functor.obj X)) (e.inverse.obj (e.functor.obj Y))) βΆ Z) : CategoryTheory.CategoryStruct.comp (e.counitIso.inv.app (CategoryTheory.MonoidalCategoryStruct.tensorObj (e.functor.obj X) (e.functor.obj Y))) (CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.Functor.OplaxMonoidal.Ξ΄ e.inverse (e.functor.obj X) (e.functor.obj Y))) h) = CategoryTheory.CategoryStruct.comp (CategoryTheory.Functor.LaxMonoidal.ΞΌ e.functor X Y) (CategoryTheory.CategoryStruct.comp (e.functor.map (CategoryTheory.MonoidalCategoryStruct.tensorHom (e.unitIso.hom.app X) (e.unitIso.hom.app Y))) h) - CategoryTheory.Monoidal.transportStruct_rightUnitor π 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) (X : D) : CategoryTheory.MonoidalCategoryStruct.rightUnitor X = e.functor.mapIso (CategoryTheory.MonoidalCategory.whiskerLeftIso (e.inverse.obj X) (e.unitIso.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).symm βͺβ« CategoryTheory.MonoidalCategoryStruct.rightUnitor (e.inverse.obj X)) βͺβ« e.counitIso.app X - CategoryTheory.Monoidal.transportStruct_leftUnitor π 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) (X : D) : CategoryTheory.MonoidalCategoryStruct.leftUnitor X = e.functor.mapIso (CategoryTheory.MonoidalCategory.whiskerRightIso (e.unitIso.app (CategoryTheory.MonoidalCategoryStruct.tensorUnit C)).symm (e.inverse.obj X) βͺβ« CategoryTheory.MonoidalCategoryStruct.leftUnitor (e.inverse.obj X)) βͺβ« e.counitIso.app X - CategoryTheory.MonoidalOpposite.mopEquiv_counitIso π Mathlib.CategoryTheory.Monoidal.Opposite
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] : (CategoryTheory.MonoidalOpposite.mopEquiv C).counitIso = CategoryTheory.Iso.refl ((CategoryTheory.unmopFunctor C).comp (CategoryTheory.mopFunctor C)) - CategoryTheory.MonoidalOpposite.unmopEquiv_counitIso_hom_app π Mathlib.CategoryTheory.Monoidal.Opposite
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : C) : (CategoryTheory.MonoidalOpposite.unmopEquiv C).counitIso.hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.MonoidalOpposite.unmopEquiv_counitIso_inv_app π Mathlib.CategoryTheory.Monoidal.Opposite
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : C) : (CategoryTheory.MonoidalOpposite.unmopEquiv C).counitIso.inv.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.MonoidalOpposite.mopMopEquivalence_counitIso_hom_app π Mathlib.CategoryTheory.Monoidal.Opposite
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : C) : (CategoryTheory.MonoidalOpposite.mopMopEquivalence C).counitIso.hom.app X = CategoryTheory.CategoryStruct.id X - CategoryTheory.MonoidalOpposite.mopMopEquivalence_counitIso_inv_app π Mathlib.CategoryTheory.Monoidal.Opposite
(C : Type uβ) [CategoryTheory.Category.{vβ, uβ} C] (X : C) : (CategoryTheory.MonoidalOpposite.mopMopEquivalence C).counitIso.inv.app X = CategoryTheory.CategoryStruct.id X - ModuleCat.restrictScalarsEquivalenceOfRingEquiv_counitIso π Mathlib.Algebra.Category.ModuleCat.ChangeOfRings
{R : Type u_1} {S : Type u_2} [Ring R] [Ring S] (e : R β+* S) : (ModuleCat.restrictScalarsEquivalenceOfRingEquiv e).counitIso = (ModuleCat.restrictScalarsComp' e.toRingHom e.symm.toRingHom (RingHom.id R) β―).symm βͺβ« ModuleCat.restrictScalarsId R - Bipointed.swapEquiv_counitIso_hom_app_toFun π Mathlib.CategoryTheory.Category.Bipointed
(X : Bipointed) (a : ((Bipointed.swap.comp Bipointed.swap).obj X).X) : (Bipointed.swapEquiv.counitIso.hom.app X).toFun a = a - Bipointed.swapEquiv_counitIso_inv_app_toFun π Mathlib.CategoryTheory.Category.Bipointed
(X : Bipointed) (a : ((Bipointed.swap.comp Bipointed.swap).obj X).X) : (Bipointed.swapEquiv.counitIso.inv.app X).toFun a = a - CategoryTheory.AddMon.equivLaxMonoidalFunctorPUnit_counitIso_hom_app_hom π Mathlib.CategoryTheory.Monoidal.Mon
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] (X : CategoryTheory.AddMon C) : (CategoryTheory.AddMon.equivLaxMonoidalFunctorPUnit.counitIso.hom.app X).hom = CategoryTheory.CategoryStruct.id X.X - CategoryTheory.AddMon.equivLaxMonoidalFunctorPUnit_counitIso_inv_app_hom π Mathlib.CategoryTheory.Monoidal.Mon
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] (X : CategoryTheory.AddMon C) : (CategoryTheory.AddMon.equivLaxMonoidalFunctorPUnit.counitIso.inv.app X).hom = CategoryTheory.CategoryStruct.id X.X - CategoryTheory.Mon.equivLaxMonoidalFunctorPUnit_counitIso_hom_app_hom π Mathlib.CategoryTheory.Monoidal.Mon
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] (X : CategoryTheory.Mon C) : (CategoryTheory.Mon.equivLaxMonoidalFunctorPUnit.counitIso.hom.app X).hom = CategoryTheory.CategoryStruct.id X.X - CategoryTheory.Mon.equivLaxMonoidalFunctorPUnit_counitIso_inv_app_hom π Mathlib.CategoryTheory.Monoidal.Mon
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] [CategoryTheory.MonoidalCategory C] (X : CategoryTheory.Mon C) : (CategoryTheory.Mon.equivLaxMonoidalFunctorPUnit.counitIso.inv.app X).hom = CategoryTheory.CategoryStruct.id X.X - CategoryTheory.Equivalence.mapAddMon_counitIso π Mathlib.CategoryTheory.Monoidal.Mon
{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.mapAddMon.counitIso = CategoryTheory.Functor.mapAddMonCompIso.symm βͺβ« CategoryTheory.Functor.mapAddMonNatIso e.counitIso βͺβ« CategoryTheory.Functor.mapAddMonIdIso - CategoryTheory.Equivalence.mapMon_counitIso π Mathlib.CategoryTheory.Monoidal.Mon
{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.mapMon.counitIso = CategoryTheory.Functor.mapMonCompIso.symm βͺβ« CategoryTheory.Functor.mapMonNatIso e.counitIso βͺβ« CategoryTheory.Functor.mapMonIdIso - 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_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.Monad.algebraEquivOfIsoMonads_counitIso π Mathlib.CategoryTheory.Monad.Algebra
{C : Type uβ} [CategoryTheory.Category.{vβ, uβ} C] {Tβ Tβ : CategoryTheory.Monad C} (h : Tβ β Tβ) : (CategoryTheory.Monad.algebraEquivOfIsoMonads h).counitIso = (CategoryTheory.Monad.algebraFunctorOfMonadHomComp h.inv h.hom).symm βͺβ« CategoryTheory.Monad.algebraFunctorOfMonadHomEq β― βͺβ« CategoryTheory.Monad.algebraFunctorOfMonadHomId - 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.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) β― - CategoryTheory.WithInitial.opEquiv_counitIso_hom_app π Mathlib.CategoryTheory.WithTerminal.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.WithTerminal Cα΅α΅) : (CategoryTheory.WithInitial.opEquiv C).counitIso.hom.app X = (match X with | CategoryTheory.WithTerminal.of x => CategoryTheory.Iso.refl (CategoryTheory.WithTerminal.of x) | CategoryTheory.WithTerminal.star => CategoryTheory.Iso.refl CategoryTheory.WithTerminal.star).hom - CategoryTheory.WithInitial.opEquiv_counitIso_inv_app π Mathlib.CategoryTheory.WithTerminal.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.WithTerminal Cα΅α΅) : (CategoryTheory.WithInitial.opEquiv C).counitIso.inv.app X = (match X with | CategoryTheory.WithTerminal.of x => CategoryTheory.Iso.refl (CategoryTheory.WithTerminal.of x) | CategoryTheory.WithTerminal.star => CategoryTheory.Iso.refl CategoryTheory.WithTerminal.star).inv - CategoryTheory.WithTerminal.opEquiv_counitIso_hom_app π Mathlib.CategoryTheory.WithTerminal.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.WithInitial Cα΅α΅) : (CategoryTheory.WithTerminal.opEquiv C).counitIso.hom.app X = (match X with | CategoryTheory.WithInitial.of x => CategoryTheory.Iso.refl (CategoryTheory.WithInitial.of x) | CategoryTheory.WithInitial.star => CategoryTheory.Iso.refl CategoryTheory.WithInitial.star).hom - CategoryTheory.WithTerminal.opEquiv_counitIso_inv_app π Mathlib.CategoryTheory.WithTerminal.Basic
(C : Type u) [CategoryTheory.Category.{v, u} C] (X : CategoryTheory.WithInitial Cα΅α΅) : (CategoryTheory.WithTerminal.opEquiv C).counitIso.inv.app X = (match X with | CategoryTheory.WithInitial.of x => CategoryTheory.Iso.refl (CategoryTheory.WithInitial.of x) | CategoryTheory.WithInitial.star => CategoryTheory.Iso.refl CategoryTheory.WithInitial.star).inv - CategoryTheory.WithInitial.equivComma_counitIso_hom_app_left π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.const C) (CategoryTheory.Functor.id (CategoryTheory.Functor C D))) : (CategoryTheory.WithInitial.equivComma.counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.WithInitial.equivComma_counitIso_inv_app_left π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.const C) (CategoryTheory.Functor.id (CategoryTheory.Functor C D))) : (CategoryTheory.WithInitial.equivComma.counitIso.inv.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.WithTerminal.equivComma_counitIso_hom_app_right π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.id (CategoryTheory.Functor C D)) (CategoryTheory.Functor.const C)) : (CategoryTheory.WithTerminal.equivComma.counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.WithTerminal.equivComma_counitIso_inv_app_right π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.id (CategoryTheory.Functor C D)) (CategoryTheory.Functor.const C)) : (CategoryTheory.WithTerminal.equivComma.counitIso.inv.app X).right = CategoryTheory.CategoryStruct.id X.right - CategoryTheory.WithInitial.equivComma_counitIso_hom_app_right_app π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.const C) (CategoryTheory.Functor.id (CategoryTheory.Functor C D))) (Xβ : C) : (CategoryTheory.WithInitial.equivComma.counitIso.hom.app X).right.app Xβ = CategoryTheory.CategoryStruct.id (match CategoryTheory.WithInitial.incl.obj Xβ with | CategoryTheory.WithInitial.of x => X.right.obj x | CategoryTheory.WithInitial.star => X.left) - CategoryTheory.WithInitial.equivComma_counitIso_inv_app_right_app π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.const C) (CategoryTheory.Functor.id (CategoryTheory.Functor C D))) (Xβ : C) : (CategoryTheory.WithInitial.equivComma.counitIso.inv.app X).right.app Xβ = CategoryTheory.CategoryStruct.id (match CategoryTheory.WithInitial.incl.obj Xβ with | CategoryTheory.WithInitial.of x => X.right.obj x | CategoryTheory.WithInitial.star => X.left) - CategoryTheory.WithTerminal.equivComma_counitIso_hom_app_left_app π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.id (CategoryTheory.Functor C D)) (CategoryTheory.Functor.const C)) (Xβ : C) : (CategoryTheory.WithTerminal.equivComma.counitIso.hom.app X).left.app Xβ = CategoryTheory.CategoryStruct.id (match CategoryTheory.WithTerminal.incl.obj Xβ with | CategoryTheory.WithTerminal.of x => X.left.obj x | CategoryTheory.WithTerminal.star => X.right) - CategoryTheory.WithTerminal.equivComma_counitIso_inv_app_left_app π Mathlib.CategoryTheory.WithTerminal.Basic
{C : Type u} [CategoryTheory.Category.{v, u} C] {D : Type u_1} [CategoryTheory.Category.{v_1, u_1} D] (X : CategoryTheory.Comma (CategoryTheory.Functor.id (CategoryTheory.Functor C D)) (CategoryTheory.Functor.const C)) (Xβ : C) : (CategoryTheory.WithTerminal.equivComma.counitIso.inv.app X).left.app Xβ = CategoryTheory.CategoryStruct.id (match CategoryTheory.WithTerminal.incl.obj Xβ with | CategoryTheory.WithTerminal.of x => X.left.obj x | CategoryTheory.WithTerminal.star => X.right) - CategoryTheory.WithInitial.coconeEquiv_counitIso_hom_app_hom π 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)} (Xβ : CategoryTheory.Limits.Cocone (CategoryTheory.WithInitial.liftFromUnder.obj K)) : (CategoryTheory.WithInitial.coconeEquiv.counitIso.hom.app Xβ).hom = CategoryTheory.CategoryStruct.id Xβ.pt - CategoryTheory.WithInitial.coconeEquiv_counitIso_inv_app_hom π 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)} (Xβ : CategoryTheory.Limits.Cocone (CategoryTheory.WithInitial.liftFromUnder.obj K)) : (CategoryTheory.WithInitial.coconeEquiv.counitIso.inv.app Xβ).hom = CategoryTheory.CategoryStruct.id Xβ.pt - CategoryTheory.WithTerminal.coneEquiv_counitIso_hom_app_hom π 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)} (Xβ : CategoryTheory.Limits.Cone (CategoryTheory.WithTerminal.liftFromOver.obj K)) : (CategoryTheory.WithTerminal.coneEquiv.counitIso.hom.app Xβ).hom = CategoryTheory.CategoryStruct.id Xβ.pt - CategoryTheory.WithTerminal.coneEquiv_counitIso_inv_app_hom π 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)} (Xβ : CategoryTheory.Limits.Cone (CategoryTheory.WithTerminal.liftFromOver.obj K)) : (CategoryTheory.WithTerminal.coneEquiv.counitIso.inv.app Xβ).hom = CategoryTheory.CategoryStruct.id Xβ.pt - commAlgCatEquivUnder_counitIso π Mathlib.Algebra.Category.CommAlgCat.Basic
(R : CommRingCat) : (commAlgCatEquivUnder R).counitIso = CategoryTheory.Iso.refl ({ obj := fun A => CommAlgCat.of βR βA.right, map := fun {A B} f => CommAlgCat.ofHom (CommRingCat.toAlgHom f), map_id := β―, map_comp := β― }.comp { obj := fun A => R.mkUnder βA, map := fun {A B} f => (CommAlgCat.Hom.hom f).toUnder, map_id := β―, map_comp := β― }) - CategoryTheory.ObjectProperty.opEquivalence_counitIso π Mathlib.CategoryTheory.ObjectProperty.Opposite
{C : Type u} [CategoryTheory.Category.{v, u} C] (P : CategoryTheory.ObjectProperty C) : P.opEquivalence.counitIso = CategoryTheory.Iso.refl ((P.op.lift P.ΞΉ.op β―).comp (P.lift P.op.ΞΉ.leftOp β―).rightOp) - CategoryTheory.MorphismProperty.Comma.mapLeftIso_counitIso_hom_app_left π Mathlib.CategoryTheory.MorphismProperty.Comma
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {B : Type u_2} [CategoryTheory.Category.{v_2, u_2} B] {T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] (R : CategoryTheory.Functor B T) {P : CategoryTheory.MorphismProperty T} {Q : CategoryTheory.MorphismProperty A} {W : CategoryTheory.MorphismProperty B} [Q.IsMultiplicative] [W.IsMultiplicative] {Lβ Lβ : CategoryTheory.Functor A T} [P.RespectsIso] [Q.RespectsIso] [W.RespectsIso] (e : Lβ β Lβ) (X : CategoryTheory.MorphismProperty.Comma Lβ R P Q W) : ((CategoryTheory.MorphismProperty.Comma.mapLeftIso R e).counitIso.hom.app X).left = CategoryTheory.CategoryStruct.id X.left - CategoryTheory.MorphismProperty.Comma.mapLeftIso_counitIso_hom_app_right π Mathlib.CategoryTheory.MorphismProperty.Comma
{A : Type u_1} [CategoryTheory.Category.{v_1, u_1} A] {B : Type u_2} [CategoryTheory.Category.{v_2, u_2} B] {T : Type u_3} [CategoryTheory.Category.{v_3, u_3} T] (R : CategoryTheory.Functor B T) {P : CategoryTheory.MorphismProperty T} {Q : CategoryTheory.MorphismProperty A} {W : CategoryTheory.MorphismProperty B} [Q.IsMultiplicative] [W.IsMultiplicative] {Lβ Lβ : CategoryTheory.Functor A T} [P.RespectsIso] [Q.RespectsIso] [W.RespectsIso] (e : Lβ β Lβ) (X : CategoryTheory.MorphismProperty.Comma Lβ R P Q W) : ((CategoryTheory.MorphismProperty.Comma.mapLeftIso R e).counitIso.hom.app X).right = CategoryTheory.CategoryStruct.id X.right
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