The epsilon-delta condition for a complex derivative is written as a predicative formula through the graphs of the sum and product of the complex numbers and of the distance, combined with predicative formulas for openness and for maps, moved to arbitrary variable positions, and fed to class comprehension.
Facts about maps and predicative formulas carried by Routine Facts, Continued: Typed Arithmetic, Maps and Predicativity (vi) are used without comment. 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 are those of the statement, at their fixed values as in Conditions Expressed by a Predicative Formula, and Guards (i); they are variables other than and other than the bound variables below, and , , and its element are sets (, a map , lies in by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii) and The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)). In formulas, and denote the sum and product operations of , which are binary operations on (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (iii)), and for set variables and , and stand for and . Formulas of the forms and are those 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 Predicativity under Renaming of Set Variables by Variables, of Formulas with Ordered Pairs, and of Formulas for Relations, Functions, Maps, Injectivity, Surjectivity and Bijectivity (iv): they are predicative and, when sets are assigned to the variables inside the pairs, hold exactly when the corresponding membership of ordered pairs does. The letters denote further set variables, distinct from one another, from and from the parameters.
Openness and maps. Write , and for , and . By Kit for def:open-subset-metric-space (i), with its number of variables equal to and its , , equal to , , , there is a predicative formula in , with parameters among , , and , that holds exactly when is a metric space, and is open in . By Renaming and Substituting Variables in Predicative Formulas (iii), with , and , respectively , it yields predicative formulas and in ; as is a metric space (Metric Spaces: Balls, the Metric Topology, and the Real and Complex Numbers as Metric Spaces (v)), holds exactly when and is open in , and exactly when and is open in . Let 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 as its , and , its auxiliary set variables chosen pairwise distinct and distinct from the letters above and from the parameters; it is predicative and holds exactly when is a map .
The formulas. Let
The formulas , , and the pair and operation memberships are predicative, so they contain no quantifier over a class variable, and every other quantifier above is over a set variable; so is 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.
What says. Let sets , , and be assigned to , , and , where is an open subset of , is a map , and . Let and let be a set.
First, holds if and only if and : for , the pair lies in , the domain of , so holds exactly for (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x)), and by The Distance on the Complex Numbers (i).
Second, let with ; then , as . As is a map , holds exactly for and exactly for , and these are complex numbers. By Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi), applied to and , the formula then holds exactly when and , that is, for ; exactly for ; and exactly when and , that is, as and is a field (The Complex Numbers: Pairs of Real Numbers with Their Addition and Multiplication, and the Imaginary Unit (v)), for (Negatives, Differences, Reciprocals and Quotients (ii)). For such , holds exactly for , as in the first step. So 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 The Complex Derivative at a Point (i), if and only if is a complex derivative of at . Consequently holds, with assigned to , if and only if has a complex derivative at , that is, is complex differentiable at .
What says. Let sets , and be assigned to , and . By the paragraph on openness and maps and by Subclasses and Subsets (i), the first four conjuncts of hold exactly when and is open in , is a map , , and is open in ; if one of them fails, fails, and so does the condition of (i). If they hold, then every lies in , so by the previous paragraph, with assigned to , the last conjunct says that is complex differentiable at every point of , that is, by Holomorphic Functions and Their Derivatives (i), that is holomorphic on . So is a predicative formula in , in the sense of Renaming and Substituting Variables in Predicative Formulas, expressing the condition of (i) 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).
The class of holomorphic functions. Let be an open subset of and let be open in ; and are sets, being subclasses 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)). Apply The Class Comprehension Theorem for Predicative Formulas (i) to with its abbreviations eliminated, with as its single variable and and (assigned and ) and the parameters of the statement as its parameters. 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 holomorphic on . Every element of is a set (Classes, Membership, Sets and Proper Classes (i)), and so is every map , as an element of the class of functions from to (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 holomorphic on . This proves (ii).
Loadingβ¦