Explicit predicative formulas are written for the standing hypotheses, the epsilon-delta condition and each notion, their meaning is checked under the hypotheses, the variables are renamed to arbitrary positions, and class comprehension gives the classes.
Routine facts about real numbers are used without comment (Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (vi)). Throughout, formulas are written with abbreviations as in Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (vi), a formula being predicative when it is so with its abbreviations eliminated, and the given are the first of distinct set variables as in Renaming and Substituting Variables in Predicative Formulas, so that are distinct also when . The parameters , , , , , and are variables other than and other than the bound variables below, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i); and its elements and are sets. Pair memberships such as are the formulas of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii), and for set variables and , and stand for the pair memberships and . The letters denote further set variables, distinct from one another, from and from the parameters.
Arithmetic formulas. By Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (i) and Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (ii), with its number of variables equal to and , and , and by Predicative Formulas for Differences, Quotients, Absolute Values, Distances and the Strict Order of the Real Numbers, at Any Variable Positions (iii), with its number of variables equal to , and , there are predicative formulas, with parameters among , , , , and , expressing " and ", ", and " and " and ". For set variables , and write , and for these formulas with , and put for , and , respectively and for and . 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) they are predicative, and for sets , and : holds if and only if and ; holds if and only if , and ; and holds if and only if and .
The formulas. Write and for and . Let
and let and be the formula of Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii) with , and , respectively , and , as its , and , its auxiliary set variables chosen pairwise distinct and distinct from , from the letters above and from the parameters. For distinct set variables and among , , and let
and let . Writing and for where they occur, let
The formulas , (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (vii)), the pair memberships (Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iii)) and , and are predicative, so they contain no quantifier over a class variable, and every other quantifier above is over a set variable. So no quantifier of is applied to a class variable, and they are predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). The free variables of are among , , , and the parameters; so those of are among and the parameters, and those of , , and among , , and the parameters.
What says. Let a set be assigned to . The first conjunct of says that (Subclasses and Subsets (i)). When it holds, the elements and of in the second conjunct are real numbers, so the second conjunct says that for all with and , that is, by Intervals of the Real Line (i), that is an interval; and the third says that contains two distinct points. So holds if and only if is an interval containing two distinct points.
What says. Let sets , , and be assigned to , , and , where is an interval containing two distinct points, is a map , and . Let and let be a set.
First, holds if and only if and : for , and are real numbers, so holds exactly for , and then exactly for .
Second, let with . Then , as . By Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (i) and Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii), holds exactly for and exactly for , and these are real numbers. So, by the meanings of , and , the conjuncts of before hold exactly for , , , , , and , and holds if and only if
Hence holds if and only if for every real there is a real such that every with satisfies this inequality, that is, by Derivative of a Real Function on an Interval (i), if and only if is a derivative of at .
The standing hypotheses, and derivatives and differentiability at a point. Let sets , , and be assigned to . By the meaning of and 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 (vii), holds if and only if is an interval containing two distinct points, is a map and . So is a predicative formula in , in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing the condition of (i) with , and . If fails, then and fail, and so do the conditions of (ii) and (iii). If holds, then, by the meaning of , holds exactly when and is a derivative of at ; and holds exactly when some real number is a derivative of at , that is, as a derivative is a real number (Derivative of a Real Function on an Interval (i)), when is differentiable at (Derivative of a Real Function on an Interval (ii)). So is a predicative formula in expressing the condition of (ii) with , , and , and one in expressing the condition of (iii) with , and .
Differentiability on a subset. Let sets , and be assigned to , and . The first three conjuncts of hold exactly when is an interval containing two distinct points, and (Subclasses and Subsets (i)); if one of them fails, fails and so does the condition of (iv). If they hold, then for every we have , so by the previous paragraph, with in place of , holds exactly when is differentiable at . So the last conjunct says that is differentiable at every point of , that is, differentiable on (Derivative of a Real Function on an Interval (iii)). Hence is a predicative formula in expressing the condition of (iv) with , and .
The derivative map. Let sets , and be assigned to , and . If one of , and fails, then fails, and so does the condition of (vi), which requires to be an interval containing two distinct points and and to be maps from to . Let them hold. For , holds exactly for , a real number (Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (i), Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii)), so by the meaning of the last conjunct of says that is a derivative of at for every . If it holds, then is differentiable at every point of , that is, differentiable (Derivative of a Real Function on an Interval (iii)), and for every , since and are both derivatives of at (Derivative of a Real Function on an Interval (ii)). Conversely, if is differentiable and for every , then each is a derivative of at (Derivative of a Real Function on an Interval (ii)). Finally, for differentiable the derivative is a map with value at every (Derivative of a Real Function on an Interval (iv)), and a map with for every is equal to (Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (iv)); so if and only if is a map with for every . Hence is a predicative formula in expressing the condition of (vi) with , and .
Renaming to arbitrary positions. By Renaming and Substituting Variables in Predicative Formulas (i), with its number of variables equal to and , and , the formula is a predicative formula in that holds, under every assignment of sets to , exactly when the condition of (i) holds for , and . This proves (i). In the same way , and prove (iii), (iv) and (vi), and, with the number of variables equal to and moreover , proves (ii). Finally, with the number of variables equal to and , and , the formula is a predicative formula in expressing the condition of (iv) with . As always, and differentiability on is differentiability (Derivative of a Real Function on an Interval (iii)), this is the condition of (v), which is therefore predicative.
The class of maps differentiable at a point. Let be an interval containing two distinct points and let . Then is a set, being a subclass of the set (Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i)), and is a set, being an element of a class (Classes, Membership, Sets and Proper Classes (i)). Apply The Class Comprehension Theorem for Predicative Formulas (i) to with its abbreviations eliminated, with as its single variable and , , , , , , , and as its parameters, and being assigned and . It gives a class whose elements are exactly the sets for which holds with assigned to (the one-entry tuple is by The Ordered Pair of Two Sets and Nested Tuples (ii)), that is, as the hypotheses on and hold, the sets that are maps differentiable at . Every element of is a set (Classes, Membership, Sets and Proper Classes (i)), and every map is a set, as it lies in the class of functions from to by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i), and being sets. So for every class , if and only if is a map differentiable at . This proves (vii).
The class of maps differentiable on a subset. Let be an interval containing two distinct points and let ; is a set as before, and is a set, being a subclass of the set (Subclasses of Sets Are Sets, the Union and Power Set of a Set Exist Uniquely, Binary Unions of Sets Are Sets, and the Universal Class Is Proper (i)). The Class Comprehension Theorem for Predicative Formulas (i), applied to with its abbreviations eliminated, with as its single variable and and (assigned and ), , , , , , and as its parameters, gives a class whose elements are exactly the maps that are differentiable on , which proves (viii) (bookkeeping as in the previous paragraph).
The class of differentiable maps. Let be an interval containing two distinct points. As , (viii) with gives a class such that, for every class , if and only if is differentiable on , that is, differentiable (Derivative of a Real Function on an Interval (iii)). This proves (ix).
Loadingβ¦