Description: Define Cartesian exponentiation on a class.
Note that this definition is limited to finite exponents, since it is
defined using nested ordered pairs. If tuples of infinite length are
needed, or if they might be needed in the future, use df-ixp or
df-map instead. The main advantage of this definition is that it
integrates better with functions and relations. For example if R is
a subset of ( A ^^ 2o ) , then df-br can be used on it, and
df-fv can also be used, and so on.
It's also worth keeping in mind that ( ( U ^^ M ) X. ( U ^^ N ) ) is
generally not equal to ( U ^^ ( M +o N ) ) .
This definition is technical. Use finxp1o and finxpsuc for a more
standard recursive experience. (Contributed by ML, 16-Oct-2020)