Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > isrnsiga | Structured version Visualization version GIF version |
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.) |
Ref | Expression |
---|---|
isrnsiga | ⊢ (𝑆 ∈ ∪ ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-siga 31363 | . . 3 ⊢ sigAlgebra = (𝑜 ∈ V ↦ {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑜 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠)))}) | |
2 | sigaex 31364 | . . 3 ⊢ {𝑠 ∣ (𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑜 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠)))} ∈ V | |
3 | sseq1 3991 | . . . 4 ⊢ (𝑠 = 𝑆 → (𝑠 ⊆ 𝒫 𝑜 ↔ 𝑆 ⊆ 𝒫 𝑜)) | |
4 | eleq2 2901 | . . . . 5 ⊢ (𝑠 = 𝑆 → (𝑜 ∈ 𝑠 ↔ 𝑜 ∈ 𝑆)) | |
5 | eleq2 2901 | . . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑜 ∖ 𝑥) ∈ 𝑠 ↔ (𝑜 ∖ 𝑥) ∈ 𝑆)) | |
6 | 5 | raleqbi1dv 3403 | . . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝑠 (𝑜 ∖ 𝑥) ∈ 𝑠 ↔ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆)) |
7 | pweq 4541 | . . . . . 6 ⊢ (𝑠 = 𝑆 → 𝒫 𝑠 = 𝒫 𝑆) | |
8 | eleq2 2901 | . . . . . . 7 ⊢ (𝑠 = 𝑆 → (∪ 𝑥 ∈ 𝑠 ↔ ∪ 𝑥 ∈ 𝑆)) | |
9 | 8 | imbi2d 343 | . . . . . 6 ⊢ (𝑠 = 𝑆 → ((𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠) ↔ (𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) |
10 | 7, 9 | raleqbidv 3401 | . . . . 5 ⊢ (𝑠 = 𝑆 → (∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠) ↔ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) |
11 | 4, 6, 10 | 3anbi123d 1432 | . . . 4 ⊢ (𝑠 = 𝑆 → ((𝑜 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑜 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠)) ↔ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))) |
12 | 3, 11 | anbi12d 632 | . . 3 ⊢ (𝑠 = 𝑆 → ((𝑠 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑠 ∧ ∀𝑥 ∈ 𝑠 (𝑜 ∖ 𝑥) ∈ 𝑠 ∧ ∀𝑥 ∈ 𝒫 𝑠(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑠))) ↔ (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))) |
13 | 1, 2, 12 | abfmpunirn 30391 | . 2 ⊢ (𝑆 ∈ ∪ ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))) |
14 | rexv 3520 | . . 3 ⊢ (∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) ↔ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))) | |
15 | 14 | anbi2i 624 | . 2 ⊢ ((𝑆 ∈ V ∧ ∃𝑜 ∈ V (𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))) ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))) |
16 | 13, 15 | bitri 277 | 1 ⊢ (𝑆 ∈ ∪ ran sigAlgebra ↔ (𝑆 ∈ V ∧ ∃𝑜(𝑆 ⊆ 𝒫 𝑜 ∧ (𝑜 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (𝑜 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1083 = wceq 1533 ∃wex 1776 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 Vcvv 3494 ∖ cdif 3932 ⊆ wss 3935 𝒫 cpw 4538 ∪ cuni 4831 class class class wbr 5058 ran crn 5550 ωcom 7574 ≼ cdom 8501 sigAlgebracsiga 31362 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-mpt 5139 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-iota 6308 df-fun 6351 df-fn 6352 df-fv 6357 df-siga 31363 |
This theorem is referenced by: 0elsiga 31368 sigaclcu 31371 issgon 31377 |
Copyright terms: Public domain | W3C validator |