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

Theorem difelsiga 32001
Description: A sigma-algebra is closed under class differences. (Contributed by Thierry Arnoux, 13-Sep-2016.)
Assertion
Ref Expression
difelsiga ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)

Proof of Theorem difelsiga
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 simp2 1135 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝐴𝑆)
2 elssuni 4868 . . . 4 (𝐴𝑆𝐴 𝑆)
3 difin2 4222 . . . 4 (𝐴 𝑆 → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
41, 2, 33syl 18 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
5 isrnsigau 31995 . . . . . . . 8 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
65simprd 495 . . . . . . 7 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
76simp2d 1141 . . . . . 6 (𝑆 ran sigAlgebra → ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆)
8 difeq2 4047 . . . . . . . 8 (𝑥 = 𝐵 → ( 𝑆𝑥) = ( 𝑆𝐵))
98eleq1d 2823 . . . . . . 7 (𝑥 = 𝐵 → (( 𝑆𝑥) ∈ 𝑆 ↔ ( 𝑆𝐵) ∈ 𝑆))
109rspccva 3551 . . . . . 6 ((∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
117, 10sylan 579 . . . . 5 ((𝑆 ran sigAlgebra ∧ 𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
12113adant2 1129 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
13 intprg 4909 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
1412, 1, 13syl2anc 583 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
154, 14eqtr4d 2781 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = {( 𝑆𝐵), 𝐴})
16 simp1 1134 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝑆 ran sigAlgebra)
17 prssi 4751 . . . . 5 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
1812, 1, 17syl2anc 583 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
19 prex 5350 . . . . 5 {( 𝑆𝐵), 𝐴} ∈ V
2019elpw 4534 . . . 4 ({( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆 ↔ {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
2118, 20sylibr 233 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆)
22 prct 30951 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
2312, 1, 22syl2anc 583 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
24 prnzg 4711 . . . 4 (( 𝑆𝐵) ∈ 𝑆 → {( 𝑆𝐵), 𝐴} ≠ ∅)
2512, 24syl 17 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≠ ∅)
26 sigaclci 32000 . . 3 (((𝑆 ran sigAlgebra ∧ {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆) ∧ ({( 𝑆𝐵), 𝐴} ≼ ω ∧ {( 𝑆𝐵), 𝐴} ≠ ∅)) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2716, 21, 23, 25, 26syl22anc 835 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2815, 27eqeltrd 2839 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1085   = wceq 1539  wcel 2108  wne 2942  wral 3063  cdif 3880  cin 3882  wss 3883  c0 4253  𝒫 cpw 4530  {cpr 4560   cuni 4836   cint 4876   class class class wbr 5070  ran crn 5581  ωcom 7687  cdom 8689  sigAlgebracsiga 31976
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-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-inf2 9329  ax-ac2 10150
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  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-reu 3070  df-rmo 3071  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-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-iin 4924  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  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-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-oprab 7259  df-mpo 7260  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-2o 8268  df-er 8456  df-map 8575  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-oi 9199  df-dju 9590  df-card 9628  df-acn 9631  df-ac 9803  df-siga 31977
This theorem is referenced by:  inelsiga  32003  sigainb  32004  sigaldsys  32027  cldssbrsiga  32055  measxun2  32078  measssd  32083  measunl  32084  measiuns  32085  measiun  32086  meascnbl  32087  imambfm  32129  dya2iocbrsiga  32142  dya2icobrsiga  32143  sxbrsigalem2  32153  probdif  32287
  Copyright terms: Public domain W3C validator