The condition defining C(A) is written as a predicative formula, using typed terms for the differences − , their map, its sum and the intervals, so C(A) is a subset of [0,∞] by set-builder notation; the map of infima then comes from the general construction of maps defined by infima.
Proof of (i). Let . For sequences and in with for every , is a sequence in (Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (iii)) and the union is that of this family, so the inclusion says that every lies in for some , by Indexed Families of Sets and Their Union, Intersection and Product (ii); and lies in . So is the class of all satisfying the condition "there are such sequences with ". We show that this condition is expressed by a predicative formula whose parameters are , , , , the order , the operations and and the elements and of , , and its order , , , the sum on , and the order and the addition of , and which quantifies over sets only, the sequences in it being elements of the set of The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (ii). The class variables for these parameters are chosen pairwise distinct whenever their values differ: in particular the order of and the order of are different variables, although Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (ii) and Sums of Sequences in [0,∞] as Typed Terms and as a Map (i) both write for theirs, and likewise of and the sum on . Then is a subset of given by set-builder notation as in Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices (iv), and its elements are exactly the sets satisfying the condition, as stated.
The sequences are values of set variables and of the formula, not fixed maps. Let be the formula , a guard on and , and the guard on , and ; they are predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). If is a map with domain and , then for every set , if and only if , by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x), and likewise for ; so holds exactly when and are sequences in with for every . The formula thus expresses , and , so is a term of type under by Terms and Typed Terms under a Guard (ii), and so is .
The difference is the value of the subtraction of the ordered field at the pair : by Predicative Substitution of Values of Functions and Binary Operations, and Predicative Formulas for Negatives, Differences, Absolute Values, Distances, Reciprocals and Quotients in an Ordered Field (iv) there is a predicative formula , with , , , , and as parameters, that holds if and only if , and ; hence , predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), expresses , since under the only such and are and ; and as , is a term of type under . Thus is an expression built from the defined set symbols , and , given by the formulas above, with no class abstraction, used properly and lying in for all and satisfying and every . So Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (v), with and for its and , and for its and , for its , for its and for its , gives a predicative formula such that, for all and satisfying , the only set with is the map from to . Hence expresses " holds and is the map ", and this map is an element of by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i); so is a term of type under , by Terms and Typed Terms under a Guard (ii).
By Sums of Sequences in [0,∞] as Typed Terms and as a Map (i), with , its order, , the sum on , , and the order and the addition of as the values of its , , , , , and , the sum is a term of type under ; and by Intervals of the Real Line as Defined Set Symbols, Typed Terms and Values of Maps (ii), with and its order as the values of its and , the interval is a term of type under . By Terms and Typed Terms under a Guard (iv), predicative formulas then express and , for set variables and occurring in neither term; is expressed under by with the latter formula; and the condition is applied to the conjunction of , and , so expressed, which is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i). This is the predicative formula claimed above, which proves (i).
Proof of (ii). Let . By (i), is a subset of , hence of (The Extended Real Line, Its Order, and [0,∞] (ii)); so it has an infimum in by Order and Suprema in the Extended Real Line (iii), and by Order and Suprema in the Extended Real Line (ix). The elements of are exactly the subsets of (The Union Set and the Power Set of a Set (ii)), and is the class given, with as its argument, by the predicative condition of the proof of (i), in which occurs only as a set and may be taken as a set variable. So Predicative Formulas for Suprema and Infima, and Maps Defined by Suprema and Infima (iii), with for its , and for its and ( being a total order by Order and Suprema in the Extended Real Line (i), hence a partial order by Partial and Total Orders on a Set and the Associated Strict Relation (ii)), and for its , gives exactly one map with for every . Its values lie in , so is a map into by Functions, Values of a Function, and Functions from One Class to Another (iii); and any map with these values is also one into , hence equal to . This proves (ii).
Loading…