Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > sigagenval | Structured version Visualization version GIF version |
Description: Value of the generated sigma-algebra. (Contributed by Thierry Arnoux, 27-Dec-2016.) |
Ref | Expression |
---|---|
sigagenval | ⊢ (𝐴 ∈ 𝑉 → (sigaGen‘𝐴) = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-sigagen 32107 | . . 3 ⊢ sigaGen = (𝑥 ∈ V ↦ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠}) | |
2 | 1 | a1i 11 | . 2 ⊢ (𝐴 ∈ 𝑉 → sigaGen = (𝑥 ∈ V ↦ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠})) |
3 | unieq 4850 | . . . . . 6 ⊢ (𝑥 = 𝐴 → ∪ 𝑥 = ∪ 𝐴) | |
4 | 3 | fveq2d 6778 | . . . . 5 ⊢ (𝑥 = 𝐴 → (sigAlgebra‘∪ 𝑥) = (sigAlgebra‘∪ 𝐴)) |
5 | sseq1 3946 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ⊆ 𝑠 ↔ 𝐴 ⊆ 𝑠)) | |
6 | 4, 5 | rabeqbidv 3420 | . . . 4 ⊢ (𝑥 = 𝐴 → {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
7 | 6 | inteqd 4884 | . . 3 ⊢ (𝑥 = 𝐴 → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
8 | 7 | adantl 482 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑥 = 𝐴) → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝑥) ∣ 𝑥 ⊆ 𝑠} = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
9 | elex 3450 | . 2 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ V) | |
10 | uniexg 7593 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ∪ 𝐴 ∈ V) | |
11 | pwsiga 32098 | . . . . . . 7 ⊢ (∪ 𝐴 ∈ V → 𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴)) | |
12 | 10, 11 | syl 17 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴)) |
13 | pwuni 4878 | . . . . . 6 ⊢ 𝐴 ⊆ 𝒫 ∪ 𝐴 | |
14 | 12, 13 | jctir 521 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴) ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴)) |
15 | sseq2 3947 | . . . . . 6 ⊢ (𝑠 = 𝒫 ∪ 𝐴 → (𝐴 ⊆ 𝑠 ↔ 𝐴 ⊆ 𝒫 ∪ 𝐴)) | |
16 | 15 | elrab 3624 | . . . . 5 ⊢ (𝒫 ∪ 𝐴 ∈ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ↔ (𝒫 ∪ 𝐴 ∈ (sigAlgebra‘∪ 𝐴) ∧ 𝐴 ⊆ 𝒫 ∪ 𝐴)) |
17 | 14, 16 | sylibr 233 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝒫 ∪ 𝐴 ∈ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
18 | 17 | ne0d 4269 | . . 3 ⊢ (𝐴 ∈ 𝑉 → {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ≠ ∅) |
19 | intex 5261 | . . 3 ⊢ ({𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ≠ ∅ ↔ ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ∈ V) | |
20 | 18, 19 | sylib 217 | . 2 ⊢ (𝐴 ∈ 𝑉 → ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠} ∈ V) |
21 | 2, 8, 9, 20 | fvmptd 6882 | 1 ⊢ (𝐴 ∈ 𝑉 → (sigaGen‘𝐴) = ∩ {𝑠 ∈ (sigAlgebra‘∪ 𝐴) ∣ 𝐴 ⊆ 𝑠}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 {crab 3068 Vcvv 3432 ⊆ wss 3887 ∅c0 4256 𝒫 cpw 4533 ∪ cuni 4839 ∩ cint 4879 ↦ cmpt 5157 ‘cfv 6433 sigAlgebracsiga 32076 sigaGencsigagen 32106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 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 2709 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-int 4880 df-br 5075 df-opab 5137 df-mpt 5158 df-id 5489 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-iota 6391 df-fun 6435 df-fv 6441 df-siga 32077 df-sigagen 32107 |
This theorem is referenced by: sigagensiga 32109 sssigagen 32113 sigagenss 32117 |
Copyright terms: Public domain | W3C validator |