Separability is written with the metric kit's formula, the countability formula and a formula saying every ball meets the set; for normed spaces the formula quantifies over the norm metric, which a predicative formula singles out. Renaming moves the formulas to any positions, and class comprehension gives the class of separable metrics.
Throughout, formulas are written with abbreviations and quantify over set variables only, so they are predicative. The parameters , , , , , and are variables other than and other than the bound variables below; and are sets, being elements of . Elements of classes are sets (Classes, Membership, Sets and Proper Classes (i)), and a one-entry tuple is (The Ordered Pair of Two Sets and Nested Tuples (ii)). For sets and , abbreviates , the strict order of . We first build formulas in the set variables and move them to the given positions at the end; the letters denote further set variables.
Separable metric spaces. Write and for and . By Kit for def:metric-space (vi) with , and , there is a predicative formula in , with parameters among , , and , that expresses ; its bound variables are chosen other than the letters above. Let be the formula of Countability as a Predicative Condition, and Finite Powers of a Set as a Typed Term (i) with for its , its bound variables chosen other than , , and the letters listed above, and its parameter having the value , a set by The Set of Natural Numbers and the Number One (i): for every set , holds exactly when is countable. Let
Assume , and let . For the pair lies in (Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (i)), so, being a function, holds exactly for , a real number, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x). Hence, for and a real number , the existential part of , whose premise names this value, says that some satisfies , and (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii)), that is, by Open Ball in a Metric Space (ii) and The Boolean Operations on Classes, Disjointness, and the Universal Class (i), that (this class is 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), being a subclass of , and the empty set is the only set with no element). Thus holds exactly when is dense in . The subsets of are exactly the sets with (Subclasses and Subsets (i)). So, under , the second conjunct of holds exactly when has a countable subset that is dense in , that is, by Separable Metric Space and Separable Real Normed Space (i), exactly when is separable. As expresses , the formula , with parameters among , , , and , expresses the condition of (i) with and .
The norm metric. Now write , , , and for , , , and . By Kit for def:normed-space (vi) with and the positions , there is a predicative formula in , with parameters among , , , , and , that expresses ; its bound variables are chosen other than the letters above. Let
Assume . Then is a binary operation on (Vector Space over a Field (ix)), so for sets , and , holds exactly when and (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi)). Hence says that and for every , which holds exactly for , the zero vector. For , then says that there is with and ; the only such is the negative , so holds exactly for , the difference . For variables and let be the formula , 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), which holds exactly when is a map , and let
The only set with is the Cartesian product , which is a set by Membership in a Cartesian Product, and the Cartesian Product of Two Sets Is a Set (ii); so, by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii), the first conjunct of holds exactly when is a map . When it does, for the premises of the second conjunct name , and , by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (x), the function having domain ; and a universally quantified implication whose premises name values in this way states the property of the named values given in its conclusion (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (ii)). So holds exactly when is a map with
that is, by The Norm Metric of a Real Normed Space (i) and Maps between Classes: Values, Pairs, Extensionality, Restrictions, Constant Maps and Preimages (iii), exactly when is the norm metric .
Separable real normed spaces. By Renaming and Substituting Variables in Predicative Formulas (i) with and , the formula is a predicative formula in that holds exactly when holds with assigned and assigned , that is, exactly when is a map , is a metric space and is separable. Let
Its free variables are among and the parameters , , , , , and . Under an assignment of sets to , the second conjunct holds exactly when some set satisfies and (Formulas of the Language of Class Theory, Free Variables, Predicative Formulas and Abbreviations (iv)). Under , the only set satisfying is (a set, being an element of the class of functions from to by The Elements of the Class of Functions from a Set to a Set, and This Class Is a Set (i)); so the second conjunct holds exactly when is a map , is a metric space and is separable. The first two of these hold: is a map by The Norm Metric of a Real Normed Space (i) and a metric on by The Norm Metric of a Real Normed Space (ii), so is a metric space by Metric Space (vi). Hence, under , the second conjunct holds exactly when is separable, that is, by Separable Metric Space and Separable Real Normed Space (ii), exactly when is separable. As expresses , the formula expresses the condition of (ii) with , addition , scalar multiplication and .
Any positions. Thus is a predicative formula in and one in , in the sense of Renaming and Substituting Variables in Predicative Formulas. By Renaming and Substituting Variables in Predicative Formulas (i) with and for , and with , , and for (the given being the first of the distinct set variables there, so that above are distinct from whatever is), the formulas and are predicative formulas in that hold, under every assignment of sets to , exactly when and hold with their variables assigned the sets assigned to and to . This proves (i) and (ii).
The class of separable metrics. Let be a set. Apply The Class Comprehension Theorem for Predicative Formulas (i) to , with as its single variable and , , , , and as its parameters, being assigned . It gives a class such that, for every set , if and only if holds with assigned and assigned , that is, by the above and Metric Space (vi), exactly when is a map that is a metric on with separable. As the elements of and these maps are all sets (such a map lies in the class , as did above), the same holds for every class , which proves (iii).
Loadingβ¦