Lemma 1.2.9. Prewhiskering or postwhiskering by an equivalence induces equivalences of identification animae. In particular, if \(f\colon A\to B\) is an equivalence and \(x,y\colon *\to A\), then \[ f_*\colon (x=y)\longrightarrow (fx=fy) \] is an equivalence.
Proof. Let us merely prove the special case; the general proof is similar. Let \(g\colon B \to A\) be an inverse to \(f\), with identifications \(\alpha \colon \id _A = gf\) and \(\beta \colon \id _B = fg\). We may then consider the following maps of animae: \[ (x = y) \xrightarrow {f_*} (fx = fy) \xrightarrow {g_*} (gfx = gfy) \xrightarrow {f_*} (fgfx = fgfy). \] By the 2-out-of-6 property, it suffices to show that the composites \(g_*f_* = (gf)_*\) and \(f_*g_* = (fg)_*\) are equivalances. We argue the first; the second is similar. Applying the interchange law to the identification \(\alpha \colon \id _A = gf\), we see that \((gf)_*\) gets identified with the composite \[ (x = y) \xrightarrow {\alpha _y \star -} (x = gfy) \xrightarrow {- \star \alpha _x^{-1}} (gfx = gfy). \] Since \(\alpha _y\) and \(\alpha _x^{-1}\) are both invertible, both of these functors are equivalences, hence so is their composite. โก