Lemma 1.4.26. The functor \((f=g)\to (f\cong g)\) is an equivalence. In particular, \((f\cong g)\) is an anima.

Proof. The Rezk axiom says that \(i\colon \Fun (C,D)\to \Iso (\Fun (C,D))\) is an equivalence. Taking fibers over \((f,g)\) gives the displayed functor, which is an equivalence because equivalences are stable under pullback. โ–ก