Lemma 1.3.10. Prewhiskering or postwhiskering by an equivalence induces equivalences of animae of identifications.

Proof

Composition with a fixed identification is an equivalence, with inverse given by composition with its inverse. This follows from the vertical unit, associativity, and inverse laws.

Let \(F\colon C\to D\) have inverse \(G\), and consider two functors \(a,b\colon T\to C\). We wish to show that the first functor \(F \star -\) in the following diagram is an equivalence: \[ (a= b)\xrightarrow{F\star-}(Fa= Fb) \xrightarrow{G\star-}(GFa= GFb) \xrightarrow{F\star-}(FGFa= FGFb). \] Interchange with \(GF=\id_C\) identifies the composite of the first two functors with transport along the identifications \(GFa = a\) and \(b = GFb\), and so that composite is an equivalence. The composite of the last two is an equivalence for the same reason, using \(FG=\id_D\), and so the claim follows from the 2-out-of-6 property. Prewhiskering is treated in the same way.

From Section 1.3, Equivalences of categories.