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 31396
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 1133 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝐴𝑆)
2 elssuni 4871 . . . 4 (𝐴𝑆𝐴 𝑆)
3 difin2 4269 . . . 4 (𝐴 𝑆 → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
41, 2, 33syl 18 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
5 isrnsigau 31390 . . . . . . . 8 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
65simprd 498 . . . . . . 7 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
76simp2d 1139 . . . . . 6 (𝑆 ran sigAlgebra → ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆)
8 difeq2 4096 . . . . . . . 8 (𝑥 = 𝐵 → ( 𝑆𝑥) = ( 𝑆𝐵))
98eleq1d 2900 . . . . . . 7 (𝑥 = 𝐵 → (( 𝑆𝑥) ∈ 𝑆 ↔ ( 𝑆𝐵) ∈ 𝑆))
109rspccva 3625 . . . . . 6 ((∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
117, 10sylan 582 . . . . 5 ((𝑆 ran sigAlgebra ∧ 𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
12113adant2 1127 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
13 intprg 4913 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
1412, 1, 13syl2anc 586 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
154, 14eqtr4d 2862 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = {( 𝑆𝐵), 𝐴})
16 simp1 1132 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝑆 ran sigAlgebra)
17 prssi 4757 . . . . 5 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
1812, 1, 17syl2anc 586 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
19 prex 5336 . . . . 5 {( 𝑆𝐵), 𝐴} ∈ V
2019elpw 4546 . . . 4 ({( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆 ↔ {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
2118, 20sylibr 236 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆)
22 prct 30453 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
2312, 1, 22syl2anc 586 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
24 prnzg 4716 . . . 4 (( 𝑆𝐵) ∈ 𝑆 → {( 𝑆𝐵), 𝐴} ≠ ∅)
2512, 24syl 17 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≠ ∅)
26 sigaclci 31395 . . 3 (((𝑆 ran sigAlgebra ∧ {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆) ∧ ({( 𝑆𝐵), 𝐴} ≼ ω ∧ {( 𝑆𝐵), 𝐴} ≠ ∅)) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2716, 21, 23, 25, 26syl22anc 836 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2815, 27eqeltrd 2916 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1083   = wceq 1536  wcel 2113  wne 3019  wral 3141  cdif 3936  cin 3938  wss 3939  c0 4294  𝒫 cpw 4542  {cpr 4572   cuni 4841   cint 4879   class class class wbr 5069  ran crn 5559  ωcom 7583  cdom 8510  sigAlgebracsiga 31371
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-inf2 9107  ax-ac2 9888
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-fal 1549  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-iin 4925  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-se 5518  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-isom 6367  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-1o 8105  df-2o 8106  df-oadd 8109  df-er 8292  df-map 8411  df-en 8513  df-dom 8514  df-sdom 8515  df-fin 8516  df-oi 8977  df-dju 9333  df-card 9371  df-acn 9374  df-ac 9545  df-siga 31372
This theorem is referenced by:  inelsiga  31398  sigainb  31399  sigaldsys  31422  cldssbrsiga  31450  measxun2  31473  measssd  31478  measunl  31479  measiuns  31480  measiun  31481  meascnbl  31482  imambfm  31524  dya2iocbrsiga  31537  dya2icobrsiga  31538  sxbrsigalem2  31548  probdif  31682
  Copyright terms: Public domain W3C validator