Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  sigaclcu Structured version   Visualization version   GIF version

Theorem sigaclcu 34731
Description: A sigma-algebra is closed under countable union. (Contributed by Thierry Arnoux, 26-Dec-2016.)
Assertion
Ref Expression
sigaclcu ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → ∪ 𝐴 ∈ 𝑆)

Proof of Theorem sigaclcu
Dummy variables 𝑜 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp2 1155 . 2 ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → 𝐴 ∈ 𝒫 𝑆)
2 isrnsiga 34727 . . . . 5 (𝑆 ∈ ∪ ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))))
32simprbi 503 . . . 4 (𝑆 ∈ ∪ ran sigAlgebra → ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))
4 simpr3 1215 . . . . 5 ((𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
54exlimiv 1963 . . . 4 (∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
63, 5syl 18 . . 3 (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
763ad2ant1 1151 . 2 ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))
8 simp3 1156 . 2 ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → 𝐴 ≼ ω)
9 breq1 5106 . . . 4 (𝑥 = 𝐴 → (𝑥 ≼ ω ↔ 𝐴 ≼ ω))
10 unieq 4878 . . . . 5 (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴)
1110eleq1d 2846 . . . 4 (𝑥 = 𝐴 → (∪ 𝑥 ∈ 𝑆 ↔ ∪ 𝐴 ∈ 𝑆))
129, 11imbi12d 347 . . 3 (𝑥 = 𝐴 → ((𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) ↔ (𝐴 ≼ ω → ∪ 𝐴 ∈ 𝑆)))
1312rspcv 3573 . 2 (𝐴 ∈ 𝒫 𝑆 → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) → (𝐴 ≼ ω → ∪ 𝐴 ∈ 𝑆)))
141, 7, 8, 13syl3c 67 1 ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝒫 𝑆 ∧ 𝐴 ≼ ω) → ∪ 𝐴 ∈ 𝑆)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  ∀wral 3077  Vcvv 3451   ∖ cdif 3896   ⊆ wss 3899  𝒫 cpw 4557  ∪ cuni 4867   class class class wbr 5103  ran crn 5652  ωcom 7866   ≼ cdom 8955  sigAlgebracsiga 34722
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-fv 6539  df-siga 34723
This theorem is used by:  sigaclcuni  34732  sigaclfu  34733  sigaclcu2  34734  sigainb  34751  elsigagen2  34763  sigaldsys  34774  measinb  34836  measres  34837  measdivcst  34839  measdivcstALTV  34840  imambfm  34877  totprobd  35041  dstrvprob  35087
  Copyright terms: Public domain W3C validator