Throughout, σ-algebras, π-systems and λ-systems are on X, and the union ⋃n∈NAn of a sequence (An)n∈N is the union of the family, whose elements are the x with x∈An for some n∈N.
Proof of (i). Let F be a σ-algebra. By σ-Algebra and Measurable Space (i), F⊆P(X), X∈F, X∖A∈F for every A∈F, and the union of every sequence in F lies in F, in particular the union of every sequence in F with pairwise disjoint terms; so F is a λ-system by λ-System (i). By Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (ix), A∩B∈F for all A,B∈F, so F is a π-system by π-System (i).
Conversely, let F⊆P(X) be both a π-system and a λ-system. By λ-System (i), X∈F and X∖A∈F for every A∈F. Let (An)n∈N be a sequence in F. Once ⋃n∈NAn∈F is shown, F is a σ-algebra by σ-Algebra and Measurable Space (i). For n∈N let
Cn={x∈X:x∈/Ak for every k∈N with k<n},Bn=An∩Cn.
First, Cn∈F for every n∈N. There is no k∈N with k<1: by Arithmetic and Order of the Natural Numbers (x) and Arithmetic and Order of the Natural Numbers (vi), 1<k or 1=k, and neither is compatible with k<1 by Arithmetic and Order of the Natural Numbers (vii). Hence C1=X∈F. Let n∈N with Cn∈F. For k∈N, k<n+1 holds if and only if k<n or k=n (as n+1 is the successor S(n) of 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 (v), k<n+1 holds if and only if k≤n by The Order on Omega Is a Well-Order with Membership as Its Strict Order, and Nothing Lies between n and Its Successor (iv), that is, if and only if k<n or k=n by Arithmetic and Order of the Natural Numbers (vi)). Hence Cn+1=Cn∩(X∖An), which lies in F by π-System (i), as Cn and X∖An do. By Arithmetic and Order of the Natural Numbers (xiii), applied to the set of all n∈N with Cn∈F, the claim holds for every n∈N.
Consequently Bn∈F for every n∈N, by π-System (i), and n↦Bn is a sequence in F (by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iv), applied to (An), a sequence in P(X) as F⊆P(X), there are sequences (Cn′) and (Bn′) in P(X) with C1′=X, Cn+1′=Cn′∩(X∖An) and Bn′=An∩Cn′ for every n∈N; by the identities C1=X and Cn+1=Cn∩(X∖An) shown above, whose derivation does not use Cn∈F, and Arithmetic and Order of the Natural Numbers (xiii), Cn′=Cn, and so Bn′=Bn, for every n∈N; and (Bn′) is a sequence in F by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v)). Its terms are pairwise disjoint: let m,n∈N with m=n; by Arithmetic and Order of the Natural Numbers (vii), m<n or n<m, and as disjointness is symmetric we may take m<n; then every element of Bn⊆Cn lies outside Am, while Bm⊆Am, so Bm and Bn are disjoint. Hence ⋃n∈NBn∈F by λ-System (i).
Finally ⋃n∈NBn=⋃n∈NAn. As Bn⊆An for every n, the left side is contained in the right. Conversely, let x∈An for some n∈N. The set S={k∈N:x∈Ak} has the element n, so by Arithmetic and Order of the Natural Numbers (xv) it has an element m with m≤v for every v∈S. For k∈N with k<m we have x∈/Ak: otherwise k∈S, so m≤k, that is m<k or m=k by Arithmetic and Order of the Natural Numbers (vi), and either contradicts k<m by Arithmetic and Order of the Natural Numbers (vii). As x∈Am⊆X, it follows that x∈Cm, hence x∈Bm. Thus ⋃n∈NAn=⋃n∈NBn∈F.
Disjoint pairs in a λ-system. Let M be a λ-system and let A,B∈M be disjoint. Then A∪B∈M. Indeed, X∖X∈M by λ-System (i); the set X∖X has no element, so it equals the empty set ∅ by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (ii), and ∅∈M. By Arithmetic and Order of the Natural Numbers (xiv), 2=1+1 is a natural number, and 2=1 by Arithmetic and Order of the Natural Numbers (xi). For n∈N let
En={x∈A:n=1}∪{x∈B:n=2}.
Then E1=A and E2=B, and for every n∈N other than 1 and 2 the set En has no element, so En=∅ by Elements Are Sets, and the Empty Set and the Pair of Two Sets Exist and Are Unique (ii); so n↦En is a sequence in M (as A,B⊆X, because M⊆P(X), Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (iii) gives a sequence in P(X) with first term A, second term B and every other term ∅, which is n↦En; it is a sequence in M by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v), as A, B and ∅ lie in M). Its terms are pairwise disjoint: if x∈Em∩En for some m,n∈N with m=n, then each of m and n is 1 or 2, so one of them is 1 and the other is 2, and x∈A∩B, which has no element. Its union is A∪B, as every En is contained in A∪B while A=E1 and B=E2. Hence A∪B∈M by λ-System (i).
Proper differences in a λ-system. Let M be a λ-system and let A,B∈M with A⊆B. Then B∖A∈M. Indeed, X∖B∈M by λ-System (i), and A and X∖B are disjoint as A⊆B; so A∪(X∖B)∈M by the paragraph on disjoint pairs, and X∖(A∪(X∖B))∈M by λ-System (i). This set is B∖A: its elements are the x∈X with x∈/A and x∈B, and B⊆X since M⊆P(X).
Proof of (ii). Let
L0={B∈P(X):B∈M for every λ-system M on X with E⊆M}.
This is a set (by Predicative Formulas for σ-Algebras, π-Systems and λ-Systems, and the Sets of Them Containing a Given Family (iii), applied with C=E, a subset of P(X) by π-System (i), the λ-systems M on X with E⊆M are the elements of a set S, and L0 is the set of those B∈P(X) with B∈M for every M∈S). Then E⊆L0, since E⊆P(X) by π-System (i), and L0⊆L, since L is one of the λ-systems M in the condition. Moreover, if M is a λ-system with E⊆M, then L0⊆M.
L0 is a λ-system. It is a subset of P(X). By λ-System (i), applied to each λ-system M with E⊆M: X lies in every such M, so X∈L0; for A∈L0, X∖A is a subset of X lying in every such M, so X∖A∈L0; and a sequence in L0 with pairwise disjoint terms is a sequence in every such M, as L0⊆M, so its union lies in every such M, and that 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), contained in X as every term is; so the union lies in L0.
For A∈L0 let DA={B∈P(X):A∩B∈L0}. Then DA is a λ-system. First, X∈DA, as A∩X=A. Next let B∈DA. As A⊆X, A∩(X∖B)=A∖(A∩B), where A∩B⊆A and both lie in L0; so A∩(X∖B)∈L0 by the paragraph on proper differences, applied to the λ-system L0, and X∖B∈DA. Last let (Bn)n∈N be a sequence in DA with pairwise disjoint terms. Then n↦A∩Bn is a sequence in L0 (Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii), applied with Y=A to the sequence (Bn) in DA, gives a sequence in P(A), hence in P(X) as A⊆X, with terms Bn∩A=A∩Bn; it is a sequence in L0 by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (v), as A∩Bn∈L0 for every n by the definition of DA) whose terms are pairwise disjoint, as (A∩Bm)∩(A∩Bn)⊆Bm∩Bn; so its union lies in L0 by λ-System (i). That union is A∩⋃n∈NBn, and ⋃n∈NBn 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), contained in X; so ⋃n∈NBn∈DA. By λ-System (i), DA is a λ-system, and therefore L0⊆DA whenever E⊆DA.
Let C∈E. Then C∈L0, and C∩B∈E⊆L0 for every B∈E by π-System (i); so E⊆DC, hence L0⊆DC, that is, C∩B∈L0 for every B∈L0. Now let A∈L0. For C∈E, A∩C=C∩A∈L0 by what was just shown; so E⊆DA, hence L0⊆DA, that is, A∩B∈L0 for every B∈L0. Thus L0 is a π-system by π-System (i), and, being also a λ-system, a σ-algebra by (i). As E⊆L0, Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iv) gives σ(E)⊆L0, and so σ(E)⊆L0⊆L.
Proof of (iii). Let L0 be as in the proof of (ii); it is the set described in (iii), and σ(E)⊆L0 was shown there. By Closure Properties of σ-Algebras, Intersections and Traces of σ-Algebras, and the Generated σ-Algebra (iii), σ(E) is a σ-algebra with E⊆σ(E), so it is a λ-system by (i), and hence L0⊆σ(E). Therefore σ(E)=L0.