Proposition 1.3.1. Let \(f\colon C\to D\) be a functor. For \(f\) to be an equivalence, it suffices that the following properties hold for every category \(T\):

  1. (1) For \(a,b\colon T\to C\), any identification \(fa= fb\) gives an identification \(a= b\).

  2. (2) For any \(d\colon T\to D\), there is a functor \(c\colon T\to C\) equipped with an identification \(fc= d\).

Proof

Apply the second property to \(\id_D\) to obtain \(g\colon D\to C\) and \(fg=\id_D\). The associator, this identification, and the unitors identify \(f(gf)\) with \(f\id_C\). The first property, with \(T=C\), gives \(gf=\id_C\).

From Section 1.3, Equivalences of categories.