![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > difelsiga | Structured version Visualization version GIF version |
Description: A sigma-algebra is closed under class differences. (Contributed by Thierry Arnoux, 13-Sep-2016.) |
Ref | Expression |
---|---|
difelsiga | ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∖ 𝐵) ∈ 𝑆) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp2 1132 | . . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝐴 ∈ 𝑆) | |
2 | elssuni 4619 | . . . 4 ⊢ (𝐴 ∈ 𝑆 → 𝐴 ⊆ ∪ 𝑆) | |
3 | difin2 4033 | . . . 4 ⊢ (𝐴 ⊆ ∪ 𝑆 → (𝐴 ∖ 𝐵) = ((∪ 𝑆 ∖ 𝐵) ∩ 𝐴)) | |
4 | 1, 2, 3 | 3syl 18 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∖ 𝐵) = ((∪ 𝑆 ∖ 𝐵) ∩ 𝐴)) |
5 | isrnsigau 30520 | . . . . . . . 8 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (𝑆 ⊆ 𝒫 ∪ 𝑆 ∧ (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆)))) | |
6 | 5 | simprd 482 | . . . . . . 7 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → (∪ 𝑆 ∈ 𝑆 ∧ ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ ∀𝑥 ∈ 𝒫 𝑆(𝑥 ≼ ω → ∪ 𝑥 ∈ 𝑆))) |
7 | 6 | simp2d 1138 | . . . . . 6 ⊢ (𝑆 ∈ ∪ ran sigAlgebra → ∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆) |
8 | difeq2 3865 | . . . . . . . 8 ⊢ (𝑥 = 𝐵 → (∪ 𝑆 ∖ 𝑥) = (∪ 𝑆 ∖ 𝐵)) | |
9 | 8 | eleq1d 2824 | . . . . . . 7 ⊢ (𝑥 = 𝐵 → ((∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ↔ (∪ 𝑆 ∖ 𝐵) ∈ 𝑆)) |
10 | 9 | rspccva 3448 | . . . . . 6 ⊢ ((∀𝑥 ∈ 𝑆 (∪ 𝑆 ∖ 𝑥) ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (∪ 𝑆 ∖ 𝐵) ∈ 𝑆) |
11 | 7, 10 | sylan 489 | . . . . 5 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐵 ∈ 𝑆) → (∪ 𝑆 ∖ 𝐵) ∈ 𝑆) |
12 | 11 | 3adant2 1126 | . . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (∪ 𝑆 ∖ 𝐵) ∈ 𝑆) |
13 | intprg 4663 | . . . 4 ⊢ (((∪ 𝑆 ∖ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → ∩ {(∪ 𝑆 ∖ 𝐵), 𝐴} = ((∪ 𝑆 ∖ 𝐵) ∩ 𝐴)) | |
14 | 12, 1, 13 | syl2anc 696 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∩ {(∪ 𝑆 ∖ 𝐵), 𝐴} = ((∪ 𝑆 ∖ 𝐵) ∩ 𝐴)) |
15 | 4, 14 | eqtr4d 2797 | . 2 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∖ 𝐵) = ∩ {(∪ 𝑆 ∖ 𝐵), 𝐴}) |
16 | simp1 1131 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → 𝑆 ∈ ∪ ran sigAlgebra) | |
17 | prssi 4498 | . . . . 5 ⊢ (((∪ 𝑆 ∖ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ⊆ 𝑆) | |
18 | 12, 1, 17 | syl2anc 696 | . . . 4 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ⊆ 𝑆) |
19 | prex 5058 | . . . . 5 ⊢ {(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ V | |
20 | 19 | elpw 4308 | . . . 4 ⊢ ({(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ 𝒫 𝑆 ↔ {(∪ 𝑆 ∖ 𝐵), 𝐴} ⊆ 𝑆) |
21 | 18, 20 | sylibr 224 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ 𝒫 𝑆) |
22 | prct 29822 | . . . 4 ⊢ (((∪ 𝑆 ∖ 𝐵) ∈ 𝑆 ∧ 𝐴 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ≼ ω) | |
23 | 12, 1, 22 | syl2anc 696 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ≼ ω) |
24 | prnzg 4454 | . . . 4 ⊢ ((∪ 𝑆 ∖ 𝐵) ∈ 𝑆 → {(∪ 𝑆 ∖ 𝐵), 𝐴} ≠ ∅) | |
25 | 12, 24 | syl 17 | . . 3 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → {(∪ 𝑆 ∖ 𝐵), 𝐴} ≠ ∅) |
26 | sigaclci 30525 | . . 3 ⊢ (((𝑆 ∈ ∪ ran sigAlgebra ∧ {(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ 𝒫 𝑆) ∧ ({(∪ 𝑆 ∖ 𝐵), 𝐴} ≼ ω ∧ {(∪ 𝑆 ∖ 𝐵), 𝐴} ≠ ∅)) → ∩ {(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ 𝑆) | |
27 | 16, 21, 23, 25, 26 | syl22anc 1478 | . 2 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → ∩ {(∪ 𝑆 ∖ 𝐵), 𝐴} ∈ 𝑆) |
28 | 15, 27 | eqeltrd 2839 | 1 ⊢ ((𝑆 ∈ ∪ ran sigAlgebra ∧ 𝐴 ∈ 𝑆 ∧ 𝐵 ∈ 𝑆) → (𝐴 ∖ 𝐵) ∈ 𝑆) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1072 = wceq 1632 ∈ wcel 2139 ≠ wne 2932 ∀wral 3050 ∖ cdif 3712 ∩ cin 3714 ⊆ wss 3715 ∅c0 4058 𝒫 cpw 4302 {cpr 4323 ∪ cuni 4588 ∩ cint 4627 class class class wbr 4804 ran crn 5267 ωcom 7231 ≼ cdom 8121 sigAlgebracsiga 30500 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1871 ax-4 1886 ax-5 1988 ax-6 2054 ax-7 2090 ax-8 2141 ax-9 2148 ax-10 2168 ax-11 2183 ax-12 2196 ax-13 2391 ax-ext 2740 ax-rep 4923 ax-sep 4933 ax-nul 4941 ax-pow 4992 ax-pr 5055 ax-un 7115 ax-inf2 8713 ax-ac2 9497 |
This theorem depends on definitions: df-bi 197 df-or 384 df-an 385 df-3or 1073 df-3an 1074 df-tru 1635 df-fal 1638 df-ex 1854 df-nf 1859 df-sb 2047 df-eu 2611 df-mo 2612 df-clab 2747 df-cleq 2753 df-clel 2756 df-nfc 2891 df-ne 2933 df-ral 3055 df-rex 3056 df-reu 3057 df-rmo 3058 df-rab 3059 df-v 3342 df-sbc 3577 df-csb 3675 df-dif 3718 df-un 3720 df-in 3722 df-ss 3729 df-pss 3731 df-nul 4059 df-if 4231 df-pw 4304 df-sn 4322 df-pr 4324 df-tp 4326 df-op 4328 df-uni 4589 df-int 4628 df-iun 4674 df-iin 4675 df-br 4805 df-opab 4865 df-mpt 4882 df-tr 4905 df-id 5174 df-eprel 5179 df-po 5187 df-so 5188 df-fr 5225 df-se 5226 df-we 5227 df-xp 5272 df-rel 5273 df-cnv 5274 df-co 5275 df-dm 5276 df-rn 5277 df-res 5278 df-ima 5279 df-pred 5841 df-ord 5887 df-on 5888 df-lim 5889 df-suc 5890 df-iota 6012 df-fun 6051 df-fn 6052 df-f 6053 df-f1 6054 df-fo 6055 df-f1o 6056 df-fv 6057 df-isom 6058 df-riota 6775 df-ov 6817 df-oprab 6818 df-mpt2 6819 df-om 7232 df-1st 7334 df-2nd 7335 df-wrecs 7577 df-recs 7638 df-rdg 7676 df-1o 7730 df-2o 7731 df-oadd 7734 df-er 7913 df-map 8027 df-en 8124 df-dom 8125 df-sdom 8126 df-fin 8127 df-oi 8582 df-card 8975 df-acn 8978 df-ac 9149 df-cda 9202 df-siga 30501 |
This theorem is referenced by: inelsiga 30528 sigainb 30529 sigaldsys 30552 cldssbrsiga 30580 measxun2 30603 measssd 30608 measunl 30609 measiuns 30610 measiun 30611 meascnbl 30612 imambfm 30654 dya2iocbrsiga 30667 dya2icobrsiga 30668 sxbrsigalem2 30678 probdif 30812 |
Copyright terms: Public domain | W3C validator |