Throughout, formulas are written with abbreviations; each formula below quantifies over set variables only and is therefore predicative, its bound variables being renamed apart from the other variables in play where needed (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)). For a function F and a set u in its domain, (u,v)∈F holds exactly for v=F(u) (Functions, Values of a Function, and Functions from One Class to Another (ii)), and μ(F,A,B) is 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 F is a map F:A→B.
Proof of (i). Let a,b,c,e,f,p,s,x,y,z be further set variables. Let δ(S,d) be
∃c(∀p(p∈c⇔∃x∃y(x∈S∧y∈S∧p=(x,y)))∧μ(d,c,R)).
The only c satisfying its first conjunct is the Cartesian product S×S, so δ(S,d) holds exactly when d is a map S×S→R. Let κ(S,d) be
∀x∀y∀z∀a∀b∀e∀f∀s((x∈S∧y∈S∧z∈S∧((x,y),a)∈d∧((y,x),b)∈d∧((x,z),e)∈d∧((y,z),f)∈d∧((a,f),s)∈+)⇒((0,a)∈≤∧(a=0⇔x=y)∧a=b∧(e,s)∈≤)).
When δ(S,d) holds and x,y,z∈S, its premises single out a=d(x,y), b=d(y,x), e=d(x,z), f=d(y,z) and s=d(x,y)+d(y,z) (Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (xi) for the sum), so κ(S,d) states the four conditions of Metric Space (i). Hence
χ(S,d)=δ(S,d)∧κ(S,d)
expresses that (S,d) is a metric space (Metric Space (vi)); its parameters are R, ≤, + and 0.
Proof of (ii). Let z be a further set variable. By Open Ball in a Metric Space (ii), y∈Bd(x,r) means y∈S and d(x,y)<r, so the condition is expressed by
χ(S,d)∧x∈S∧r∈R∧(0,r)∈<∧y∈S∧∃z(((x,y),z)∈d∧(z,r)∈<),
whose parameters are R, ≤, <, + and 0.
Proof of (iii). Let ω(U,S,d) be the formula ω(U) of The Open Sets of a Metric Space Form a Set, Given by a Predicative Formula (i) with S in place of X. That clause holds for every metric space (X,d), a statement about parameters holding for all their values satisfying its hypotheses (Conditions Expressed by a Predicative Formula, and Guards (i)). So under every assignment for which (S,d) is a metric space, ω(U,S,d) holds if and only if U⊆S and U is open in (S,d), that is, U∈Td (The Open Sets of a Metric Space Form a Set, Given by a Predicative Formula (ii)). Hence χ(S,d)∧ω(U,S,d) expresses the condition, with parameters R, ≤, <, + and 0.
Proof of (iv). Let A,c,f,n,w be further set variables, and let ς(G,Y) be the conjunction of the four formulas
∀A(A∈G⇒∀w(w∈A⇒w∈Y)),Y∈G,
∀A(A∈G⇒∃c(∀w(w∈c⇔(w∈Y∧w∈/A))∧c∈G)),
∀f(μ(f,N,G)⇒∃c(∀w(w∈c⇔∃n∃A(n∈N∧(n,A)∈f∧w∈A))∧c∈G)).
The first says G⊆P(Y) (The Union Set and the Power Set of a Set (ii)). In the third, the only c with the stated elements is the difference Y∖A. In the fourth, the sets f with μ(f,N,G) are the sequences (An) in G, and the only c with the stated elements is the union ⋃n∈NAn, 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 ς(G,Y), whose only parameter is N, holds if and only if G is a σ-algebra on Y (σ-Algebra and Measurable Space (i)).
Proof of (v). Let G,U,w be further set variables and let β(B,S,d) be
χ(S,d)∧∀w(w∈B⇒w∈S)∧∀G((ς(G,S)∧∀U(ω(U,S,d)⇒U∈G))⇒B∈G).
If (S,d) is not a metric space, β(B,S,d) and the condition both fail. Let (S,d) be a metric space. Then B(S,d)=σ(Td) (Borel Sigma-Algebra of a Metric Space (i)), and by The σ-Algebra Generated by a Set of Subsets (ii), B∈σ(Td) if and only if B⊆S and B∈G for every σ-algebra G on S with Td⊆G. By (iv), as proved above, ς(G,S) says that G is a σ-algebra on S; and by the property of ω shown in the proof of (iii), ∀U(ω(U,S,d)⇒U∈G) says Td⊆G. So β(B,S,d) expresses the condition, with parameters R, ≤, <, +, 0 and N.
Proof of (vi). Let Ω, and Σ, D and Ξ, be parameters whose values are Ω and the functions giving the families (Sj)j∈J, (dj)j∈J and (Xj)j∈J, and let j,z,s,e,x,A,G,B,c,w,y be set variables. Let π(c,B) be ∀w(w∈c⇔∃y(y∈B∧(w,y)∈x)), the formula of Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i) with c, B and x for its z, V and u, and let θ(z,j) be
∃s∃e∃x((j,s)∈Σ∧(j,e)∈D∧(j,x)∈Ξ∧∀A(A∈z⇔(∀w(w∈A⇒w∈Ω)∧∀G((ς(G,Ω)∧∀B(β(B,s,e)⇒∃c(π(c,B)∧c∈G)))⇒A∈G)))).
Let j∈J. The only sets s, e and x satisfying the first three conjuncts are Sj, dj and Xj, and Xj is a map Ω→Sj (Probability Spaces, Events and Random Elements (iii)). For every set B, the only c with π(c,B) is Xj−1(B) (Preimages under a Map: Membership, the Preimage Map, Sequences of Preimages, and the Set of Sets with Preimage in a Given Set (i)), and β(B,Sj,dj) holds if and only if B∈B(Sj), by (v) as proved above. So, with Cj={Xj−1(B):B∈B(Sj)}, the subset of P(Ω) of σ-Algebras Generated by Random Elements (i), the inner formula says that A⊆Ω and A∈G for every σ-algebra G on Ω with Cj⊆G, which by The σ-Algebra Generated by a Set of Subsets (ii) means A∈σ(Cj)=σ(Xj). Thus θ(z,j) holds exactly when z and σ(Xj) have the same elements, that is, when z=σ(Xj). So σ(Xj) is a defined set symbol with argument j, given by θ and used properly at every j∈J. As σ(Xj) is a σ-algebra on Ω (σ-Algebras Generated by Random Elements (i)), σ(Xj)⊆P(Ω), that is, σ(Xj)∈P(P(Ω)) (σ-Algebra and Measurable Space (i), The Union Set and the Power Set of a Set (ii)). By Maps and Relations Given by Formulas (i), with J for a, P(P(Ω)) for b and σ(Xj) for t(j), exactly one map G:J→P(P(Ω)) has G(j)=σ(Xj) for every j∈J; it is a family indexed by J. Any family (Gj′)j∈J with Gj′=σ(Xj) for every j∈J is a function with domain J and range contained in P(P(Ω)), hence a map J→P(P(Ω)) (Functions, Values of a Function, and Functions from One Class to Another (iii)), and so it is G.
Proof of (vii). Let Ξ and Γ be parameters whose values are the functions giving (Xj)j∈J and (gj)j∈J, let j,z,x,h,p,u,v,w be set variables, and let θ′(z,j) be
∃x∃h((j,x)∈Ξ∧(j,h)∈Γ∧∀p(p∈z⇔∃u∃v∃w((u,v)∈x∧(v,w)∈h∧p=(u,w)))).
Let j∈J. The only x and h satisfying the first two conjuncts are Xj and gj, so by Relations, Domain, Range, Inverse and Composition (v) the only set z with θ′(z,j) is the composite gj∘Xj=gj(Xj), which is a map Ω→Tj by Basic Properties of Functions: Equality, Composition, Identity, Inverse and Restriction (ii). Thus gj(Xj) is a defined set symbol with argument j, given by θ′ and used properly at every j∈J. Let U=⋃j∈JTj, 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). Every element of gj(Xj) is an ordered pair (u,w) with u∈Ω and w∈Tj⊆U (Functions, Values of a Function, and Functions from One Class to Another (iii), Indexed Families of Sets and Their Union, Intersection and Product (ii)), so gj(Xj)∈P(Ω×U). As in the proof of (vi), Maps and Relations Given by Formulas (i) with J for a, P(Ω×U) for b and gj(Xj) for t(j) gives exactly one map J→P(Ω×U) with value gj(Xj) at every j∈J, and every family with these values is such a map, hence equal to it.