TheoremBase

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.

Proof

The formulas. Let aa, bb, cc, mm, nn, uu, vv, ww, w′w' and zz be distinct set variables other than GG, XX and N\mathbb{N}. Let μ(a,N,G)\mu(a,\mathbb{N},G) 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 aa, N\mathbb{N} and GG for FF, AA and BB, and let (n,b)∈a(n,b)\in a and (m,b)∈a(m,b)\in a 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

β(G): ∀w (w∈G⇒∀v (v∈w⇒v∈X)),κ(G): ∀w (w∈G⇒∃z (∀v (v∈z⇔(v∈X∧v∉w))∧z∈G)),ι(G): ∀w ∀w′ ((w∈G∧w′∈G)⇒∃z (∀v (v∈z⇔(v∈w∧v∈w′))∧z∈G)),υ(a,G): ∃z (∀u (u∈z⇔∃n (n∈N∧∃b ((n,b)∈a∧u∈b)))∧z∈G),δ(a): ∀m ∀n ((m∈N∧n∈N∧¬ m=n)⇒∀b ∀c (((m,b)∈a∧(n,c)∈a)⇒¬∃u (u∈b∧u∈c))),\begin{aligned} \beta(G)&:\ \forall w\,\bigl(w\in G\Rightarrow\forall v\,(v\in w\Rightarrow v\in X)\bigr),\\ \kappa(G)&:\ \forall w\,\Bigl(w\in G\Rightarrow\exists z\,\bigl(\forall v\,(v\in z\Leftrightarrow(v\in X\wedge v\notin w))\wedge z\in G\bigr)\Bigr),\\ \iota(G)&:\ \forall w\,\forall w'\,\Bigl((w\in G\wedge w'\in G)\Rightarrow\exists z\,\bigl(\forall v\,(v\in z\Leftrightarrow(v\in w\wedge v\in w'))\wedge z\in G\bigr)\Bigr),\\ \upsilon(a,G)&:\ \exists z\,\Bigl(\forall u\,\bigl(u\in z\Leftrightarrow\exists n\,(n\in\mathbb{N}\wedge\exists b\,((n,b)\in a\wedge u\in b))\bigr)\wedge z\in G\Bigr),\\ \delta(a)&:\ \forall m\,\forall n\,\Bigl((m\in\mathbb{N}\wedge n\in\mathbb{N}\wedge\neg\,m=n)\Rightarrow\forall b\,\forall c\,\bigl(((m,b)\in a\wedge(n,c)\in a)\Rightarrow\neg\exists u\,(u\in b\wedge u\in c)\bigr)\Bigr), \end{aligned}

and let Σ(G)\Sigma(G) be β(G)∧X∈G∧κ(G)∧∀a (μ(a,N,G)⇒υ(a,G))\beta(G)\wedge X\in G\wedge\kappa(G)\wedge\forall a\,(\mu(a,\mathbb{N},G)\Rightarrow\upsilon(a,G)), Π(G)\Pi(G) be β(G)∧ι(G)\beta(G)\wedge\iota(G), and Λ(G)\Lambda(G) be β(G)∧X∈G∧κ(G)∧∀a ((μ(a,N,G)∧δ(a))⇒υ(a,G))\beta(G)\wedge X\in G\wedge\kappa(G)\wedge\forall a\,((\mu(a,\mathbb{N},G)\wedge\delta(a))\Rightarrow\upsilon(a,G)). The free variables of Σ\Sigma and Λ\Lambda are among GG, XX and N\mathbb{N}, and those of Π\Pi among GG and XX.

Predicativity. μ(a,N,G)\mu(a,\mathbb{N},G) 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 Σ\Sigma, Π\Pi and Λ\Lambda 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 GG. By Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (vii), with XX and P(X)\mathcal{P}(X) for its uu and zz, a set ww lies in P(X)\mathcal{P}(X) if and only if ∀v (v∈w⇒v∈X)\forall v\,(v\in w\Rightarrow v\in X); so β(G)\beta(G) holds if and only if every element of GG lies in P(X)\mathcal{P}(X), that is, by Subclasses and Subsets (i), if and only if G⊆P(X)G\subseteq\mathcal{P}(X). For sets ww and w′w', X∖wX\setminus w and w∩w′w\cap w' 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 zz satisfies ∀v (v∈z⇔(v∈X∧v∉w))\forall v\,(v\in z\Leftrightarrow(v\in X\wedge v\notin w)) if and only if z=X∖wz=X\setminus w, and ∀v (v∈z⇔(v∈w∧v∈w′))\forall v\,(v\in z\Leftrightarrow(v\in w\wedge v\in w')) if and only if z=w∩w′z=w\cap w'. Hence κ(G)\kappa(G) holds if and only if X∖A∈GX\setminus A\in G for every A∈GA\in G, and ι(G)\iota(G) if and only if A∩B∈GA\cap B\in G for all A,B∈GA,B\in G.

The sequences in GG are ranged over by the set variable aa. 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 aa satisfies μ(a,N,G)\mu(a,\mathbb{N},G) if and only if aa is a map a:N→Ga:\mathbb{N}\to G, that is, by Sequences (i), a sequence (an)(a_{n}) in GG; and every sequence in GG is a set, by Images of Sets under Functions Are Sets, and a Function with a Set Domain Is a Set (ii), its domain N\mathbb{N} being a set. So ∀a (μ(a,N,G)⇒… )\forall a\,(\mu(a,\mathbb{N},G)\Rightarrow\dots) states a property of every sequence in GG. Let a:N→Ga:\mathbb{N}\to G 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 u↦t(u)u\mapsto t(u) as a Defined Set Symbol (i), for n∈Nn\in\mathbb{N} and every set bb, (n,b)∈a(n,b)\in a holds if and only if b=anb=a_{n}. Hence the formula ∃n (n∈N∧∃b ((n,b)∈a∧u∈b))\exists n\,(n\in\mathbb{N}\wedge\exists b\,((n,b)\in a\wedge u\in b)) holds if and only if u∈anu\in a_{n} for some n∈Nn\in\mathbb{N}, 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), aa being a family indexed by N\mathbb{N}, if and only if u∈⋃n∈Nanu\in\bigcup_{n\in\mathbb{N}}a_{n}. 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 zz satisfies the first conjunct of υ(a,G)\upsilon(a,G) if and only if z=⋃n∈Nanz=\bigcup_{n\in\mathbb{N}}a_{n}, by Axiom of Extensionality for Classes; thus υ(a,G)\upsilon(a,G) holds if and only if ⋃n∈Nan∈G\bigcup_{n\in\mathbb{N}}a_{n}\in G. In the same way, δ(a)\delta(a) holds if and only if, for all m,n∈Nm,n\in\mathbb{N} with m≠nm\neq n, no set lies in both ama_{m} and ana_{n}, that is, by The Boolean Operations on Classes, Disjointness, and the Universal Class (ii), ama_{m} and ana_{n} are disjoint.

Proof of the first sentences of (i), (ii) and (iii). By the meanings above, for every set GG: Σ(G)\Sigma(G) holds if and only if G⊆P(X)G\subseteq\mathcal{P}(X), X∈GX\in G, X∖A∈GX\setminus A\in G for every A∈GA\in G, and ⋃n∈NAn∈G\bigcup_{n\in\mathbb{N}}A_{n}\in G for every sequence (An)(A_{n}) in GG, that is, by σ-Algebra and Measurable Space (i), if and only if GG is a σ\sigma-algebra on XX; Π(G)\Pi(G) holds if and only if G⊆P(X)G\subseteq\mathcal{P}(X) and A∩B∈GA\cap B\in G for all A,B∈GA,B\in G, that is, by π-System (i), if and only if GG is a π\pi-system on XX; and Λ(G)\Lambda(G) holds if and only if G⊆P(X)G\subseteq\mathcal{P}(X), X∈GX\in G, X∖A∈GX\setminus A\in G for every A∈GA\in G, and ⋃n∈NAn∈G\bigcup_{n\in\mathbb{N}}A_{n}\in G for every sequence (An)(A_{n}) in GG whose terms are pairwise disjoint, that is, by λ-System (i), if and only if GG is a λ\lambda-system on XX. So Σ\Sigma, Π\Pi and Λ\Lambda express these conditions, as in Conditions Expressed by a Predicative Formula, and Guards (ii), with GG for x1x_{1}.

Proof of the second sentences. Let Θ\Theta be one of Σ\Sigma, Π\Pi and Λ\Lambda, and let ``GG is a Θ\Theta-system'' mean the condition it expresses. By The Union Set and the Power Set of a Set (ii), applied twice, P(P(X))\mathcal{P}(\mathcal{P}(X)) is a set; take it and C\mathcal{C} as further parameters. The formula Θ(G)∧∀w (w∈C⇒w∈G)\Theta(G)\wedge\forall w\,(w\in\mathcal{C}\Rightarrow w\in G) is predicative by Predicativity of Expressions with Abbreviations, and Symbol-Free Forms of the Basic Defined Set Symbols (i), so the class

S={G∈P(P(X)):Θ(G)∧∀w (w∈C⇒w∈G)}\mathcal{S}=\{G\in\mathcal{P}(\mathcal{P}(X)):\Theta(G)\wedge\forall w\,(w\in\mathcal{C}\Rightarrow w\in G)\}

of Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (ii) is a set by Sets and Maps: Ordinary Notation (iii), and S⊆P(P(X))\mathcal{S}\subseteq\mathcal{P}(\mathcal{P}(X)) by Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i) and Subclasses and Subsets (i). Let GG be a set. By Class Abstraction: the Class of All Sets Satisfying a Predicative Formula (i) and Subclasses and Subsets (i), G∈SG\in\mathcal{S} if and only if G∈P(P(X))G\in\mathcal{P}(\mathcal{P}(X)), GG is a Θ\Theta-system and C⊆G\mathcal{C}\subseteq G. A Θ\Theta-system GG satisfies G⊆P(X)G\subseteq\mathcal{P}(X), by β(G)\beta(G), so G∈P(P(X))G\in\mathcal{P}(\mathcal{P}(X)) by The Union Set and the Power Set of a Set (ii); hence G∈SG\in\mathcal{S} if and only if GG is a Θ\Theta-system with C⊆G\mathcal{C}\subseteq G. If S′\mathcal{S}' is a set with the same property, then S′\mathcal{S}' and S\mathcal{S} have the same elements, and S′=S\mathcal{S}'=\mathcal{S} by Axiom of Extensionality for Classes.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…