MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  uniiccvol Structured version   Visualization version   GIF version

Theorem uniiccvol 24744
Description: An almost-disjoint union of closed intervals (disjoint interiors) has volume equal to the sum of the volume of the intervals. (This proof does not use countable choice, unlike voliun 24718.) (Contributed by Mario Carneiro, 25-Mar-2015.)
Hypotheses
Ref Expression
uniioombl.1 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
uniioombl.2 (𝜑Disj 𝑥 ∈ ℕ ((,)‘(𝐹𝑥)))
uniioombl.3 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
Assertion
Ref Expression
uniiccvol (𝜑 → (vol*‘ ran ([,] ∘ 𝐹)) = sup(ran 𝑆, ℝ*, < ))
Distinct variable groups:   𝑥,𝐹   𝜑,𝑥
Allowed substitution hint:   𝑆(𝑥)

Proof of Theorem uniiccvol
StepHypRef Expression
1 uniioombl.1 . . . 4 (𝜑𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)))
2 ovolficcss 24633 . . . 4 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → ran ([,] ∘ 𝐹) ⊆ ℝ)
31, 2syl 17 . . 3 (𝜑 ran ([,] ∘ 𝐹) ⊆ ℝ)
4 ovolcl 24642 . . 3 ( ran ([,] ∘ 𝐹) ⊆ ℝ → (vol*‘ ran ([,] ∘ 𝐹)) ∈ ℝ*)
53, 4syl 17 . 2 (𝜑 → (vol*‘ ran ([,] ∘ 𝐹)) ∈ ℝ*)
6 eqid 2738 . . . . . . 7 ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹)
7 uniioombl.3 . . . . . . 7 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹))
86, 7ovolsf 24636 . . . . . 6 (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞))
91, 8syl 17 . . . . 5 (𝜑𝑆:ℕ⟶(0[,)+∞))
109frnd 6608 . . . 4 (𝜑 → ran 𝑆 ⊆ (0[,)+∞))
11 icossxr 13164 . . . 4 (0[,)+∞) ⊆ ℝ*
1210, 11sstrdi 3933 . . 3 (𝜑 → ran 𝑆 ⊆ ℝ*)
13 supxrcl 13049 . . 3 (ran 𝑆 ⊆ ℝ* → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*)
1412, 13syl 17 . 2 (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*)
15 ssid 3943 . . 3 ran ([,] ∘ 𝐹) ⊆ ran ([,] ∘ 𝐹)
167ovollb2 24653 . . 3 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ran ([,] ∘ 𝐹) ⊆ ran ([,] ∘ 𝐹)) → (vol*‘ ran ([,] ∘ 𝐹)) ≤ sup(ran 𝑆, ℝ*, < ))
171, 15, 16sylancl 586 . 2 (𝜑 → (vol*‘ ran ([,] ∘ 𝐹)) ≤ sup(ran 𝑆, ℝ*, < ))
18 uniioombl.2 . . . 4 (𝜑Disj 𝑥 ∈ ℕ ((,)‘(𝐹𝑥)))
191, 18, 7uniioovol 24743 . . 3 (𝜑 → (vol*‘ ran ((,) ∘ 𝐹)) = sup(ran 𝑆, ℝ*, < ))
20 ioossicc 13165 . . . . . . . . . . . 12 ((1st ‘(𝐹𝑥))(,)(2nd ‘(𝐹𝑥))) ⊆ ((1st ‘(𝐹𝑥))[,](2nd ‘(𝐹𝑥)))
21 df-ov 7278 . . . . . . . . . . . 12 ((1st ‘(𝐹𝑥))(,)(2nd ‘(𝐹𝑥))) = ((,)‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩)
22 df-ov 7278 . . . . . . . . . . . 12 ((1st ‘(𝐹𝑥))[,](2nd ‘(𝐹𝑥))) = ([,]‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩)
2320, 21, 223sstr3i 3963 . . . . . . . . . . 11 ((,)‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩) ⊆ ([,]‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩)
2423a1i 11 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → ((,)‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩) ⊆ ([,]‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩))
25 ffvelrn 6959 . . . . . . . . . . . . 13 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (𝐹𝑥) ∈ ( ≤ ∩ (ℝ × ℝ)))
2625elin2d 4133 . . . . . . . . . . . 12 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (𝐹𝑥) ∈ (ℝ × ℝ))
27 1st2nd2 7870 . . . . . . . . . . . 12 ((𝐹𝑥) ∈ (ℝ × ℝ) → (𝐹𝑥) = ⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩)
2826, 27syl 17 . . . . . . . . . . 11 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (𝐹𝑥) = ⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩)
2928fveq2d 6778 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → ((,)‘(𝐹𝑥)) = ((,)‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩))
3028fveq2d 6778 . . . . . . . . . 10 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → ([,]‘(𝐹𝑥)) = ([,]‘⟨(1st ‘(𝐹𝑥)), (2nd ‘(𝐹𝑥))⟩))
3124, 29, 303sstr4d 3968 . . . . . . . . 9 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → ((,)‘(𝐹𝑥)) ⊆ ([,]‘(𝐹𝑥)))
32 fvco3 6867 . . . . . . . . 9 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑥) = ((,)‘(𝐹𝑥)))
33 fvco3 6867 . . . . . . . . 9 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (([,] ∘ 𝐹)‘𝑥) = ([,]‘(𝐹𝑥)))
3431, 32, 333sstr4d 3968 . . . . . . . 8 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ 𝑥 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑥) ⊆ (([,] ∘ 𝐹)‘𝑥))
351, 34sylan 580 . . . . . . 7 ((𝜑𝑥 ∈ ℕ) → (((,) ∘ 𝐹)‘𝑥) ⊆ (([,] ∘ 𝐹)‘𝑥))
3635ralrimiva 3103 . . . . . 6 (𝜑 → ∀𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) ⊆ (([,] ∘ 𝐹)‘𝑥))
37 ss2iun 4942 . . . . . 6 (∀𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) ⊆ (([,] ∘ 𝐹)‘𝑥) → 𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) ⊆ 𝑥 ∈ ℕ (([,] ∘ 𝐹)‘𝑥))
3836, 37syl 17 . . . . 5 (𝜑 𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) ⊆ 𝑥 ∈ ℕ (([,] ∘ 𝐹)‘𝑥))
39 ioof 13179 . . . . . . . 8 (,):(ℝ* × ℝ*)⟶𝒫 ℝ
40 ffn 6600 . . . . . . . 8 ((,):(ℝ* × ℝ*)⟶𝒫 ℝ → (,) Fn (ℝ* × ℝ*))
4139, 40ax-mp 5 . . . . . . 7 (,) Fn (ℝ* × ℝ*)
42 inss2 4163 . . . . . . . . 9 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ × ℝ)
43 rexpssxrxp 11020 . . . . . . . . 9 (ℝ × ℝ) ⊆ (ℝ* × ℝ*)
4442, 43sstri 3930 . . . . . . . 8 ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)
45 fss 6617 . . . . . . . 8 ((𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) ∧ ( ≤ ∩ (ℝ × ℝ)) ⊆ (ℝ* × ℝ*)) → 𝐹:ℕ⟶(ℝ* × ℝ*))
461, 44, 45sylancl 586 . . . . . . 7 (𝜑𝐹:ℕ⟶(ℝ* × ℝ*))
47 fnfco 6639 . . . . . . 7 (((,) Fn (ℝ* × ℝ*) ∧ 𝐹:ℕ⟶(ℝ* × ℝ*)) → ((,) ∘ 𝐹) Fn ℕ)
4841, 46, 47sylancr 587 . . . . . 6 (𝜑 → ((,) ∘ 𝐹) Fn ℕ)
49 fniunfv 7120 . . . . . 6 (((,) ∘ 𝐹) Fn ℕ → 𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) = ran ((,) ∘ 𝐹))
5048, 49syl 17 . . . . 5 (𝜑 𝑥 ∈ ℕ (((,) ∘ 𝐹)‘𝑥) = ran ((,) ∘ 𝐹))
51 iccf 13180 . . . . . . . 8 [,]:(ℝ* × ℝ*)⟶𝒫 ℝ*
52 ffn 6600 . . . . . . . 8 ([,]:(ℝ* × ℝ*)⟶𝒫 ℝ* → [,] Fn (ℝ* × ℝ*))
5351, 52ax-mp 5 . . . . . . 7 [,] Fn (ℝ* × ℝ*)
54 fnfco 6639 . . . . . . 7 (([,] Fn (ℝ* × ℝ*) ∧ 𝐹:ℕ⟶(ℝ* × ℝ*)) → ([,] ∘ 𝐹) Fn ℕ)
5553, 46, 54sylancr 587 . . . . . 6 (𝜑 → ([,] ∘ 𝐹) Fn ℕ)
56 fniunfv 7120 . . . . . 6 (([,] ∘ 𝐹) Fn ℕ → 𝑥 ∈ ℕ (([,] ∘ 𝐹)‘𝑥) = ran ([,] ∘ 𝐹))
5755, 56syl 17 . . . . 5 (𝜑 𝑥 ∈ ℕ (([,] ∘ 𝐹)‘𝑥) = ran ([,] ∘ 𝐹))
5838, 50, 573sstr3d 3967 . . . 4 (𝜑 ran ((,) ∘ 𝐹) ⊆ ran ([,] ∘ 𝐹))
59 ovolss 24649 . . . 4 (( ran ((,) ∘ 𝐹) ⊆ ran ([,] ∘ 𝐹) ∧ ran ([,] ∘ 𝐹) ⊆ ℝ) → (vol*‘ ran ((,) ∘ 𝐹)) ≤ (vol*‘ ran ([,] ∘ 𝐹)))
6058, 3, 59syl2anc 584 . . 3 (𝜑 → (vol*‘ ran ((,) ∘ 𝐹)) ≤ (vol*‘ ran ([,] ∘ 𝐹)))
6119, 60eqbrtrrd 5098 . 2 (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ (vol*‘ ran ([,] ∘ 𝐹)))
625, 14, 17, 61xrletrid 12889 1 (𝜑 → (vol*‘ ran ([,] ∘ 𝐹)) = sup(ran 𝑆, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1539  wcel 2106  wral 3064  cin 3886  wss 3887  𝒫 cpw 4533  cop 4567   cuni 4839   ciun 4924  Disj wdisj 5039   class class class wbr 5074   × cxp 5587  ran crn 5590  ccom 5593   Fn wfn 6428  wf 6429  cfv 6433  (class class class)co 7275  1st c1st 7829  2nd c2nd 7830  supcsup 9199  cr 10870  0cc0 10871  1c1 10872   + caddc 10874  +∞cpnf 11006  *cxr 11008   < clt 11009  cle 11010  cmin 11205  cn 11973  (,)cioo 13079  [,)cico 13081  [,]cicc 13082  seqcseq 13721  abscabs 14945  vol*covol 24626
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-rep 5209  ax-sep 5223  ax-nul 5230  ax-pow 5288  ax-pr 5352  ax-un 7588  ax-inf2 9399  ax-cnex 10927  ax-resscn 10928  ax-1cn 10929  ax-icn 10930  ax-addcl 10931  ax-addrcl 10932  ax-mulcl 10933  ax-mulrcl 10934  ax-mulcom 10935  ax-addass 10936  ax-mulass 10937  ax-distr 10938  ax-i2m1 10939  ax-1ne0 10940  ax-1rid 10941  ax-rnegex 10942  ax-rrecex 10943  ax-cnre 10944  ax-pre-lttri 10945  ax-pre-lttrn 10946  ax-pre-ltadd 10947  ax-pre-mulgt0 10948  ax-pre-sup 10949
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 845  df-3or 1087  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-nel 3050  df-ral 3069  df-rex 3070  df-rmo 3071  df-reu 3072  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-pss 3906  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-iun 4926  df-disj 5040  df-br 5075  df-opab 5137  df-mpt 5158  df-tr 5192  df-id 5489  df-eprel 5495  df-po 5503  df-so 5504  df-fr 5544  df-se 5545  df-we 5546  df-xp 5595  df-rel 5596  df-cnv 5597  df-co 5598  df-dm 5599  df-rn 5600  df-res 5601  df-ima 5602  df-pred 6202  df-ord 6269  df-on 6270  df-lim 6271  df-suc 6272  df-iota 6391  df-fun 6435  df-fn 6436  df-f 6437  df-f1 6438  df-fo 6439  df-f1o 6440  df-fv 6441  df-isom 6442  df-riota 7232  df-ov 7278  df-oprab 7279  df-mpo 7280  df-of 7533  df-om 7713  df-1st 7831  df-2nd 7832  df-frecs 8097  df-wrecs 8128  df-recs 8202  df-rdg 8241  df-1o 8297  df-2o 8298  df-er 8498  df-map 8617  df-pm 8618  df-en 8734  df-dom 8735  df-sdom 8736  df-fin 8737  df-fi 9170  df-sup 9201  df-inf 9202  df-oi 9269  df-dju 9659  df-card 9697  df-pnf 11011  df-mnf 11012  df-xr 11013  df-ltxr 11014  df-le 11015  df-sub 11207  df-neg 11208  df-div 11633  df-nn 11974  df-2 12036  df-3 12037  df-n0 12234  df-z 12320  df-uz 12583  df-q 12689  df-rp 12731  df-xneg 12848  df-xadd 12849  df-xmul 12850  df-ioo 13083  df-ico 13085  df-icc 13086  df-fz 13240  df-fzo 13383  df-fl 13512  df-seq 13722  df-exp 13783  df-hash 14045  df-cj 14810  df-re 14811  df-im 14812  df-sqrt 14946  df-abs 14947  df-clim 15197  df-rlim 15198  df-sum 15398  df-rest 17133  df-topgen 17154  df-psmet 20589  df-xmet 20590  df-met 20591  df-bl 20592  df-mopn 20593  df-top 22043  df-topon 22060  df-bases 22096  df-cmp 22538  df-ovol 24628  df-vol 24629
This theorem is referenced by:  mblfinlem2  35815
  Copyright terms: Public domain W3C validator