Lemma 1.3.5. If \(f\colon C \to D\) and \(f'\colon D \to E\) are equivalences with inverses \(g\colon D \to C\) and \(g'\colon E \to D\), then also the composite \(f'f\colon C \to E\) is an equivalence with inverse \(gg'\colon E \to C\).

Proof

We have \(gg'f'f = g\id_{D}f = gf = \id_{C}\) and \(f'fgg' = f'\id_{D}g'= f'g' = \id_{E}\).

From Section 1.3, Equivalences of categories.