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

Theorem ovolval 25701
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 11215 . . 3 ℝ ∈ V
21elpw2 5299 . 2 (𝐴 ∈ 𝒫 ℝ ↔ 𝐴 ⊆ ℝ)
3 cleq1lem 15055 . . . . . . 7 (𝑥 = 𝐴 → ((𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ (𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
43rexbidv 3186 . . . . . 6 (𝑥 = 𝐴 → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) ↔ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
54rabbidv 3419 . . . . 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 2813 . . . 4 (𝑥 = 𝐴 → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} = 𝑀)
87infeq1d 9448 . . 3 (𝑥 = 𝐴 → inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ) = inf(𝑀, ℝ*, < ))
9 df-ovol 25692 . . 3 vol* = (𝑥 ∈ 𝒫 ℝ ↦ inf({𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝑥 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}, ℝ*, < ))
10 xrltso 13192 . . . 4 < Or ℝ*
1110infex 9465 . . 3 inf(𝑀, ℝ*, < ) ∈ V
128, 9, 11fvmpt 6986 . 2 (𝐴 ∈ 𝒫 ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
132, 12sylbir 238 1 (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wrex 3086  {crab 3412  cin 3898  wss 3899  𝒫 cpw 4557   cuni 4867   × cxp 5653  ran crn 5656  ccom 5659  cfv 6533  (class class class)co 7413  m cmap 8826  supcsup 9410  infcinf 9411  cr 11123  1c1 11125   + caddc 11127  *cxr 11266   < clt 11267  cle 11268  cmin 11465  cn 12257  (,)cioo 13398  seqcseq 14065  abscabs 15321  vol*covol 25690
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  ax-pow 5330  ax-pr 5398  ax-un 7736  ax-cnex 11180  ax-resscn 11181  ax-pre-lttri 11198  ax-pre-lttrn 11199
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-rmo 3365  df-rab 3413  df-v 3452  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5550  df-po 5563  df-so 5564  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-f1 6538  df-fo 6539  df-f1o 6540  df-fv 6541  df-er 8696  df-en 8953  df-dom 8954  df-sdom 8955  df-sup 9412  df-inf 9413  df-pnf 11269  df-mnf 11270  df-xr 11271  df-ltxr 11272  df-ovol 25692
This theorem is used by:  ovolcl  25706  ovollb  25707  ovolgelb  25708  ovolge0  25709  ovolsslem  25712  ovolshft  25739  ovolicc2  25750  ismblfin  38410  ovolval2  47472
  Copyright terms: Public domain W3C validator