Lemma 1.3.6. Equivalences of categories satisfy the 2-out-of-3 property: given functors \(f\colon C \to D\) and \(g\colon D \to E\), if two of the three functors \(f\), \(g\) and \(gf\) are equivalences, then so is the third.

Proof

If \(g\) and \(f\) are equivalences, then so is \(gf\) by Lemma 1.3.5. If \(f\) and \(gf\) are equivalences, then we may rewrite \(g\) as the composite \(g = g \circ \id_{D} = g \circ f \circ f^{-1} = gf \circ f^{-1}\), so that \(g\) is the composite of two equivalences and hence itself an equivalence. A similar argument shows that \(f\) is an equivalence whenever \(g\) and \(gf\) are equivalences.

From Section 1.3, Equivalences of categories.