Writes the defining condition of I(a,b) as a predicative formula over the parameters for R and its order, uses it to express z = I(s,t) from formulas for s and t, and obtains the map i -> , from the scheme for maps given by expressions.
Terms under , their values and terms of a type are as in Terms and Typed Terms under a Guard (i) and Terms and Typed Terms under a Guard (ii); throughout, the parameters have their fixed values, as in Conditions Expressed by a Predicative Formula, and Guards (i). is a set and is a total order on it, by The Real Numbers (i), and is its strict relation.
Proof of (i). By Intervals of the Real Line (ii) and Intervals of the Real Line (iii), for the set is , where is, according to the form of , one of , , , , , , and . Let , and be distinct set variables other than and , and let be a set variable that is none of , , , and . Let be with each part written and each part written . 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 (iii) and Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (ii), for all , holds if and only if does. Let be the formula . It applies no quantifier to a class variable, so it is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), and its free variables are among , , , and . Let . The class of Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii) is a subclass of , hence a set by 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 it satisfies by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i); two sets satisfying have the same elements, so they are equal by Axiom of Extensionality for Classes. So exactly one set satisfies . Its elements are the with , that is, with , so it is by Axiom of Extensionality for Classes; it is a subset of , so it lies in by The Union Set and the Power Set of a Set (ii). By Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (viii), is therefore a defined set symbol given by , used properly wherever .
Proof of (ii). Values. Under an assignment satisfying , the values of and of lie in by Terms and Typed Terms under a Guard (iii), so the value of is a set in by (i), determined by , and the values of the parameters. So is a term under satisfying Terms and Typed Terms under a Guard (iii) with .
The formula. Let be a set variable that is none of , is not free in and does not occur in ; as and occur in , is neither of them. The set variables form an infinite list by Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (i), so there are distinct set variables and that are none of and and occur neither in nor in ; in particular they are not or , and they do not occur in or . By (i), applied to the distinct set variables , and , there is a predicative formula , with free variables among , , , and , such that for all the only set satisfying is . By Terms and Typed Terms under a Guard (iv) there are predicative formulas and expressing and . By Conditions Expressed by a Predicative Formula, and Guards (ii), the free variables of are among , and the parameters of and , and those of among , and the parameters of and ; so is free in neither, is not free in , and is not free in . Let be the formula . It applies no quantifier to a class variable, so it is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), and its free variables are among , and the parameters of and . Consider an assignment of sets to and . Since is not free in , holds for sets assigned to and if and only if holds and is the value of ; likewise, since is not free in , holds if and only if holds and is the value of . So holds if and only if holds and , where when holds; that is, if and only if holds and . So expresses , Terms and Typed Terms under a Guard (iv) holds, and is of type by Terms and Typed Terms under a Guard (ii).
Proof of (iii). is a set by The Union Set and the Power Set of a Set (ii). For , and are values of maps at an element of their domain, defined set symbols used properly by Functions, Values of a Function, and Functions from One Class to Another (ii), and they lie in by Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (ii); so by (i) the expression is built from defined set symbols used properly and lies in . So Maps and Relations Given by Formulas (i), with , and the expression for , gives exactly one map as stated.
Loading…