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

Theorem ovolsslem 24992
Description: Lemma for ovolss 24993. (Contributed by Mario Carneiro, 16-Mar-2014.) (Proof shortened by AV, 17-Sep-2020.)
Hypotheses
Ref Expression
ovolss.1 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
ovolss.2 𝑁 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
Assertion
Ref Expression
ovolsslem ((𝐴𝐵𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ (vol*‘𝐵))
Distinct variable groups:   𝑦,𝑓,𝐴   𝐵,𝑓,𝑦
Allowed substitution hints:   𝑀(𝑦,𝑓)   𝑁(𝑦,𝑓)

Proof of Theorem ovolsslem
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 sstr2 3988 . . . . . . . . 9 (𝐴𝐵 → (𝐵 ran ((,) ∘ 𝑓) → 𝐴 ran ((,) ∘ 𝑓)))
21ad2antrr 724 . . . . . . . 8 (((𝐴𝐵𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → (𝐵 ran ((,) ∘ 𝑓) → 𝐴 ran ((,) ∘ 𝑓)))
32anim1d 611 . . . . . . 7 (((𝐴𝐵𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → ((𝐵 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → (𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
43reximdv 3170 . . . . . 6 (((𝐴𝐵𝐵 ⊆ ℝ) ∧ 𝑦 ∈ ℝ*) → (∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < )) → ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))))
54ss2rabdv 4072 . . . . 5 ((𝐴𝐵𝐵 ⊆ ℝ) → {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))} ⊆ {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))})
6 ovolss.2 . . . . 5 𝑁 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐵 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
7 ovolss.1 . . . . 5 𝑀 = {𝑦 ∈ ℝ* ∣ ∃𝑓 ∈ (( ≤ ∩ (ℝ × ℝ)) ↑m ℕ)(𝐴 ran ((,) ∘ 𝑓) ∧ 𝑦 = sup(ran seq1( + , ((abs ∘ − ) ∘ 𝑓)), ℝ*, < ))}
85, 6, 73sstr4g 4026 . . . 4 ((𝐴𝐵𝐵 ⊆ ℝ) → 𝑁𝑀)
9 sstr 3989 . . . . 5 ((𝐴𝐵𝐵 ⊆ ℝ) → 𝐴 ⊆ ℝ)
107ovolval 24981 . . . . . . . 8 (𝐴 ⊆ ℝ → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
1110adantr 481 . . . . . . 7 ((𝐴 ⊆ ℝ ∧ 𝑥𝑀) → (vol*‘𝐴) = inf(𝑀, ℝ*, < ))
127ssrab3 4079 . . . . . . . . 9 𝑀 ⊆ ℝ*
13 infxrlb 13309 . . . . . . . . 9 ((𝑀 ⊆ ℝ*𝑥𝑀) → inf(𝑀, ℝ*, < ) ≤ 𝑥)
1412, 13mpan 688 . . . . . . . 8 (𝑥𝑀 → inf(𝑀, ℝ*, < ) ≤ 𝑥)
1514adantl 482 . . . . . . 7 ((𝐴 ⊆ ℝ ∧ 𝑥𝑀) → inf(𝑀, ℝ*, < ) ≤ 𝑥)
1611, 15eqbrtrd 5169 . . . . . 6 ((𝐴 ⊆ ℝ ∧ 𝑥𝑀) → (vol*‘𝐴) ≤ 𝑥)
1716ralrimiva 3146 . . . . 5 (𝐴 ⊆ ℝ → ∀𝑥𝑀 (vol*‘𝐴) ≤ 𝑥)
189, 17syl 17 . . . 4 ((𝐴𝐵𝐵 ⊆ ℝ) → ∀𝑥𝑀 (vol*‘𝐴) ≤ 𝑥)
19 ssralv 4049 . . . 4 (𝑁𝑀 → (∀𝑥𝑀 (vol*‘𝐴) ≤ 𝑥 → ∀𝑥𝑁 (vol*‘𝐴) ≤ 𝑥))
208, 18, 19sylc 65 . . 3 ((𝐴𝐵𝐵 ⊆ ℝ) → ∀𝑥𝑁 (vol*‘𝐴) ≤ 𝑥)
216ssrab3 4079 . . . 4 𝑁 ⊆ ℝ*
22 ovolcl 24986 . . . . 5 (𝐴 ⊆ ℝ → (vol*‘𝐴) ∈ ℝ*)
239, 22syl 17 . . . 4 ((𝐴𝐵𝐵 ⊆ ℝ) → (vol*‘𝐴) ∈ ℝ*)
24 infxrgelb 13310 . . . 4 ((𝑁 ⊆ ℝ* ∧ (vol*‘𝐴) ∈ ℝ*) → ((vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ) ↔ ∀𝑥𝑁 (vol*‘𝐴) ≤ 𝑥))
2521, 23, 24sylancr 587 . . 3 ((𝐴𝐵𝐵 ⊆ ℝ) → ((vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ) ↔ ∀𝑥𝑁 (vol*‘𝐴) ≤ 𝑥))
2620, 25mpbird 256 . 2 ((𝐴𝐵𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ inf(𝑁, ℝ*, < ))
276ovolval 24981 . . 3 (𝐵 ⊆ ℝ → (vol*‘𝐵) = inf(𝑁, ℝ*, < ))
2827adantl 482 . 2 ((𝐴𝐵𝐵 ⊆ ℝ) → (vol*‘𝐵) = inf(𝑁, ℝ*, < ))
2926, 28breqtrrd 5175 1 ((𝐴𝐵𝐵 ⊆ ℝ) → (vol*‘𝐴) ≤ (vol*‘𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 396   = wceq 1541  wcel 2106  wral 3061  wrex 3070  {crab 3432  cin 3946  wss 3947   cuni 4907   class class class wbr 5147   × cxp 5673  ran crn 5676  ccom 5679  cfv 6540  (class class class)co 7405  m cmap 8816  supcsup 9431  infcinf 9432  cr 11105  1c1 11107   + caddc 11109  *cxr 11243   < clt 11244  cle 11245  cmin 11440  cn 12208  (,)cioo 13320  seqcseq 13962  abscabs 15177  vol*covol 24970
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  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 2703  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721  ax-cnex 11162  ax-resscn 11163  ax-1cn 11164  ax-icn 11165  ax-addcl 11166  ax-addrcl 11167  ax-mulcl 11168  ax-mulrcl 11169  ax-mulcom 11170  ax-addass 11171  ax-mulass 11172  ax-distr 11173  ax-i2m1 11174  ax-1ne0 11175  ax-1rid 11176  ax-rnegex 11177  ax-rrecex 11178  ax-cnre 11179  ax-pre-lttri 11180  ax-pre-lttrn 11181  ax-pre-ltadd 11182  ax-pre-mulgt0 11183  ax-pre-sup 11184
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-po 5587  df-so 5588  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7361  df-ov 7408  df-oprab 7409  df-mpo 7410  df-er 8699  df-en 8936  df-dom 8937  df-sdom 8938  df-sup 9433  df-inf 9434  df-pnf 11246  df-mnf 11247  df-xr 11248  df-ltxr 11249  df-le 11250  df-sub 11442  df-neg 11443  df-ovol 24972
This theorem is referenced by:  ovolss  24993
  Copyright terms: Public domain W3C validator