| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > uniiccmbl | Structured version Visualization version GIF version | ||
| Description: An almost-disjoint union of closed intervals is measurable. (This proof does not use countable choice, unlike iunmbl 25510.) (Contributed by Mario Carneiro, 25-Mar-2015.) |
| Ref | Expression |
|---|---|
| uniioombl.1 | ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) |
| uniioombl.2 | ⊢ (𝜑 → Disj 𝑥 ∈ ℕ ((,)‘(𝐹‘𝑥))) |
| uniioombl.3 | ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) |
| Ref | Expression |
|---|---|
| uniiccmbl | ⊢ (𝜑 → ∪ ran ([,] ∘ 𝐹) ∈ dom vol) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniioombl.1 | . . . . 5 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) | |
| 2 | 1 | uniiccdif 25535 | . . . 4 ⊢ (𝜑 → (∪ ran ((,) ∘ 𝐹) ⊆ ∪ ran ([,] ∘ 𝐹) ∧ (vol*‘(∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) = 0)) |
| 3 | 2 | simpld 494 | . . 3 ⊢ (𝜑 → ∪ ran ((,) ∘ 𝐹) ⊆ ∪ ran ([,] ∘ 𝐹)) |
| 4 | undif 4434 | . . 3 ⊢ (∪ ran ((,) ∘ 𝐹) ⊆ ∪ ran ([,] ∘ 𝐹) ↔ (∪ ran ((,) ∘ 𝐹) ∪ (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) = ∪ ran ([,] ∘ 𝐹)) | |
| 5 | 3, 4 | sylib 218 | . 2 ⊢ (𝜑 → (∪ ran ((,) ∘ 𝐹) ∪ (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) = ∪ ran ([,] ∘ 𝐹)) |
| 6 | uniioombl.2 | . . . 4 ⊢ (𝜑 → Disj 𝑥 ∈ ℕ ((,)‘(𝐹‘𝑥))) | |
| 7 | uniioombl.3 | . . . 4 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
| 8 | 1, 6, 7 | uniioombl 25546 | . . 3 ⊢ (𝜑 → ∪ ran ((,) ∘ 𝐹) ∈ dom vol) |
| 9 | ovolficcss 25426 | . . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ∪ ran ([,] ∘ 𝐹) ⊆ ℝ) | |
| 10 | 1, 9 | syl 17 | . . . . 5 ⊢ (𝜑 → ∪ ran ([,] ∘ 𝐹) ⊆ ℝ) |
| 11 | 10 | ssdifssd 4099 | . . . 4 ⊢ (𝜑 → (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹)) ⊆ ℝ) |
| 12 | 2 | simprd 495 | . . . 4 ⊢ (𝜑 → (vol*‘(∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) = 0) |
| 13 | nulmbl 25492 | . . . 4 ⊢ (((∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹)) ⊆ ℝ ∧ (vol*‘(∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) = 0) → (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹)) ∈ dom vol) | |
| 14 | 11, 12, 13 | syl2anc 584 | . . 3 ⊢ (𝜑 → (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹)) ∈ dom vol) |
| 15 | unmbl 25494 | . . 3 ⊢ ((∪ ran ((,) ∘ 𝐹) ∈ dom vol ∧ (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹)) ∈ dom vol) → (∪ ran ((,) ∘ 𝐹) ∪ (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) ∈ dom vol) | |
| 16 | 8, 14, 15 | syl2anc 584 | . 2 ⊢ (𝜑 → (∪ ran ((,) ∘ 𝐹) ∪ (∪ ran ([,] ∘ 𝐹) ∖ ∪ ran ((,) ∘ 𝐹))) ∈ dom vol) |
| 17 | 5, 16 | eqeltrrd 2837 | 1 ⊢ (𝜑 → ∪ ran ([,] ∘ 𝐹) ∈ dom vol) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1541 ∈ wcel 2113 ∖ cdif 3898 ∪ cun 3899 ∩ cin 3900 ⊆ wss 3901 ∪ cuni 4863 Disj wdisj 5065 × cxp 5622 dom cdm 5624 ran crn 5625 ∘ ccom 5628 ⟶wf 6488 ‘cfv 6492 ℝcr 11025 0cc0 11026 1c1 11027 + caddc 11029 ≤ cle 11167 − cmin 11364 ℕcn 12145 (,)cioo 13261 [,]cicc 13264 seqcseq 13924 abscabs 15157 vol*covol 25419 volcvol 25420 |
| 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 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2184 ax-ext 2708 ax-rep 5224 ax-sep 5241 ax-nul 5251 ax-pow 5310 ax-pr 5377 ax-un 7680 ax-inf2 9550 ax-cnex 11082 ax-resscn 11083 ax-1cn 11084 ax-icn 11085 ax-addcl 11086 ax-addrcl 11087 ax-mulcl 11088 ax-mulrcl 11089 ax-mulcom 11090 ax-addass 11091 ax-mulass 11092 ax-distr 11093 ax-i2m1 11094 ax-1ne0 11095 ax-1rid 11096 ax-rnegex 11097 ax-rrecex 11098 ax-cnre 11099 ax-pre-lttri 11100 ax-pre-lttrn 11101 ax-pre-ltadd 11102 ax-pre-mulgt0 11103 ax-pre-sup 11104 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3350 df-reu 3351 df-rab 3400 df-v 3442 df-sbc 3741 df-csb 3850 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-pss 3921 df-nul 4286 df-if 4480 df-pw 4556 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-int 4903 df-iun 4948 df-disj 5066 df-br 5099 df-opab 5161 df-mpt 5180 df-tr 5206 df-id 5519 df-eprel 5524 df-po 5532 df-so 5533 df-fr 5577 df-se 5578 df-we 5579 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-pred 6259 df-ord 6320 df-on 6321 df-lim 6322 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-isom 6501 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-of 7622 df-om 7809 df-1st 7933 df-2nd 7934 df-frecs 8223 df-wrecs 8254 df-recs 8303 df-rdg 8341 df-1o 8397 df-2o 8398 df-er 8635 df-map 8765 df-pm 8766 df-en 8884 df-dom 8885 df-sdom 8886 df-fin 8887 df-fi 9314 df-sup 9345 df-inf 9346 df-oi 9415 df-dju 9813 df-card 9851 df-acn 9854 df-pnf 11168 df-mnf 11169 df-xr 11170 df-ltxr 11171 df-le 11172 df-sub 11366 df-neg 11367 df-div 11795 df-nn 12146 df-2 12208 df-3 12209 df-4 12210 df-n0 12402 df-z 12489 df-uz 12752 df-q 12862 df-rp 12906 df-xneg 13026 df-xadd 13027 df-xmul 13028 df-ioo 13265 df-ico 13267 df-icc 13268 df-fz 13424 df-fzo 13571 df-fl 13712 df-seq 13925 df-exp 13985 df-hash 14254 df-cj 15022 df-re 15023 df-im 15024 df-sqrt 15158 df-abs 15159 df-clim 15411 df-rlim 15412 df-sum 15610 df-rest 17342 df-topgen 17363 df-psmet 21301 df-xmet 21302 df-met 21303 df-bl 21304 df-mopn 21305 df-top 22838 df-topon 22855 df-bases 22890 df-cmp 23331 df-ovol 25421 df-vol 25422 |
| This theorem is referenced by: dyadmbl 25557 |
| Copyright terms: Public domain | W3C validator |