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 33675
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 4935 . . . 4 (𝐴𝑆𝐴 𝑆)
3 difin2 4287 . . . 4 (𝐴 𝑆 → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
41, 2, 33syl 18 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = (( 𝑆𝐵) ∩ 𝐴))
5 isrnsigau 33669 . . . . . . . 8 (𝑆 ran sigAlgebra → (𝑆 ⊆ 𝒫 𝑆 ∧ ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
65simprd 495 . . . . . . 7 (𝑆 ran sigAlgebra → ( 𝑆𝑆 ∧ ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
76simp2d 1141 . . . . . 6 (𝑆 ran sigAlgebra → ∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆)
8 difeq2 4112 . . . . . . . 8 (𝑥 = 𝐵 → ( 𝑆𝑥) = ( 𝑆𝐵))
98eleq1d 2813 . . . . . . 7 (𝑥 = 𝐵 → (( 𝑆𝑥) ∈ 𝑆 ↔ ( 𝑆𝐵) ∈ 𝑆))
109rspccva 3606 . . . . . 6 ((∀𝑥𝑆 ( 𝑆𝑥) ∈ 𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
117, 10sylan 579 . . . . 5 ((𝑆 ran sigAlgebra ∧ 𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
12113adant2 1129 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → ( 𝑆𝐵) ∈ 𝑆)
13 intprg 4979 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
1412, 1, 13syl2anc 583 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} = (( 𝑆𝐵) ∩ 𝐴))
154, 14eqtr4d 2770 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) = {( 𝑆𝐵), 𝐴})
16 simp1 1134 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → 𝑆 ran sigAlgebra)
17 prssi 4820 . . . . 5 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
1812, 1, 17syl2anc 583 . . . 4 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
19 prex 5428 . . . . 5 {( 𝑆𝐵), 𝐴} ∈ V
2019elpw 4602 . . . 4 ({( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆 ↔ {( 𝑆𝐵), 𝐴} ⊆ 𝑆)
2118, 20sylibr 233 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆)
22 prct 32467 . . . 4 ((( 𝑆𝐵) ∈ 𝑆𝐴𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
2312, 1, 22syl2anc 583 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≼ ω)
24 prnzg 4778 . . . 4 (( 𝑆𝐵) ∈ 𝑆 → {( 𝑆𝐵), 𝐴} ≠ ∅)
2512, 24syl 17 . . 3 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ≠ ∅)
26 sigaclci 33674 . . 3 (((𝑆 ran sigAlgebra ∧ {( 𝑆𝐵), 𝐴} ∈ 𝒫 𝑆) ∧ ({( 𝑆𝐵), 𝐴} ≼ ω ∧ {( 𝑆𝐵), 𝐴} ≠ ∅)) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2716, 21, 23, 25, 26syl22anc 838 . 2 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → {( 𝑆𝐵), 𝐴} ∈ 𝑆)
2815, 27eqeltrd 2828 1 ((𝑆 ran sigAlgebra ∧ 𝐴𝑆𝐵𝑆) → (𝐴𝐵) ∈ 𝑆)
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1085   = wceq 1534  wcel 2099  wne 2935  wral 3056  cdif 3941  cin 3943  wss 3944  c0 4318  𝒫 cpw 4598  {cpr 4626   cuni 4903   cint 4944   class class class wbr 5142  ran crn 5673  ωcom 7862  cdom 8951  sigAlgebracsiga 33650
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7732  ax-inf2 9650  ax-ac2 10472
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-rmo 3371  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3963  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-int 4945  df-iun 4993  df-iin 4994  df-br 5143  df-opab 5205  df-mpt 5226  df-tr 5260  df-id 5570  df-eprel 5576  df-po 5584  df-so 5585  df-fr 5627  df-se 5628  df-we 5629  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-pred 6299  df-ord 6366  df-on 6367  df-lim 6368  df-suc 6369  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-isom 6551  df-riota 7370  df-ov 7417  df-oprab 7418  df-mpo 7419  df-om 7863  df-1st 7985  df-2nd 7986  df-frecs 8278  df-wrecs 8309  df-recs 8383  df-rdg 8422  df-1o 8478  df-2o 8479  df-er 8716  df-map 8836  df-en 8954  df-dom 8955  df-sdom 8956  df-fin 8957  df-oi 9519  df-dju 9910  df-card 9948  df-acn 9951  df-ac 10125  df-siga 33651
This theorem is referenced by:  inelsiga  33677  sigainb  33678  sigaldsys  33701  cldssbrsiga  33729  measxun2  33752  measssd  33757  measunl  33758  measiuns  33759  measiun  33760  meascnbl  33761  imambfm  33805  dya2iocbrsiga  33818  dya2icobrsiga  33819  sxbrsigalem2  33829  probdif  33963
  Copyright terms: Public domain W3C validator