Theorem salunicl 47465

Description: SAlg sigma-algebra is closed under countable union. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypotheses

Ref	Expression
salunicl.s	⊢ (𝜑 → 𝑆 ∈ SAlg)
salunicl.t	⊢ (𝜑 → 𝑇 ∈ 𝒫 𝑆)
salunicl.tct	⊢ (𝜑 → 𝑇 ≼ ω)

Assertion

Ref	Expression
salunicl	⊢ (𝜑 → ∪ 𝑇 ∈ 𝑆)

Proof of Theorem salunicl

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		salunicl.tct	. 2 ⊢ (𝜑 → 𝑇 ≼ ω)
2		breq1 5108	. . . 4 ⊢ (𝑦 = 𝑇 → (𝑦 ≼ ω ↔ 𝑇 ≼ ω))
3		unieq 4880	. . . . 5 ⊢ (𝑦 = 𝑇 → ∪ 𝑦 = ∪ 𝑇)
4	3	eleq1d 2848	. . . 4 ⊢ (𝑦 = 𝑇 → (∪ 𝑦 ∈ 𝑆 ↔ ∪ 𝑇 ∈ 𝑆))
5	2, 4	imbi12d 347	. . 3 ⊢ (𝑦 = 𝑇 → ((𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆) ↔ (𝑇 ≼ ω → ∪ 𝑇 ∈ 𝑆)))
6		salunicl.s	. . . . 5 ⊢ (𝜑 → 𝑆 ∈ SAlg)
7		issal 47463	. . . . . 6 ⊢ (𝑆 ∈ SAlg → (𝑆 ∈ SAlg ↔ (∅ ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆 ∧ ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))))
8	6, 7	syl 18	. . . . 5 ⊢ (𝜑 → (𝑆 ∈ SAlg ↔ (∅ ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆 ∧ ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))))
9	6, 8	mpbid 235	. . . 4 ⊢ (𝜑 → (∅ ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (∪ 𝑆 ∖ 𝑦) ∈ 𝑆 ∧ ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆)))
10	9	simp3d 1162	. . 3 ⊢ (𝜑 → ∀𝑦 ∈ 𝒫 𝑆(𝑦 ≼ ω → ∪ 𝑦 ∈ 𝑆))
11		salunicl.t	. . 3 ⊢ (𝜑 → 𝑇 ∈ 𝒫 𝑆)
12	5, 10, 11	rspcdva 3580	. 2 ⊢ (𝜑 → (𝑇 ≼ ω → ∪ 𝑇 ∈ 𝑆))
13	1, 12	mpd 16	1 ⊢ (𝜑 → ∪ 𝑇 ∈ 𝑆)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146  ∀wral 3079   ∖ cdif 4047  ∅c0 4280  𝒫 cpw 4559  ∪ cuni 4869   class class class wbr 5105  ωcom 7884   ≼ cdom 8982  SAlgcsalg 47457

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-ext 2735

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2101  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-br 5106  df-salg 47458

This theorem is used by:  saliunclf  47471  intsal  47479  smfpimbor1lem1  47947