Theorem pwsal 42957

Description: The power set of a given set is a sigma-algebra (the so called discrete sigma-algebra). (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Assertion

Ref	Expression
pwsal	⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ SAlg)

Proof of Theorem pwsal

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		0elpw 5221	. . . 4 ⊢ ∅ ∈ 𝒫 𝑋
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∅ ∈ 𝒫 𝑋)
3		unipw 5308	. . . . . . . 8 ⊢ ∪ 𝒫 𝑋 = 𝑋
4	3	difeq1i 4046	. . . . . . 7 ⊢ (∪ 𝒫 𝑋 ∖ 𝑦) = (𝑋 ∖ 𝑦)
5	4	a1i 11	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (∪ 𝒫 𝑋 ∖ 𝑦) = (𝑋 ∖ 𝑦))
6		difssd 4060	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ⊆ 𝑋)
7		difexg 5195	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ∈ V)
8		elpwg 4500	. . . . . . . 8 ⊢ ((𝑋 ∖ 𝑦) ∈ V → ((𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑦) ⊆ 𝑋))
9	7, 8	syl 17	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ((𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑦) ⊆ 𝑋))
10	6, 9	mpbird 260	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
11	5, 10	eqeltrd 2890	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
12	11	adantr 484	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝑋) → (∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
13	12	ralrimiva 3149	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
14		elpwi 4506	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → 𝑦 ⊆ 𝒫 𝑋)
15	14	unissd 4810	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ⊆ ∪ 𝒫 𝑋)
16	15, 3	sseqtrdi 3965	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ⊆ 𝑋)
17		vuniex 7445	. . . . . . . . 9 ⊢ ∪ 𝑦 ∈ V
18	17	a1i 11	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ∈ V)
19		elpwg 4500	. . . . . . . 8 ⊢ (∪ 𝑦 ∈ V → (∪ 𝑦 ∈ 𝒫 𝑋 ↔ ∪ 𝑦 ⊆ 𝑋))
20	18, 19	syl 17	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → (∪ 𝑦 ∈ 𝒫 𝑋 ↔ ∪ 𝑦 ⊆ 𝑋))
21	16, 20	mpbird 260	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ∈ 𝒫 𝑋)
22	21	adantl 485	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝒫 𝑋) → ∪ 𝑦 ∈ 𝒫 𝑋)
23	22	a1d 25	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝒫 𝑋) → (𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))
24	23	ralrimiva 3149	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))
25	2, 13, 24	3jca 1125	. 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋)))
26		pwexg 5244	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ V)
27		issal 42956	. . 3 ⊢ (𝒫 𝑋 ∈ V → (𝒫 𝑋 ∈ SAlg ↔ (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))))
28	26, 27	syl 17	. 2 ⊢ (𝑋 ∈ 𝑉 → (𝒫 𝑋 ∈ SAlg ↔ (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))))
29	25, 28	mpbird 260	1 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ SAlg)

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1084   = wceq 1538   ∈ wcel 2111  ∀wral 3106  Vcvv 3441   ∖ cdif 3878   ⊆ wss 3881  ∅c0 4243  𝒫 cpw 4497  ∪ cuni 4800   class class class wbr 5030  ωcom 7560   ≼ cdom 8490  SAlgcsalg 42950

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2113  ax-9 2121  ax-10 2142  ax-11 2158  ax-12 2175  ax-ext 2770  ax-sep 5167  ax-nul 5174  ax-pow 5231  ax-pr 5295  ax-un 7441

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2777  df-cleq 2791  df-clel 2870  df-ral 3111  df-rab 3115  df-v 3443  df-dif 3884  df-un 3886  df-in 3888  df-ss 3898  df-nul 4244  df-pw 4499  df-sn 4526  df-pr 4528  df-uni 4801  df-salg 42951

This theorem is referenced by:  salgenval  42963  salgenn0  42971  salgencntex  42983  psmeasure  43110