Lemma 1.7.11. Let \(T\) be a category and let \(f\colon C \to E\) and \(g\colon D \to E\) be functors. Then the functor \[ (\pr_1 \circ \blank, \pr_2 \circ \blank)\colon \Fun(T,C \times_{E} D) \to \Fun(T,C) \times_{\Fun(T,E)} \Fun(T,D) \] induced by the identification \((f \circ \blank) \circ (\pr_1 \circ \blank) = (g \circ \blank) \circ (\pr_2 \circ \blank)\) is an equivalence.

Proof

By Proposition 1.6.3, it suffices to show that the pullback square defining \(C \times_E D\) remains a pullback square after applying \(\Map(S,\Fun(T,-))\) for every category \(S\). Under uncurrying, its four corners are identified with \[ \Map(S\times T,C\times_E D),\quad \Map(S\times T,C),\quad \Map(S\times T,D),\quad \Map(S\times T,E). \] By Lemma 1.7.7, the four functors become postcomposition with the original projections, \(f\), and \(g\). These comparisons respect the specified commutativity identification, as follows by uncurrying its defining postcomposition identification. We conclude that this square agrees with the one obtained by applying \(\Map(S \times T, -)\) to the original pullback square, including its commutativity data. So the resulting square is a pullback by Proposition 1.6.3.

From Section 1.7, Functor categories.