![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > unelsiga | Structured version Visualization version GIF version |
Description: A sigma-algebra is closed under pairwise unions. (Contributed by Thierry Arnoux, 13-Dec-2016.) |
Ref | Expression |
---|---|
unelsiga | ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∪ 𝐵) ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | uniprg 4924 | . . 3 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
2 | 1 | 3adant1 1130 | . 2 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) |
3 | isrnsigau 33113 | . . . . . 6 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (𝑆 ⊆ 𝒫 ∪ 𝑆 ∧ (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))) | |
4 | 3 | simprd 496 | . . . . 5 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) |
5 | 4 | simp3d 1144 | . . . 4 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)) |
6 | 5 | 3ad2ant1 1133 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)) |
7 | prct 31926 | . . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {𝐴, 𝐵} ≼ ω) | |
8 | 7 | 3adant1 1130 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {𝐴, 𝐵} ≼ ω) |
9 | prelpwi 5446 | . . . . 5 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {𝐴, 𝐵} ∈ 𝒫 𝑆) | |
10 | breq1 5150 | . . . . . . 7 ⊢ (𝑥 = {𝐴, 𝐵} → (𝑥 ≼ ω ↔ {𝐴, 𝐵} ≼ ω)) | |
11 | unieq 4918 | . . . . . . . 8 ⊢ (𝑥 = {𝐴, 𝐵} → ∪ 𝑥 = ∪ {𝐴, 𝐵}) | |
12 | 11 | eleq1d 2818 | . . . . . . 7 ⊢ (𝑥 = {𝐴, 𝐵} → (∪ 𝑥 ∈ 𝑆 ↔ ∪ {𝐴, 𝐵} ∈ 𝑆)) |
13 | 10, 12 | imbi12d 344 | . . . . . 6 ⊢ (𝑥 = {𝐴, 𝐵} → ((𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) ↔ ({𝐴, 𝐵} ≼ ω → ∪ {𝐴, 𝐵} ∈ 𝑆))) |
14 | 13 | rspcv 3608 | . . . . 5 ⊢ ({𝐴, 𝐵} ∈ 𝒫 𝑆 → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) → ({𝐴, 𝐵} ≼ ω → ∪ {𝐴, 𝐵} ∈ 𝑆))) |
15 | 9, 14 | syl 17 | . . . 4 ⊢ ((𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) → ({𝐴, 𝐵} ≼ ω → ∪ {𝐴, 𝐵} ∈ 𝑆))) |
16 | 15 | 3adant1 1130 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆) → ({𝐴, 𝐵} ≼ ω → ∪ {𝐴, 𝐵} ∈ 𝑆))) |
17 | 6, 8, 16 | mp2d 49 | . 2 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∪ {𝐴, 𝐵} ∈ 𝑆) |
18 | 2, 17 | eqeltrrd 2834 | 1 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∪ 𝐵) ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1087 = wceq 1541 ∈ wcel 2106 ∀wral 3061 ∖ cdif 3944 ∪ cun 3945 ⊆ wss 3947 𝒫 cpw 4601 {cpr 4629 ∪ cuni 4907 class class class wbr 5147 ran crn 5676 ωcom 7851 ≼ cdom 8933 sigAlgebracsiga 33094 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2703 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7721 ax-inf2 9632 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3or 1088 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-nf 1786 df-sb 2068 df-mo 2534 df-eu 2563 df-clab 2710 df-cleq 2724 df-clel 2810 df-nfc 2885 df-ne 2941 df-ral 3062 df-rex 3071 df-rmo 3376 df-reu 3377 df-rab 3433 df-v 3476 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-int 4950 df-iun 4998 df-br 5148 df-opab 5210 df-mpt 5231 df-tr 5265 df-id 5573 df-eprel 5579 df-po 5587 df-so 5588 df-fr 5630 df-se 5631 df-we 5632 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-pred 6297 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6492 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-riota 7361 df-ov 7408 df-om 7852 df-1st 7971 df-2nd 7972 df-frecs 8262 df-wrecs 8293 df-recs 8367 df-rdg 8406 df-1o 8462 df-2o 8463 df-er 8699 df-en 8936 df-dom 8937 df-sdom 8938 df-fin 8939 df-oi 9501 df-dju 9892 df-card 9930 df-siga 33095 |
This theorem is referenced by: measun 33197 aean 33230 sibfof 33327 |
Copyright terms: Public domain | W3C validator |