Proposition 1.4.2 (Uncurrying). For every anima \(X\) and categories \(C,D\), uncurrying is represented by an equivalence \[ (-)^u\colon\Map\bigl(X,\Map(C,D)\bigr) \iso\Map(X\times C,D). \]
Proof
Put \(P:=\Map(X,\Map(C,D))\). Iterated evaluation gives a functor \[ P\times X\times C \longrightarrow \Map(C,D)\times C \xrightarrow{\ev_{\Map}}D. \] Since \(P\) is an anima, currying this functor constructs an actual functor \((-)^u\colon P\to\Map(X\times C,D)\).
For the inverse, put \(Q:=\Map(X\times C,D)\), and consider the evaluation functor \(Q\times X\times C\to D\). If we first curry in the variable \(C\), with anima parameter \(Q\times X\), and then curry in the variable \(X\), with anima parameter \(Q\), we obtain a functor \(Q\to P\). To verify that both composites are the identity, it suffices by Axiom B.3 to uncurry: once in \(X \times C\) for the composite on \(Q\), and successively in \(X\) and \(C\) for the composite on \(P\). In both cases, the resulting identification follows from the defining identifications for currying.