Theorem unisg 32011

Description: The sigma-algebra generated by a collection 𝐴 is a sigma-algebra on ∪ 𝐴. (Contributed by Thierry Arnoux, 27-Dec-2016.)

Assertion

Ref	Expression
unisg	⊢ (𝐴 ∈ 𝑉 → ∪ (sigaGen‘𝐴) = ∪ 𝐴)

Proof of Theorem unisg

Step	Hyp	Ref	Expression
1		sigagensiga 32009	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (sigaGen‘𝐴) ∈ (sigAlgebra‘∪ 𝐴))
2		issgon 31991	. . . 4 ⊢ ((sigaGen‘𝐴) ∈ (sigAlgebra‘∪ 𝐴) ↔ ((sigaGen‘𝐴) ∈ ∪ ran sigAlgebra ∧ ∪ 𝐴 = ∪ (sigaGen‘𝐴)))
3	1, 2	sylib 217	. . 3 ⊢ (𝐴 ∈ 𝑉 → ((sigaGen‘𝐴) ∈ ∪ ran sigAlgebra ∧ ∪ 𝐴 = ∪ (sigaGen‘𝐴)))
4	3	simprd 495	. 2 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 = ∪ (sigaGen‘𝐴))
5	4	eqcomd 2744	1 ⊢ (𝐴 ∈ 𝑉 → ∪ (sigaGen‘𝐴) = ∪ 𝐴)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1539   ∈ wcel 2108  ∪ cuni 4836  ran crn 5581  ‘cfv 6418  sigAlgebracsiga 31976  sigaGencsigagen 32006

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-op 4565  df-uni 4837  df-int 4877  df-br 5071  df-opab 5133  df-mpt 5154  df-id 5480  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-iota 6376  df-fun 6420  df-fn 6421  df-fv 6426  df-siga 31977  df-sigagen 32007

This theorem is referenced by:  unibrsiga  32054  sxsigon  32060  imambfm  32129  cnmbfm  32130  sibf0  32201  sibff  32203  sibfof  32207  sitgclg  32209  orvcval4  32327