Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > meaiuninc3 | Structured version Visualization version GIF version |
Description: Measures are continuous from below: if 𝐸 is a sequence of nondecreasing measurable sets (with bounded measure) then the measure of the union is the limit of the measures. This is the general case of Proposition 112C (e) of [Fremlin1] p. 16 . This theorem generalizes meaiuninc 42640 and meaiuninc2 42641 where the sequence is required to be bounded. (Contributed by Glauco Siliprandi, 13-Feb-2022.) |
Ref | Expression |
---|---|
meaiuninc3.p | ⊢ Ⅎ𝑛𝜑 |
meaiuninc3.f | ⊢ Ⅎ𝑛𝐸 |
meaiuninc3.m | ⊢ (𝜑 → 𝑀 ∈ Meas) |
meaiuninc3.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
meaiuninc3.z | ⊢ 𝑍 = (ℤ≥‘𝑁) |
meaiuninc3.e | ⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀) |
meaiuninc3.i | ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) |
meaiuninc3.s | ⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) |
Ref | Expression |
---|---|
meaiuninc3 | ⊢ (𝜑 → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | meaiuninc3.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ Meas) | |
2 | meaiuninc3.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
3 | meaiuninc3.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑁) | |
4 | meaiuninc3.e | . . 3 ⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀) | |
5 | meaiuninc3.p | . . . . . 6 ⊢ Ⅎ𝑛𝜑 | |
6 | nfv 1906 | . . . . . 6 ⊢ Ⅎ𝑛 𝑘 ∈ 𝑍 | |
7 | 5, 6 | nfan 1891 | . . . . 5 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑘 ∈ 𝑍) |
8 | meaiuninc3.f | . . . . . . 7 ⊢ Ⅎ𝑛𝐸 | |
9 | nfcv 2974 | . . . . . . 7 ⊢ Ⅎ𝑛𝑘 | |
10 | 8, 9 | nffv 6673 | . . . . . 6 ⊢ Ⅎ𝑛(𝐸‘𝑘) |
11 | nfcv 2974 | . . . . . . 7 ⊢ Ⅎ𝑛(𝑘 + 1) | |
12 | 8, 11 | nffv 6673 | . . . . . 6 ⊢ Ⅎ𝑛(𝐸‘(𝑘 + 1)) |
13 | 10, 12 | nfss 3957 | . . . . 5 ⊢ Ⅎ𝑛(𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)) |
14 | 7, 13 | nfim 1888 | . . . 4 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))) |
15 | eleq1w 2892 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝑛 ∈ 𝑍 ↔ 𝑘 ∈ 𝑍)) | |
16 | 15 | anbi2d 628 | . . . . 5 ⊢ (𝑛 = 𝑘 → ((𝜑 ∧ 𝑛 ∈ 𝑍) ↔ (𝜑 ∧ 𝑘 ∈ 𝑍))) |
17 | fveq2 6663 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐸‘𝑛) = (𝐸‘𝑘)) | |
18 | fvoveq1 7168 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐸‘(𝑛 + 1)) = (𝐸‘(𝑘 + 1))) | |
19 | 17, 18 | sseq12d 3997 | . . . . 5 ⊢ (𝑛 = 𝑘 → ((𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)) ↔ (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))) |
20 | 16, 19 | imbi12d 346 | . . . 4 ⊢ (𝑛 = 𝑘 → (((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) ↔ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))))) |
21 | meaiuninc3.i | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) | |
22 | 14, 20, 21 | chvarfv 2232 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))) |
23 | meaiuninc3.s | . . . 4 ⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) | |
24 | nfcv 2974 | . . . . . 6 ⊢ Ⅎ𝑘𝑀 | |
25 | nfcv 2974 | . . . . . 6 ⊢ Ⅎ𝑘(𝐸‘𝑛) | |
26 | 24, 25 | nffv 6673 | . . . . 5 ⊢ Ⅎ𝑘(𝑀‘(𝐸‘𝑛)) |
27 | nfcv 2974 | . . . . . 6 ⊢ Ⅎ𝑛𝑀 | |
28 | 27, 10 | nffv 6673 | . . . . 5 ⊢ Ⅎ𝑛(𝑀‘(𝐸‘𝑘)) |
29 | 2fveq3 6668 | . . . . 5 ⊢ (𝑛 = 𝑘 → (𝑀‘(𝐸‘𝑛)) = (𝑀‘(𝐸‘𝑘))) | |
30 | 26, 28, 29 | cbvmpt 5158 | . . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) = (𝑘 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑘))) |
31 | 23, 30 | eqtri 2841 | . . 3 ⊢ 𝑆 = (𝑘 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑘))) |
32 | 1, 2, 3, 4, 22, 31 | meaiuninc3v 42643 | . 2 ⊢ (𝜑 → 𝑆~~>*(𝑀‘∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘))) |
33 | fveq2 6663 | . . . 4 ⊢ (𝑘 = 𝑛 → (𝐸‘𝑘) = (𝐸‘𝑛)) | |
34 | 10, 25, 33 | cbviun 4952 | . . 3 ⊢ ∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘) = ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) |
35 | 34 | fveq2i 6666 | . 2 ⊢ (𝑀‘∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘)) = (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) |
36 | 32, 35 | breqtrdi 5098 | 1 ⊢ (𝜑 → 𝑆~~>*(𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 = wceq 1528 Ⅎwnf 1775 ∈ wcel 2105 Ⅎwnfc 2958 ⊆ wss 3933 ∪ ciun 4910 class class class wbr 5057 ↦ cmpt 5137 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 (class class class)co 7145 1c1 10526 + caddc 10528 ℤcz 11969 ℤ≥cuz 12231 ~~>*clsxlim 41975 Meascmea 42608 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 ax-inf2 9092 ax-cnex 10581 ax-resscn 10582 ax-1cn 10583 ax-icn 10584 ax-addcl 10585 ax-addrcl 10586 ax-mulcl 10587 ax-mulrcl 10588 ax-mulcom 10589 ax-addass 10590 ax-mulass 10591 ax-distr 10592 ax-i2m1 10593 ax-1ne0 10594 ax-1rid 10595 ax-rnegex 10596 ax-rrecex 10597 ax-cnre 10598 ax-pre-lttri 10599 ax-pre-lttrn 10600 ax-pre-ltadd 10601 ax-pre-mulgt0 10602 ax-pre-sup 10603 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3or 1080 df-3an 1081 df-tru 1531 df-fal 1541 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-nel 3121 df-ral 3140 df-rex 3141 df-reu 3142 df-rmo 3143 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-pss 3951 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4831 df-int 4868 df-iun 4912 df-disj 5023 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-se 5508 df-we 5509 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-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-isom 6357 df-riota 7103 df-ov 7148 df-oprab 7149 df-mpo 7150 df-om 7570 df-1st 7678 df-2nd 7679 df-wrecs 7936 df-recs 7997 df-rdg 8035 df-1o 8091 df-oadd 8095 df-omul 8096 df-er 8278 df-map 8397 df-pm 8398 df-en 8498 df-dom 8499 df-sdom 8500 df-fin 8501 df-fi 8863 df-sup 8894 df-inf 8895 df-oi 8962 df-card 9356 df-acn 9359 df-pnf 10665 df-mnf 10666 df-xr 10667 df-ltxr 10668 df-le 10669 df-sub 10860 df-neg 10861 df-div 11286 df-nn 11627 df-2 11688 df-3 11689 df-4 11690 df-5 11691 df-6 11692 df-7 11693 df-8 11694 df-9 11695 df-n0 11886 df-z 11970 df-dec 12087 df-uz 12232 df-q 12337 df-rp 12378 df-xneg 12495 df-xadd 12496 df-xmul 12497 df-ioo 12730 df-ioc 12731 df-ico 12732 df-icc 12733 df-fz 12881 df-fzo 13022 df-fl 13150 df-seq 13358 df-exp 13418 df-hash 13679 df-cj 14446 df-re 14447 df-im 14448 df-sqrt 14582 df-abs 14583 df-clim 14833 df-rlim 14834 df-sum 15031 df-struct 16473 df-ndx 16474 df-slot 16475 df-base 16477 df-plusg 16566 df-mulr 16567 df-starv 16568 df-tset 16572 df-ple 16573 df-ds 16575 df-unif 16576 df-rest 16684 df-topn 16685 df-topgen 16705 df-ordt 16762 df-ps 17798 df-tsr 17799 df-psmet 20465 df-xmet 20466 df-met 20467 df-bl 20468 df-mopn 20469 df-cnfld 20474 df-top 21430 df-topon 21447 df-topsp 21469 df-bases 21482 df-lm 21765 df-xms 22857 df-ms 22858 df-xlim 41976 df-salg 42471 df-sumge0 42522 df-mea 42609 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |