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

Theorem isrnsiga 31271
Description: The property of being a sigma-algebra on an indefinite base set. (Contributed by Thierry Arnoux, 3-Sep-2016.) (Proof shortened by Thierry Arnoux, 23-Oct-2016.)
Assertion
Ref Expression
isrnsiga (𝑆 ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
Distinct variable group:   𝑥,𝑜,𝑆

Proof of Theorem isrnsiga
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 df-siga 31267 . . 3 sigAlgebra = (𝑜 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)))})
2 sigaex 31268 . . 3 {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)))} ∈ V
3 sseq1 3989 . . . 4 (𝑠 = 𝑆 → (𝑠 ⊆ 𝒫 𝑜𝑆 ⊆ 𝒫 𝑜))
4 eleq2 2898 . . . . 5 (𝑠 = 𝑆 → (𝑜𝑠𝑜𝑆))
5 eleq2 2898 . . . . . 6 (𝑠 = 𝑆 → ((𝑜𝑥) ∈ 𝑠 ↔ (𝑜𝑥) ∈ 𝑆))
65raleqbi1dv 3401 . . . . 5 (𝑠 = 𝑆 → (∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ↔ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆))
7 pweq 4538 . . . . . 6 (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
8 eleq2 2898 . . . . . . 7 (𝑠 = 𝑆 → ( 𝑥𝑠 𝑥𝑆))
98imbi2d 342 . . . . . 6 (𝑠 = 𝑆 → ((𝑥 ≼ ω → 𝑥𝑠) ↔ (𝑥 ≼ ω → 𝑥𝑆)))
107, 9raleqbidv 3399 . . . . 5 (𝑠 = 𝑆 → (∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠) ↔ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
114, 6, 103anbi123d 1427 . . . 4 (𝑠 = 𝑆 → ((𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)) ↔ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
123, 11anbi12d 630 . . 3 (𝑠 = 𝑆 → ((𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠))) ↔ (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
131, 2, 12abfmpunirn 30325 . 2 (𝑆 ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
14 rexv 3518 . . 3 (∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))) ↔ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
1514anbi2i 622 . 2 ((𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))) ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
1613, 15bitri 276 1 (𝑆 ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 207  wa 396  w3a 1079   = wceq 1528  wex 1771  wcel 2105  wral 3135  wrex 3136  Vcvv 3492  cdif 3930  wss 3933  𝒫 cpw 4535   cuni 4830   class class class wbr 5057  ran crn 5549  ωcom 7569  cdom 8495  sigAlgebracsiga 31266
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-8 2107  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-ext 2790  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-3an 1081  df-tru 1531  df-ex 1772  df-nf 1776  df-sb 2061  df-mo 2615  df-eu 2647  df-clab 2797  df-cleq 2811  df-clel 2890  df-nfc 2960  df-ral 3140  df-rex 3141  df-rab 3144  df-v 3494  df-sbc 3770  df-csb 3881  df-dif 3936  df-un 3938  df-in 3940  df-ss 3949  df-nul 4289  df-if 4464  df-pw 4537  df-sn 4558  df-pr 4560  df-op 4564  df-uni 4831  df-br 5058  df-opab 5120  df-mpt 5138  df-id 5453  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-iota 6307  df-fun 6350  df-fn 6351  df-fv 6356  df-siga 31267
This theorem is referenced by:  0elsiga  31272  sigaclcu  31275  issgon  31281
  Copyright terms: Public domain W3C validator