Corollary 6.3.9. A functor \(f\colon C \to D\) is an equivalence if and only if the induced map \[ f_*\colon \Map([1],C) \to \Map([1],D) \] is an equivalence.
Proof
If \(f\) is an equivalence, it is clear that \(f_*\) is an equivalence. Conversely, assume that \(f_*\) is an equivalence. By Theorem 6.3.8, it will suffice to show that \(f\) is strongly surjective and fully faithful. Consider the following commutative diagram:
It follows that \(f^{\simeq}\) is a retract of \(f_*\), and thus in particular it is an equivalence. In particular, \(f\) is strongly surjective. Now consider the following commutative diagram:
Since the top and bottom maps are equivalences, it follows that the square is a pullback square, and thus \(f\) is fully faithful by Remark 6.3.2.
From Section 6.3, The Fundamental Theorem of category theory.