Lemma 1.7.10. Let \(C\), \(D\) and \(E\) be categories. Then the functor \[ (\pr_1 \circ \blank, \pr_2 \circ \blank)\colon \Fun(C, D \times E) \to \Fun(C, D) \times \Fun(C,E) \] is an equivalence.
Proof
For every category \(T\), the universal property of functor categories and Proposition 1.4.5 give equivalences \[ \begin{aligned} \Map(T,\Fun(C,D\times E)) &\simeq\Map(T\times C,D\times E)\\ &\simeq\Map(T\times C,D)\times\Map(T\times C,E)\\ &\simeq\Map(T,\Fun(C,D))\times\Map(T,\Fun(C,E))\\ &\simeq\Map(T,\Fun(C,D)\times\Fun(C,E)). \end{aligned} \] This composite is induced by the functor in the statement: after uncurrying, its two components are postcomposition with \(\pr_1\) and \(\pr_2\), by Lemma 1.7.7. The result follows from Proposition 1.4.11.