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 34115
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 4928 . . 3 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} = (𝐴𝐵))
213adant1 1129 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} = (𝐴𝐵))
3 isrnsigau 34108 . . . . . 6 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
43simprd 495 . . . . 5 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
54simp3d 1143 . . . 4 (𝑆 ran sigAlgebra → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))
653ad2ant1 1132 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))
7 prct 32732 . . . 4 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ≼ ω)
873adant1 1129 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ≼ ω)
9 prelpwi 5458 . . . . 5 ((𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ∈ 𝒫 𝑆)
10 breq1 5151 . . . . . . 7 (𝑥 = {𝐴, 𝐵} → (𝑥 ≼ ω ↔ {𝐴, 𝐵} ≼ ω))
11 unieq 4923 . . . . . . . 8 (𝑥 = {𝐴, 𝐵} → 𝑥 = {𝐴, 𝐵})
1211eleq1d 2824 . . . . . . 7 (𝑥 = {𝐴, 𝐵} → ( 𝑥𝑆 {𝐴, 𝐵} ∈ 𝑆))
1310, 12imbi12d 344 . . . . . 6 (𝑥 = {𝐴, 𝐵} → ((𝑥 ≼ ω → 𝑥𝑆) ↔ ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
1413rspcv 3618 . . . . 5 ({𝐴, 𝐵} ∈ 𝒫 𝑆 → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
159, 14syl 17 . . . 4 ((𝐴𝑆𝐵𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
16153adant1 1129 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆) → ({𝐴, 𝐵} ≼ ω → {𝐴, 𝐵} ∈ 𝑆)))
176, 8, 16mp2d 49 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {𝐴, 𝐵} ∈ 𝑆)
182, 17eqeltrrd 2840 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1537  wcel 2106  wral 3059  cdif 3960  cun 3961  wss 3963  𝒫 cpw 4605  {cpr 4633   cuni 4912   class class class wbr 5148  ran crn 5690  ωcom 7887  cdom 8982  sigAlgebracsiga 34089
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 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754  ax-inf2 9679
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-pss 3983  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-int 4952  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5583  df-eprel 5589  df-po 5597  df-so 5598  df-fr 5641  df-se 5642  df-we 5643  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-pred 6323  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-isom 6572  df-riota 7388  df-ov 7434  df-om 7888  df-1st 8013  df-2nd 8014  df-frecs 8305  df-wrecs 8336  df-recs 8410  df-rdg 8449  df-1o 8505  df-2o 8506  df-er 8744  df-en 8985  df-dom 8986  df-sdom 8987  df-fin 8988  df-oi 9548  df-dju 9939  df-card 9977  df-siga 34090
This theorem is referenced by:  measun  34192  aean  34225  sibfof  34322
  Copyright terms: Public domain W3C validator