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 32101
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 1136 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝐴𝑆)
2 elssuni 4871 . . . 4 (𝐴𝑆𝐴 𝑆)
3 difin2 4225 . . . 4 (𝐴 𝑆 → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
41, 2, 33syl 18 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
5 isrnsigau 32095 . . . . . . . 8 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
65simprd 496 . . . . . . 7 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
76simp2d 1142 . . . . . 6 (𝑆 ran sigAlgebra → ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆)
8 difeq2 4051 . . . . . . . 8 (𝑥 = 𝐵 → ( 𝑆𝑥) = ( 𝑆𝐵))
98eleq1d 2823 . . . . . . 7 (𝑥 = 𝐵 → (( 𝑆𝑥) ∈ 𝑆 ↔ ( 𝑆𝐵) ∈ 𝑆))
109rspccva 3560 . . . . . 6 ((∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
117, 10sylan 580 . . . . 5 ((𝑆 ran sigAlgebra ∧ 𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
12113adant2 1130 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
13 intprg 4912 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
1412, 1, 13syl2anc 584 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
154, 14eqtr4d 2781 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = {( 𝑆𝐵), 𝐴})
16 simp1 1135 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝑆 ran sigAlgebra)
17 prssi 4754 . . . . 5 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
1812, 1, 17syl2anc 584 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
19 prex 5355 . . . . 5 {( 𝑆𝐵), 𝐴} ∈ V
2019elpw 4537 . . . 4 ({( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆 ↔ {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
2118, 20sylibr 233 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆)
22 prct 31049 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
2312, 1, 22syl2anc 584 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
24 prnzg 4714 . . . 4 (( 𝑆𝐵) ∈ 𝑆 → {( 𝑆𝐵), 𝐴} ≠ ∅)
2512, 24syl 17 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≠ ∅)
26 sigaclci 32100 . . 3 (((𝑆 ran sigAlgebra ∧ {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆) ∧ ({( 𝑆𝐵), 𝐴} ≼ ω ∧ {( 𝑆𝐵), 𝐴} ≠ ∅)) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2716, 21, 23, 25, 26syl22anc 836 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2815, 27eqeltrd 2839 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1086   = wceq 1539  wcel 2106  wne 2943  wral 3064  cdif 3884  cin 3886  wss 3887  c0 4256  𝒫 cpw 4533  {cpr 4563   cuni 4839   cint 4879   class class class wbr 5074  ran crn 5590  ωcom 7712  cdom 8731  sigAlgebracsiga 32076
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2709  ax-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-inf2 9399  ax-ac2 10219
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2068  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2816  df-nfc 2889  df-ne 2944  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  df-rab 3073  df-v 3434  df-sbc 3717  df-csb 3833  df-dif 3890  df-un 3892  df-in 3894  df-ss 3904  df-pss 3906  df-nul 4257  df-if 4460  df-pw 4535  df-sn 4562  df-pr 4564  df-op 4568  df-uni 4840  df-int 4880  df-iun 4926  df-iin 4927  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-2o 8298  df-er 8498  df-map 8617  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-oi 9269  df-dju 9659  df-card 9697  df-acn 9700  df-ac 9872  df-siga 32077
This theorem is referenced by:  inelsiga  32103  sigainb  32104  sigaldsys  32127  cldssbrsiga  32155  measxun2  32178  measssd  32183  measunl  32184  measiuns  32185  measiun  32186  meascnbl  32187  imambfm  32229  dya2iocbrsiga  32242  dya2icobrsiga  32243  sxbrsigalem2  32253  probdif  32387
  Copyright terms: Public domain W3C validator