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

Theorem unelsiga 31393
Description: A sigma-algebra is closed under pairwise unions. (Contributed by Thierry Arnoux, 13-Dec-2016.)
Assertion
Ref Expression
unelsiga ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)

Proof of Theorem unelsiga
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 uniprg 4855 . . 3 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} = (𝐴𝐵))
213adant1 1126 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} = (𝐴𝐵))
3 isrnsigau 31386 . . . . . 6 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
43simprd 498 . . . . 5 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
54simp3d 1140 . . . 4 (𝑆 ran sigAlgebra → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))
653ad2ant1 1129 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))
7 prct 30449 . . . 4 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ≼ ω)
873adant1 1126 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ≼ ω)
9 prelpwi 5339 . . . . 5 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ∈ 𝒫 𝑆)
10 breq1 5068 . . . . . . 7 (𝑥 = {𝐴, 𝐵} → (𝑥 ≼ ω ↔ {𝐴, 𝐵} ≼ ω))
11 unieq 4848 . . . . . . . 8 (𝑥 = {𝐴, 𝐵} → 𝑥 = {𝐴, 𝐵})
1211eleq1d 2897 . . . . . . 7 (𝑥 = {𝐴, 𝐵} → ( 𝑥𝑆 {𝐴, 𝐵} ∈ 𝑆))
1310, 12imbi12d 347 . . . . . 6 (𝑥 = {𝐴, 𝐵} → ((𝑥 ≼ ω → 𝑥𝑆) ↔ ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
1413rspcv 3617 . . . . 5 ({𝐴, 𝐵} ∈ 𝒫 𝑆 → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
159, 14syl 17 . . . 4 ((𝐴𝑆𝐵𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
16153adant1 1126 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
176, 8, 16mp2d 49 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ∈ 𝑆)
182, 17eqeltrrd 2914 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1533  wcel 2110  wral 3138  cdif 3932  cun 3933  wss 3935  𝒫 cpw 4538  {cpr 4568   cuni 4837   class class class wbr 5065  ran crn 5555  ωcom 7579  cdom 8506  sigAlgebracsiga 31367
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1907  ax-6 1966  ax-7 2011  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2157  ax-12 2173  ax-ext 2793  ax-rep 5189  ax-sep 5202  ax-nul 5209  ax-pow 5265  ax-pr 5329  ax-un 7460  ax-inf2 9103
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1536  df-fal 1546  df-ex 1777  df-nf 1781  df-sb 2066  df-mo 2618  df-eu 2650  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3772  df-csb 3883  df-dif 3938  df-un 3940  df-in 3942  df-ss 3951  df-pss 3953  df-nul 4291  df-if 4467  df-pw 4540  df-sn 4567  df-pr 4569  df-tp 4571  df-op 4573  df-uni 4838  df-int 4876  df-iun 4920  df-br 5066  df-opab 5128  df-mpt 5146  df-tr 5172  df-id 5459  df-eprel 5464  df-po 5473  df-so 5474  df-fr 5513  df-se 5514  df-we 5515  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-pred 6147  df-ord 6193  df-on 6194  df-lim 6195  df-suc 6196  df-iota 6313  df-fun 6356  df-fn 6357  df-f 6358  df-f1 6359  df-fo 6360  df-f1o 6361  df-fv 6362  df-isom 6363  df-riota 7113  df-ov 7158  df-oprab 7159  df-mpo 7160  df-om 7580  df-1st 7688  df-2nd 7689  df-wrecs 7946  df-recs 8007  df-rdg 8045  df-1o 8101  df-2o 8102  df-oadd 8105  df-er 8288  df-en 8509  df-dom 8510  df-sdom 8511  df-fin 8512  df-oi 8973  df-dju 9329  df-card 9367  df-siga 31368
This theorem is referenced by:  measun  31470  aean  31503  sibfof  31598
  Copyright terms: Public domain W3C validator