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

Theorem pwsiga 34094
Description: Any power set forms a sigma-algebra. (Contributed by Thierry Arnoux, 13-Sep-2016.) (Revised by Thierry Arnoux, 24-Oct-2016.)
Assertion
Ref Expression
pwsiga (𝑂𝑉 → 𝒫 𝑂 ∈ (sigAlgebra‘𝑂))

Proof of Theorem pwsiga
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 ssidd 4032 . 2 (𝑂𝑉 → 𝒫 𝑂 ⊆ 𝒫 𝑂)
2 pwidg 4642 . . 3 (𝑂𝑉𝑂 ∈ 𝒫 𝑂)
3 difss 4159 . . . . . 6 (𝑂𝑥) ⊆ 𝑂
4 elpw2g 5351 . . . . . 6 (𝑂𝑉 → ((𝑂𝑥) ∈ 𝒫 𝑂 ↔ (𝑂𝑥) ⊆ 𝑂))
53, 4mpbiri 258 . . . . 5 (𝑂𝑉 → (𝑂𝑥) ∈ 𝒫 𝑂)
65a1d 25 . . . 4 (𝑂𝑉 → (𝑥 ∈ 𝒫 𝑂 → (𝑂𝑥) ∈ 𝒫 𝑂))
76ralrimiv 3151 . . 3 (𝑂𝑉 → ∀𝑥 ∈ 𝒫 𝑂(𝑂𝑥) ∈ 𝒫 𝑂)
8 sspwuni 5123 . . . . . . . 8 (𝑥 ⊆ 𝒫 𝑂 𝑥𝑂)
9 vuniex 7774 . . . . . . . . 9 𝑥 ∈ V
109elpw 4626 . . . . . . . 8 ( 𝑥 ∈ 𝒫 𝑂 𝑥𝑂)
118, 10bitr4i 278 . . . . . . 7 (𝑥 ⊆ 𝒫 𝑂 𝑥 ∈ 𝒫 𝑂)
1211biimpi 216 . . . . . 6 (𝑥 ⊆ 𝒫 𝑂 𝑥 ∈ 𝒫 𝑂)
1312a1d 25 . . . . 5 (𝑥 ⊆ 𝒫 𝑂 → (𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂))
14 elpwi 4629 . . . . . 6 (𝑥 ∈ 𝒫 𝒫 𝑂𝑥 ⊆ 𝒫 𝑂)
1514imim1i 63 . . . . 5 ((𝑥 ⊆ 𝒫 𝑂 → (𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)) → (𝑥 ∈ 𝒫 𝒫 𝑂 → (𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)))
1613, 15mp1i 13 . . . 4 (𝑂𝑉 → (𝑥 ∈ 𝒫 𝒫 𝑂 → (𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)))
1716ralrimiv 3151 . . 3 (𝑂𝑉 → ∀𝑥 ∈ 𝒫 𝒫 𝑂(𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂))
182, 7, 173jca 1128 . 2 (𝑂𝑉 → (𝑂 ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝑂(𝑂𝑥) ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝒫 𝑂(𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)))
19 pwexg 5396 . . 3 (𝑂𝑉 → 𝒫 𝑂 ∈ V)
20 issiga 34076 . . 3 (𝒫 𝑂 ∈ V → (𝒫 𝑂 ∈ (sigAlgebra‘𝑂) ↔ (𝒫 𝑂 ⊆ 𝒫 𝑂 ∧ (𝑂 ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝑂(𝑂𝑥) ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝒫 𝑂(𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)))))
2119, 20syl 17 . 2 (𝑂𝑉 → (𝒫 𝑂 ∈ (sigAlgebra‘𝑂) ↔ (𝒫 𝑂 ⊆ 𝒫 𝑂 ∧ (𝑂 ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝑂(𝑂𝑥) ∈ 𝒫 𝑂 ∧ ∀𝑥 ∈ 𝒫 𝒫 𝑂(𝑥 ≼ ω → 𝑥 ∈ 𝒫 𝑂)))))
221, 18, 21mpbir2and 712 1 (𝑂𝑉 → 𝒫 𝑂 ∈ (sigAlgebra‘𝑂))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1087  wcel 2108  wral 3067  Vcvv 3488  cdif 3973  wss 3976  𝒫 cpw 4622   cuni 4931   class class class wbr 5166  cfv 6573  ωcom 7903  cdom 9001  sigAlgebracsiga 34072
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-sbc 3805  df-csb 3922  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-iota 6525  df-fun 6575  df-fv 6581  df-siga 34073
This theorem is referenced by:  sigagenval  34104  dmsigagen  34108  ldsysgenld  34124  pwcntmeas  34191  ddemeas  34200  mbfmcnt  34233
  Copyright terms: Public domain W3C validator