TheoremBase

The relation comes from class comprehension restricted to pairs of sets, the map is that relation for the formula conjoined with membership in A and B, and the sections come from the map clause with each value given by separation.

Proof

Throughout, every element of a class is a set (Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (i)).

The relation ((i)). By The Class Comprehension Theorem for Predicative Formulas (i), applied with n=2n=2 to ψ\psi and its parameters, there is a class ZZ such that ⟨u,v⟩∈Z\langle u,v\rangle\in Z if and only if ψ(u,v)\psi(u,v), for all sets uu and vv; here ⟨u,v⟩=(u,v)\langle u,v\rangle=(u,v) by The Ordered Pair of Two Sets and Nested Tuples (ii). Let Rψ=Z∣VR_{\psi}=Z|_{V} be the restriction of ZZ to the universal class VV. Its elements are ordered pairs, so it is a relation by Relations, Domain, Range, Inverse and Composition (i); and since every set lies in VV, for all sets uu and vv we have (u,v)∈Rψ(u,v)\in R_{\psi} if and only if (u,v)∈Z(u,v)\in Z, that is, if and only if ψ(u,v)\psi(u,v).

Maps ((ii)). The formula u∈A∧v∈B∧ψ(u,v)u\in A\wedge v\in B\wedge\psi(u,v) is predicative, with AA and BB as further class parameters; let ff be the relation that (i) gives for it. If (u,v)∈f(u,v)\in f and (u,vβ€²)∈f(u,v')\in f, then u∈Au\in A, v,vβ€²βˆˆBv,v'\in B, ψ(u,v)\psi(u,v) and ψ(u,vβ€²)\psi(u,v'), so v=vβ€²v=v' by the second hypothesis, and ff is a function. Every first component of an element of ff lies in AA, and every u∈Au\in A is one, by the first hypothesis; so the domain of ff is AA. Every second component lies in BB, so the range of ff is contained in BB, and f:Aβ†’Bf:A\to B by Functions, Values of a Function, and Functions from One Class to Another (iii). Finally, for u∈Au\in A we have (u,f(u))∈f(u,f(u))\in f by Functions, Values of a Function, and Functions from One Class to Another (ii), hence ψ(u,f(u))\psi(u,f(u)).

Families of sections ((iii)). Let Ο‡(u,v)\chi(u,v) be the formula βˆ€w (w∈v⇔(w∈b∧(u,w)∈R))\forall w\,(w\in v\Leftrightarrow(w\in b\wedge(u,w)\in R)), predicative with the parameters bb and RR 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). We check the hypotheses of (ii) for Ο‡\chi, AA and B=P(b)B=\mathcal{P}(b). Let u∈Au\in A. By Axiom of Separation for Classes, applied to the set bb and the image R[{u}]R[\{u\}] of the singleton of uu, there is a set zz such that, for every set ww, w∈zw\in z if and only if w∈bw\in b and w∈R[{u}]w\in R[\{u\}], that is, since uu is the only element of {u}\{u\}, if and only if w∈bw\in b and (u,w)∈R(u,w)\in R. Thus Ο‡(u,z)\chi(u,z) holds, and zβŠ†bz\subseteq b, so z∈P(b)z\in\mathcal{P}(b) by The Union Set and the Power Set of a Set (ii). If Ο‡(u,v)\chi(u,v) and Ο‡(u,vβ€²)\chi(u,v'), then vv and vβ€²v' have the same elements, so v=vβ€²v=v' by Axiom of Extensionality for Classes. Hence (ii) gives a map f:Aβ†’P(b)f:A\to\mathcal{P}(b) with Ο‡(u,f(u))\chi(u,f(u)) for every u∈Au\in A, which is the displayed property.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…