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

Theorem ovolval 25426
Description: The value of the outer measure. (Contributed by Mario Carneiro, 16-Mar-2014.) (Revised by AV, 17-Sep-2020.)
Hypothesis
Ref Expression
ovolval.1 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
Assertion
Ref Expression
ovolval (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
Distinct variable group:   𝐴,𝑓,𝑦
Allowed substitution hints:   𝑀(𝑦,𝑓)

Proof of Theorem ovolval
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 reex 11220 . . 3 ℝ ∈ V
21elpw2 5304 . 2 (𝐴 ∈ 𝒫 ℝ ↔ 𝐴 ⊆ ℝ)
3 cleq1lem 15001 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
43rexbidv 3164 . . . . . 6 (𝑥 = 𝐴 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
54rabbidv 3423 . . . . 5 (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))})
6 ovolval.1 . . . . 5 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
75, 6eqtr4di 2788 . . . 4 (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = 𝑀)
87infeq1d 9490 . . 3 (𝑥 = 𝐴 → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) = inf(𝑀, ℝ*, < ))
9 df-ovol 25417 . . 3 vol* = (𝑥 ∈ 𝒫 ℝ ↦ inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ))
10 xrltso 13157 . . . 4 < Or ℝ*
1110infex 9507 . . 3 inf(𝑀, ℝ*, < ) ∈ V
128, 9, 11fvmpt 6986 . 2 (𝐴 ∈ 𝒫 ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
132, 12sylbir 235 1 (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  wrex 3060  {crab 3415  cin 3925  wss 3926  𝒫 cpw 4575   cuni 4883   × cxp 5652  ran crn 5655  ccom 5658  cfv 6531  (class class class)co 7405  m cmap 8840  supcsup 9452  infcinf 9453  cr 11128  1c1 11130   + caddc 11132  *cxr 11268   < clt 11269  cle 11270  cmin 11466  cn 12240  (,)cioo 13362  seqcseq 14019  abscabs 15253  vol*covol 25415
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729  ax-cnex 11185  ax-resscn 11186  ax-pre-lttri 11203  ax-pre-lttrn 11204
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3061  df-rmo 3359  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-po 5561  df-so 5562  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-er 8719  df-en 8960  df-dom 8961  df-sdom 8962  df-sup 9454  df-inf 9455  df-pnf 11271  df-mnf 11272  df-xr 11273  df-ltxr 11274  df-ovol 25417
This theorem is referenced by:  ovolcl  25431  ovollb  25432  ovolgelb  25433  ovolge0  25434  ovolsslem  25437  ovolshft  25464  ovolicc2  25475  ismblfin  37685  ovolval2  46673
  Copyright terms: Public domain W3C validator