Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > meaiunincf | Structured version Visualization version GIF version |
Description: Measures are continuous from below (bounded case): 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 Proposition 112C (e) of [Fremlin1] p. 16. (Contributed by Glauco Siliprandi, 13-Feb-2022.) |
Ref | Expression |
---|---|
meaiunincf.p | ⊢ Ⅎ𝑛𝜑 |
meaiunincf.f | ⊢ Ⅎ𝑛𝐸 |
meaiunincf.m | ⊢ (𝜑 → 𝑀 ∈ Meas) |
meaiunincf.n | ⊢ (𝜑 → 𝑁 ∈ ℤ) |
meaiunincf.z | ⊢ 𝑍 = (ℤ≥‘𝑁) |
meaiunincf.e | ⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀) |
meaiunincf.i | ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) |
meaiunincf.x | ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) |
meaiunincf.s | ⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) |
Ref | Expression |
---|---|
meaiunincf | ⊢ (𝜑 → 𝑆 ⇝ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | meaiunincf.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ Meas) | |
2 | meaiunincf.n | . . 3 ⊢ (𝜑 → 𝑁 ∈ ℤ) | |
3 | meaiunincf.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑁) | |
4 | meaiunincf.e | . . 3 ⊢ (𝜑 → 𝐸:𝑍⟶dom 𝑀) | |
5 | meaiunincf.p | . . . . . 6 ⊢ Ⅎ𝑛𝜑 | |
6 | nfv 1915 | . . . . . 6 ⊢ Ⅎ𝑛 𝑘 ∈ 𝑍 | |
7 | 5, 6 | nfan 1900 | . . . . 5 ⊢ Ⅎ𝑛(𝜑 ∧ 𝑘 ∈ 𝑍) |
8 | meaiunincf.f | . . . . . . 7 ⊢ Ⅎ𝑛𝐸 | |
9 | nfcv 2979 | . . . . . . 7 ⊢ Ⅎ𝑛𝑘 | |
10 | 8, 9 | nffv 6682 | . . . . . 6 ⊢ Ⅎ𝑛(𝐸‘𝑘) |
11 | nfcv 2979 | . . . . . . 7 ⊢ Ⅎ𝑛(𝑘 + 1) | |
12 | 8, 11 | nffv 6682 | . . . . . 6 ⊢ Ⅎ𝑛(𝐸‘(𝑘 + 1)) |
13 | 10, 12 | nfss 3962 | . . . . 5 ⊢ Ⅎ𝑛(𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)) |
14 | 7, 13 | nfim 1897 | . . . 4 ⊢ Ⅎ𝑛((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))) |
15 | eleq1w 2897 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝑛 ∈ 𝑍 ↔ 𝑘 ∈ 𝑍)) | |
16 | 15 | anbi2d 630 | . . . . 5 ⊢ (𝑛 = 𝑘 → ((𝜑 ∧ 𝑛 ∈ 𝑍) ↔ (𝜑 ∧ 𝑘 ∈ 𝑍))) |
17 | fveq2 6672 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐸‘𝑛) = (𝐸‘𝑘)) | |
18 | fvoveq1 7181 | . . . . . 6 ⊢ (𝑛 = 𝑘 → (𝐸‘(𝑛 + 1)) = (𝐸‘(𝑘 + 1))) | |
19 | 17, 18 | sseq12d 4002 | . . . . 5 ⊢ (𝑛 = 𝑘 → ((𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1)) ↔ (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1)))) |
20 | 16, 19 | imbi12d 347 | . . . 4 ⊢ (𝑛 = 𝑘 → (((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) ↔ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))))) |
21 | meaiunincf.i | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ 𝑍) → (𝐸‘𝑛) ⊆ (𝐸‘(𝑛 + 1))) | |
22 | 14, 20, 21 | chvarfv 2242 | . . 3 ⊢ ((𝜑 ∧ 𝑘 ∈ 𝑍) → (𝐸‘𝑘) ⊆ (𝐸‘(𝑘 + 1))) |
23 | meaiunincf.x | . . . 4 ⊢ (𝜑 → ∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥) | |
24 | breq2 5072 | . . . . . . 7 ⊢ (𝑥 = 𝑦 → ((𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ (𝑀‘(𝐸‘𝑛)) ≤ 𝑦)) | |
25 | 24 | ralbidv 3199 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑦)) |
26 | nfv 1915 | . . . . . . . 8 ⊢ Ⅎ𝑘(𝑀‘(𝐸‘𝑛)) ≤ 𝑦 | |
27 | nfcv 2979 | . . . . . . . . . 10 ⊢ Ⅎ𝑛𝑀 | |
28 | 27, 10 | nffv 6682 | . . . . . . . . 9 ⊢ Ⅎ𝑛(𝑀‘(𝐸‘𝑘)) |
29 | nfcv 2979 | . . . . . . . . 9 ⊢ Ⅎ𝑛 ≤ | |
30 | nfcv 2979 | . . . . . . . . 9 ⊢ Ⅎ𝑛𝑦 | |
31 | 28, 29, 30 | nfbr 5115 | . . . . . . . 8 ⊢ Ⅎ𝑛(𝑀‘(𝐸‘𝑘)) ≤ 𝑦 |
32 | 2fveq3 6677 | . . . . . . . . 9 ⊢ (𝑛 = 𝑘 → (𝑀‘(𝐸‘𝑛)) = (𝑀‘(𝐸‘𝑘))) | |
33 | 32 | breq1d 5078 | . . . . . . . 8 ⊢ (𝑛 = 𝑘 → ((𝑀‘(𝐸‘𝑛)) ≤ 𝑦 ↔ (𝑀‘(𝐸‘𝑘)) ≤ 𝑦)) |
34 | 26, 31, 33 | cbvralw 3443 | . . . . . . 7 ⊢ (∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑦 ↔ ∀𝑘 ∈ 𝑍 (𝑀‘(𝐸‘𝑘)) ≤ 𝑦) |
35 | 34 | a1i 11 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑦 ↔ ∀𝑘 ∈ 𝑍 (𝑀‘(𝐸‘𝑘)) ≤ 𝑦)) |
36 | 25, 35 | bitrd 281 | . . . . 5 ⊢ (𝑥 = 𝑦 → (∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ∀𝑘 ∈ 𝑍 (𝑀‘(𝐸‘𝑘)) ≤ 𝑦)) |
37 | 36 | cbvrexvw 3452 | . . . 4 ⊢ (∃𝑥 ∈ ℝ ∀𝑛 ∈ 𝑍 (𝑀‘(𝐸‘𝑛)) ≤ 𝑥 ↔ ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (𝑀‘(𝐸‘𝑘)) ≤ 𝑦) |
38 | 23, 37 | sylib 220 | . . 3 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑘 ∈ 𝑍 (𝑀‘(𝐸‘𝑘)) ≤ 𝑦) |
39 | meaiunincf.s | . . . 4 ⊢ 𝑆 = (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) | |
40 | nfcv 2979 | . . . . 5 ⊢ Ⅎ𝑘(𝑀‘(𝐸‘𝑛)) | |
41 | 40, 28, 32 | cbvmpt 5169 | . . . 4 ⊢ (𝑛 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑛))) = (𝑘 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑘))) |
42 | 39, 41 | eqtri 2846 | . . 3 ⊢ 𝑆 = (𝑘 ∈ 𝑍 ↦ (𝑀‘(𝐸‘𝑘))) |
43 | 1, 2, 3, 4, 22, 38, 42 | meaiuninc 42770 | . 2 ⊢ (𝜑 → 𝑆 ⇝ (𝑀‘∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘))) |
44 | nfcv 2979 | . . . 4 ⊢ Ⅎ𝑘(𝐸‘𝑛) | |
45 | fveq2 6672 | . . . 4 ⊢ (𝑘 = 𝑛 → (𝐸‘𝑘) = (𝐸‘𝑛)) | |
46 | 10, 44, 45 | cbviun 4963 | . . 3 ⊢ ∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘) = ∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛) |
47 | 46 | fveq2i 6675 | . 2 ⊢ (𝑀‘∪ 𝑘 ∈ 𝑍 (𝐸‘𝑘)) = (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛)) |
48 | 43, 47 | breqtrdi 5109 | 1 ⊢ (𝜑 → 𝑆 ⇝ (𝑀‘∪ 𝑛 ∈ 𝑍 (𝐸‘𝑛))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 Ⅎwnfc 2963 ∀wral 3140 ∃wrex 3141 ⊆ wss 3938 ∪ ciun 4921 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 ℝcr 10538 1c1 10540 + caddc 10542 ≤ cle 10678 ℤcz 11984 ℤ≥cuz 12246 ⇝ cli 14843 Meascmea 42738 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-inf2 9106 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-disj 5034 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-omul 8109 df-er 8291 df-map 8410 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-oi 8976 df-card 9370 df-acn 9373 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-xadd 12511 df-ico 12747 df-icc 12748 df-fz 12896 df-fzo 13037 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-clim 14847 df-sum 15045 df-salg 42601 df-sumge0 42652 df-mea 42739 |
This theorem is referenced by: meaiuninc3v 42773 |
Copyright terms: Public domain | W3C validator |