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 31360
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 31356 . . 3 sigAlgebra = (𝑜 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)))})
2 sigaex 31357 . . 3 {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)))} ∈ V
3 sseq1 3990 . . . 4 (𝑠 = 𝑆 → (𝑠 ⊆ 𝒫 𝑜𝑆 ⊆ 𝒫 𝑜))
4 eleq2 2899 . . . . 5 (𝑠 = 𝑆 → (𝑜𝑠𝑜𝑆))
5 eleq2 2899 . . . . . 6 (𝑠 = 𝑆 → ((𝑜𝑥) ∈ 𝑠 ↔ (𝑜𝑥) ∈ 𝑆))
65raleqbi1dv 3402 . . . . 5 (𝑠 = 𝑆 → (∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ↔ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆))
7 pweq 4540 . . . . . 6 (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆)
8 eleq2 2899 . . . . . . 7 (𝑠 = 𝑆 → ( 𝑥𝑠 𝑥𝑆))
98imbi2d 343 . . . . . 6 (𝑠 = 𝑆 → ((𝑥 ≼ ω → 𝑥𝑠) ↔ (𝑥 ≼ ω → 𝑥𝑆)))
107, 9raleqbidv 3400 . . . . 5 (𝑠 = 𝑆 → (∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠) ↔ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))
114, 6, 103anbi123d 1429 . . . 4 (𝑠 = 𝑆 → ((𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠)) ↔ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
123, 11anbi12d 632 . . 3 (𝑠 = 𝑆 → ((𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜𝑠 ∧ ∀𝑥𝑠 (𝑜𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → 𝑥𝑠))) ↔ (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
131, 2, 12abfmpunirn 30389 . 2 (𝑆 ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
14 rexv 3519 . . 3 (∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))) ↔ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆))))
1514anbi2i 624 . 2 ((𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))) ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
1613, 15bitri 277 1 (𝑆 ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜𝑆 ∧ ∀𝑥𝑆 (𝑜𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → 𝑥𝑆)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398  w3a 1081   = wceq 1530  wex 1773  wcel 2107  wral 3136  wrex 3137  Vcvv 3493  cdif 3931  wss 3934  𝒫 cpw 4537   cuni 4830   class class class wbr 5057  ran crn 5549  ωcom 7572  cdom 8499  sigAlgebracsiga 31355
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ral 3141  df-rex 3142  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-op 4566  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 31356
This theorem is referenced by:  0elsiga  31361  sigaclcu  31364  issgon  31370
  Copyright terms: Public domain W3C validator