The three defining conditions are written out as formulas quantifying over set variables only, sequences in G being ranged over by a set variable since a map on the set of natural numbers is a set; restricted class abstraction from the power set of the power set of X then gives the three sets.
The formulas. Let , , , , , , , , and be distinct set variables other than , and . 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 for , and , and let and be 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). Let
and let be , be , and be . The free variables of and are among , and , and those of among and .
Predicativity. is predicative 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), and the pair memberships are predicative 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). The formulas , and are built from these and from atomic formulas by connectives and by quantifiers over the set variables listed above only; so no quantifier in them 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).
Meaning of the parts. Fix a set . By Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (vii), with and for its and , a set lies in if and only if ; so holds if and only if every element of lies in , that is, by Subclasses and Subsets (i), if and only if . For sets and , and are sets by Sets and Maps: Ordinary Notation (iv), and by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ix) a set satisfies if and only if , and if and only if . Hence holds if and only if for every , and if and only if for all .
The sequences in are ranged over by the set variable . 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), a set satisfies if and only if is a map , that is, by Sequences (i), a sequence in ; and every sequence in is a set, by Images of Sets under Functions Are Sets, and a Function with a Set Domain Is a Set (ii), its domain being a set. So states a property of every sequence in . Let be such a sequence. 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 Values, Restriction and Equality of a Map, and the Map as a Defined Set Symbol (i), for and every set , holds if and only if . Hence the formula holds if and only if for some , that is, by Indexed Families of Sets and Their Union, Intersection and Product (ii) and Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i), being a family indexed by , if and only if . This union is a set by The Union and Product of a Family of Sets Indexed by a Set, and the Intersection of a Family with an Inhabited Index Class, Are Sets (i), so a set satisfies the first conjunct of if and only if , by Axiom of Extensionality for Classes; thus holds if and only if . In the same way, holds if and only if, for all with , no set lies in both and , that is, by The Boolean Operations on Classes, Disjointness, and the Universal Class (ii), and are disjoint.
Proof of the first sentences of (i), (ii) and (iii). By the meanings above, for every set : holds if and only if , , for every , and for every sequence in , that is, by σ-Algebra and Measurable Space (i), if and only if is a -algebra on ; holds if and only if and for all , that is, by π-System (i), if and only if is a -system on ; and holds if and only if , , for every , and for every sequence in whose terms are pairwise disjoint, that is, by λ-System (i), if and only if is a -system on . So , and express these conditions, as in Conditions Expressed by a Predicative Formula, and Guards (ii), with for .
Proof of the second sentences. Let be one of , and , and let `` is a -system'' mean the condition it expresses. By The Union Set and the Power Set of a Set (ii), applied twice, is a set; take it and as further parameters. The formula is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), so the class
of Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii) is a set by Sets and Maps: Ordinary Notation (iii), and by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i) and Subclasses and Subsets (i). Let be a set. By Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i) and Subclasses and Subsets (i), if and only if , is a -system and . A -system satisfies , by , so by The Union Set and the Power Set of a Set (ii); hence if and only if is a -system with . If is a set with the same property, then and have the same elements, and by Axiom of Extensionality for Classes.
Loading…