In the proofs of (vi), (vii), (viii), (ix), (x) and (xi), F is the σ-algebra on X fixed before these clauses. By σ-Algebra and Measurable Space (i), F⊆P(X), X∈F, X∖A∈F for every A∈F, and ⋃n∈NAn∈F for every sequence (An) in F. By The Union Set and the Power Set of a Set (ii), every element of F is a subset of X. By Indexed Families of Sets and Their Union, Intersection and Product (ii), a set u lies in the union ⋃n∈NAn of a sequence (An) if and only if u∈An for some n∈N.
Proof of (vi). As X∈F, also X∖X∈F. The set X∖X has no element, so it is ∅ by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (ii).
Proof of (vii). Let A,B∈F. By Maps Defined by Cases (i) there is a map C:N→F with Cn=A for n=1 and Cn=B for n=1; it is a sequence in F. Every term Cn is A or B, so ⋃n∈NCn⊆A∪B. Conversely, 1∈N by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (ii), and m=1+1 satisfies m∈N by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (vi) and m=1 by Arithmetic and Order of the Natural Numbers (xi); as C1=A and Cm=B, we get A∪B⊆⋃n∈NCn. Hence A∪B=⋃n∈NCn∈F.
Proof of (viii). Let (An) be a sequence in F. Since X∖An∈F for every n, the map n↦X∖An is a sequence (Dn) in F (a sequence in P(X) by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (i), (An) being a sequence in P(X) as F⊆P(X), and hence a sequence in F by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v)), so U=⋃n∈NDn∈F and X∖U∈F. As 1∈N by Natural Numbers Are the Successors in Omega: One Is Least and Not a Successor of a Natural Number, the Successor Is Injective, and N Is Closed under Addition and Multiplication (ii), the intersection ⋂n∈NAn is formed as in Indexed Families of Sets and Their Union, Intersection and Product (iii), and a set u lies in it if and only if u∈An for every n∈N. We show ⋂n∈NAn=X∖U. If u∈An for every n, then u∈A1⊆X, and u∈/Dn for every n, so u∈/U; thus u∈X∖U. If u∈X∖U, then for every n we have u∈X and u∈/X∖An, so u∈An. Hence ⋂n∈NAn=X∖U∈F.
Proof of (ix). Let A,B∈F. Then X∖A and X∖B lie in F, so does their union by (vii), and so does E=X∖((X∖A)∪(X∖B)). A set u lies in E if and only if u∈X, u∈A and u∈B; as A⊆X, this says u∈A∩B. So A∩B=E∈F.
Proof of (x). Let A,B∈F. As A⊆X, A∖B=A∩(X∖B), and X∖B∈F, so A∖B∈F by (ix).
Proof of (i). We check σ-Algebra and Measurable Space (i) for P(X), using The Union Set and the Power Set of a Set (ii): a set lies in P(X) if and only if it is a subset of X. Clearly P(X)⊆P(X), and X∈P(X) since X⊆X. For every set A, X∖A⊆X, so X∖A∈P(X). For a sequence (An) in P(X), the union ⋃n∈NAn 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), and each of its elements lies in some An⊆X; so it is a subset of X and lies in P(X).
Proof of (ii). Let G0∈S and I=⋂G∈SG. 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 (ii), I is a set, and by Indexed Families of Sets and Their Union, Intersection and Product (iii), a set u lies in I if and only if u∈G for every G∈S. We check σ-Algebra and Measurable Space (i) for I, using that every G∈S satisfies it. First, I⊆G0⊆P(X). Next, X∈G for every G∈S, so X∈I. If A∈I and G∈S, then A∈G, so X∖A∈G; hence X∖A∈I. Finally let (An) be a sequence in I and G∈S. As I⊆G, (An) is a sequence in G, so ⋃n∈NAn∈G; hence ⋃n∈NAn∈I.
Proof of (xi). Let φ:F→P(X) be the map A↦A∩Y, whose values are subsets of X (by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii) there is exactly one map F→P(Y) with these values, and it is a map into P(X), as P(Y)⊆P(X) because Y⊆X). Then FY=φ[F] is a set by Images of Sets under Functions Are Sets, and a Function with a Set Domain Is a Set (i), and by The Image and the Preimage of a Class under a Class (i) and Values, Restriction and Equality of a Map, and the Map u↦t(u) as a Defined Set Symbol (i), a set B lies in FY if and only if B=A∩Y for some A∈F. If B=A∩Y with A∈F, then B∈F by (ix), as Y∈F, and B⊆Y. If A∈F and A⊆Y, then A=A∩Y∈FY. Hence FY={A∈F:A⊆Y}, and in particular FY⊆F.
We check σ-Algebra and Measurable Space (i) for FY on Y. Every element of FY is a subset of Y, so FY⊆P(Y) by The Union Set and the Power Set of a Set (ii). As Y∈F and Y⊆Y, Y∈FY. For B∈FY, we have B∈F, so Y∖B∈F by (x); as Y∖B⊆Y, Y∖B∈FY. For a sequence (Bn) in FY, (Bn) is a sequence in F, so ⋃n∈NBn∈F; each of its elements lies in some Bn⊆Y, so ⋃n∈NBn⊆Y and ⋃n∈NBn∈FY.
Proof of (iii). By The σ-Algebra Generated by a Set of Subsets (i), σ(C)=⋂G∈SCG, the intersection of the family G↦G indexed by the set SC, which has an element and whose elements are σ-algebras on X. So σ(C) is a σ-algebra on X by (ii). Let A∈C. Then A⊆X as C⊆P(X), and A∈G for every σ-algebra G on X with C⊆G; so A∈σ(C) by The σ-Algebra Generated by a Set of Subsets (ii). Hence C⊆σ(C).
Proof of (iv). Let G be a σ-algebra on X with C⊆G. Every A∈σ(C) lies in G by The σ-Algebra Generated by a Set of Subsets (ii), so σ(C)⊆G.
Proof of (v). By (iii) applied to D, σ(D) is a σ-algebra on X with D⊆σ(D). If C⊆σ(D), then σ(C)⊆σ(D) by (iv) applied with G=σ(D). If C⊆D, then C⊆D⊆σ(D), and the first case applies.