Theorem pwsal 46475

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 5298	. . . 4 ⊢ ∅ ∈ 𝒫 𝑋
2	1	a1i 11	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∅ ∈ 𝒫 𝑋)
3		unipw 5395	. . . . . . . 8 ⊢ ∪ 𝒫 𝑋 = 𝑋
4	3	difeq1i 4071	. . . . . . 7 ⊢ (∪ 𝒫 𝑋 ∖ 𝑦) = (𝑋 ∖ 𝑦)
5	4	a1i 11	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (∪ 𝒫 𝑋 ∖ 𝑦) = (𝑋 ∖ 𝑦))
6		difssd 4086	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ⊆ 𝑋)
7		difexg 5271	. . . . . . . 8 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ∈ V)
8		elpwg 4554	. . . . . . . 8 ⊢ ((𝑋 ∖ 𝑦) ∈ V → ((𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑦) ⊆ 𝑋))
9	7, 8	syl 17	. . . . . . 7 ⊢ (𝑋 ∈ 𝑉 → ((𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ↔ (𝑋 ∖ 𝑦) ⊆ 𝑋))
10	6, 9	mpbird 257	. . . . . 6 ⊢ (𝑋 ∈ 𝑉 → (𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
11	5, 10	eqeltrd 2833	. . . . 5 ⊢ (𝑋 ∈ 𝑉 → (∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
12	11	adantr 480	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝑋) → (∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
13	12	ralrimiva 3125	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋)
14		elpwi 4558	. . . . . . . . 9 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → 𝑦 ⊆ 𝒫 𝑋)
15	14	unissd 4870	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ⊆ ∪ 𝒫 𝑋)
16	15, 3	sseqtrdi 3971	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ⊆ 𝑋)
17		vuniex 7681	. . . . . . . . 9 ⊢ ∪ 𝑦 ∈ V
18	17	a1i 11	. . . . . . . 8 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ∈ V)
19		elpwg 4554	. . . . . . . 8 ⊢ (∪ 𝑦 ∈ V → (∪ 𝑦 ∈ 𝒫 𝑋 ↔ ∪ 𝑦 ⊆ 𝑋))
20	18, 19	syl 17	. . . . . . 7 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → (∪ 𝑦 ∈ 𝒫 𝑋 ↔ ∪ 𝑦 ⊆ 𝑋))
21	16, 20	mpbird 257	. . . . . 6 ⊢ (𝑦 ∈ 𝒫 𝒫 𝑋 → ∪ 𝑦 ∈ 𝒫 𝑋)
22	21	adantl 481	. . . . 5 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝒫 𝑋) → ∪ 𝑦 ∈ 𝒫 𝑋)
23	22	a1d 25	. . . 4 ⊢ ((𝑋 ∈ 𝑉 ∧ 𝑦 ∈ 𝒫 𝒫 𝑋) → (𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))
24	23	ralrimiva 3125	. . 3 ⊢ (𝑋 ∈ 𝑉 → ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))
25	2, 13, 24	3jca 1128	. 2 ⊢ (𝑋 ∈ 𝑉 → (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋)))
26		pwexg 5320	. . 3 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ V)
27		issal 46474	. . 3 ⊢ (𝒫 𝑋 ∈ V → (𝒫 𝑋 ∈ SAlg ↔ (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))))
28	26, 27	syl 17	. 2 ⊢ (𝑋 ∈ 𝑉 → (𝒫 𝑋 ∈ SAlg ↔ (∅ ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝑋(∪ 𝒫 𝑋 ∖ 𝑦) ∈ 𝒫 𝑋 ∧ ∀𝑦 ∈ 𝒫 𝒫 𝑋(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝒫 𝑋))))
29	25, 28	mpbird 257	1 ⊢ (𝑋 ∈ 𝑉 → 𝒫 𝑋 ∈ SAlg)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1541   ∈ wcel 2113  ∀wral 3048  Vcvv 3437   ∖ cdif 3895   ⊆ wss 3898  ∅c0 4282  𝒫 cpw 4551  ∪ cuni 4860   class class class wbr 5095  ωcom 7805   ≼ cdom 8877  SAlgcsalg 46468

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2705  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-clab 2712  df-cleq 2725  df-clel 2808  df-ral 3049  df-rab 3397  df-v 3439  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4283  df-pw 4553  df-sn 4578  df-pr 4580  df-uni 4861  df-salg 46469

This theorem is referenced by:  salgenval  46481  salgenn0  46491  salgencntex  46503  psmeasure  46631