Corollary 12.4.2. The opposite category functor has the following properties.
(i) It commutes with limits (in particular with pullbacks). In particular, we have \(*\catop \iso *\) and for categories \(C\) and \(D\) there exists a canonical isomorphism \[ (C \times D) \catop \iso C\catop \times D\catop\, . \]
(ii) For any categories \(C\) and \(D\) there exists a canonical isomorphism \[ \Fun(C,D)\catop \iso \Fun(C\catop,D\catop)\, . \]
Proof
Equivalences of categories commute with limits and colimits, and this explains assertion (i). For any categories \(A\), \(C\) and \(D\), the evaluation functor \[ \ev\colon C\times\Fun(C,D)\to D \] induces thanks to the compatibility of \((-)\catop\) with cartesian products a functor \[ \ev\catop\colon C\catop\times\Fun(C,D)\catop\to D\catop \] hence, by transposition, a comparison functor \[ \delta\colon\Fun(C,D)\catop\to\Fun(C\catop,D\catop)\, . \] On the other hand, there are canonical equivalences: \begin{align*} \Map(A,\Fun(C,D))&\simeq \Map(A\times C,D)\\ &\simeq \Map((A\times C)\catop,D\catop)\\ &\simeq \Map(A\catop\times C\catop,D\catop)\\ &\simeq \Map(A\catop,\Fun(C\catop,D\catop))\\ &\simeq \Map((A\catop)\catop,\Fun(C\catop,D\catop)\catop)\\ &\simeq \Map(A,\Fun(C\catop,D\catop)\catop)\, . \end{align*} where the final equivalence is induced by the equivalence \(A\iso(A\catop)\catop\). Using Corollary 12.3.19, we see that the equivalence \[ \Map(A,\Fun(C,D)) \simeq \Map(A,\Fun(C\catop,D\catop)\catop) \] obtained above as a composition of equivalences is induced by postcomposition with \(\delta\catop\colon\Fun(C,D)\to\Fun(C\catop,D\catop)\catop\). Therefore, \(\delta\catop\), and hence \(\delta\), is an equivalence.