The components, or entries, of the maps from S into , or into the matrices, are the values of one map on pairs, built by currying; the set is then cut out of D by a predicative condition, and the map Ψ is obtained by currying the map (f, k) ↦ Φ(.
Vectors and matrices as functions. By Euclidean Space : n-Tuples of Real Numbers with Their Componentwise Operations (i) and Euclidean Space : n-Tuples of Real Numbers with Their Componentwise Operations (ii), and for and . By Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (i) and Real Matrices: the Set of Real m x n Matrices with Their Entrywise Operations (ii), and for , and . The elements of are exactly the pairs with and , by The Cartesian Product of Two Classes (i) and Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i). Below, is either or , and ; so in the first case and in the second.
The function of components. Let . For , with and , by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i); so is a function , by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), and for , is a function and . Hence there is a function with for all and (Maps and Relations Given by Formulas (ii), with , and for , and ). By Projection, Evaluation and Currying Maps (iii), with , and for , and , there is a function with for all and . Every function lies in , by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i); so for such and , is a function with for every .
For and (the case ), for every , so by the uniqueness in Component Maps of a Map into , Entry Maps of a Map into Matrices, and Maps Assembled from Them (i). For , and (the case ), for every , so by the uniqueness in Component Maps of a Map into , Entry Maps of a Map into Matrices, and Maps Assembled from Them (ii).
Proof of (i) and (iii). Let and be as in (i), with , or as in (iii), with . Then , by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i). Let
a set (Sets and Maps: Ordinary Notation (iii)). By the previous paragraph, and as runs through the pairs when , the elements of are exactly the with for every in the first case, and exactly the with for all and in the second. A set with the same elements has the elements of , so by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii).
Proof of (ii) and (iv). Let , , , and be as in (ii), with , or as in (iv), with . For and , by the construction of above, so . Hence there is a function with for all and (Maps and Relations Given by Formulas (ii), with , and for , and ), and, by Projection, Evaluation and Currying Maps (iii) with , and for , and , exactly one function with for all and . By the identification of above, this says for all and in the first case, and for all , and in the second. Conversely, let be a function with the property stated in (ii), respectively (iv). As every is a pair with and , for all and , so by the uniqueness in Projection, Evaluation and Currying Maps (iii).
Loading…