The two clauses are proved together: the condition that a set is a preimage c_j⁻¹(B) for some index j and Borel set B is expressed by a predicative formula, built from the typed term c_j⁻¹(B), and set-builder inside the power set gives the set.
One argument serves both clauses. For (i) let , and for ; for (ii) let , and for . In both cases is a set, , and being sets by Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices (v) and by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii). The identities and are maps by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (iii). By Component Maps of a Map into , Entry Maps of a Map into Matrices, and Maps Assembled from Them (i), applied to , and by Component Maps of a Map into , Entry Maps of a Map into Matrices, and Maps Assembled from Them (ii), applied to , is a map into the set of maps . By Borel Sigma-Algebra of a Metric Space (ii), Borel Sigma-Algebra of a Metric Space (i) and Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii), is a -algebra on , so by σ-Algebra and Measurable Space (i).
The condition is predicative. Let and be distinct set variables, and let be the formula , with the parameters and ; it is predicative, having no quantifier, so it is a guard for the variables and . Under every assignment satisfying , and , so is a term of type and a term of type under , by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (i); then , written with the parameter , is a term of type under by Typed Terms under a Predicative Guard: Variables, Parameters, Values of Maps and Ordered Pairs, and Predicative Equations and Memberships between Them (iii), and is a term of type under by Preimages, Unions and Intersections over an Index Set, Suprema and Infima, and Superlevel Sets as Typed Terms (i). Its value under an assignment satisfying is , the preimage, which is the defined set symbol of Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i). Let be a set variable other than and that occurs in none of the parameters. By Terms and Typed Terms under a Guard (iv), there is a predicative formula , with free variables among , , and the parameters, expressing the condition : for all sets , and , holds if and only if , and . Let be the formula . Its quantifiers bind set variables only, so it is predicative by Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (v), and for every set , holds if and only if holds for some sets assigned to 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 (i)), that is, if and only if for some and some .
The set. Let , formed by Sets and Maps: Ordinary Notation (iii) from the predicative formula ; it is a set and a subset of . Let be a set. If , then holds, so for some and . Conversely, if for such and , then by Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i), so by The Union Set and the Power Set of a Set (ii), and holds, so . Hence has the stated property. Two sets with this property have the same elements, so they are equal by Class Theory NBG: the Axioms, Standing Conventions and Basic Notation (ii).
In the case of (i), for , and is the set required there. In the case of (ii), an element of is a pair with and , by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i), and ; so for some if and only if for some and , and is the set required there.
Loading…