For n ≥ 1, n_ℝ is the iterated sum of a fixed constant function e with value 1 over [n], which the predicative formula for iterated operations expresses; the case n = 0 is a disjunct. The function then comes from the scheme for functions given by expressions.
Throughout, with (The Natural Numbers and the Natural Numbers with Zero: Arithmetic, Order, Induction and Recursion (ii)), and for every : is the zero of , and for the sum is the value at of a map from to (The Image of a Natural Number in a Commutative Ring (i), Iterated Operations: Finite Sums and Finite Products (i)).
The constant function . By Maps and Relations Given by Formulas (i), applied to the sets and and the constant expression , there is a function with for every . Let . Then , and the restriction is the constant function on , so by Iterated Operations: Finite Sums and Finite Products (ii) and The Image of a Natural Number in a Commutative Ring (i)
Proof of (i). Let , and be class parameters standing for , the element of and the zero of , distinct from the class variables of the formula below. Let be the predicative formula of Iterated Operations Are Given by a Predicative Formula (i) for distinct set variables , and , with , the addition of , , and the order and the addition of assigned to its class variables, and let be obtained from it by renaming , and to , and . Moving the formula to these positions is a renaming of variables, so by Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (i) it is predicative and, as stands for the set , it holds exactly when holds with the values of and and the set assigned to , and . Let be
It is built by connectives from atomic formulas and the predicative formula , so it is predicative, and its free variables are , and parameters. Let sets be assigned to . If , then and the condition both fail. If , then , so holds if and only if in , that is, by The Image of a Natural Number in a Commutative Ring (i). If , then , and is a function from a set containing to , so holds if and only if by Iterated Operations Are Given by a Predicative Formula (i), that is, by the display above. Hence expresses the condition.
Proof of (ii). By (i), for every the set is the only set satisfying with assigned to . So is a defined set symbol with argument , given by and used properly wherever . As for every , Maps and Relations Given by Formulas (i), applied to the sets and and the expression , gives exactly one function with for every .
Loading…