| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ioombl1lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for ioombl1 25890. (Contributed by Mario Carneiro, 18-Aug-2014.) |
| Ref | Expression |
|---|---|
| ioombl1.b | ⊢ 𝐵 = (𝐴(,)+∞) |
| ioombl1.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) |
| ioombl1.e | ⊢ (𝜑 → 𝐸 ⊆ ℝ) |
| ioombl1.v | ⊢ (𝜑 → (vol*‘𝐸) ∈ ℝ) |
| ioombl1.c | ⊢ (𝜑 → 𝐶 ∈ ℝ+) |
| ioombl1.s | ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) |
| ioombl1.t | ⊢ 𝑇 = seq1( + , ((abs ∘ − ) ∘ 𝐺)) |
| ioombl1.u | ⊢ 𝑈 = seq1( + , ((abs ∘ − ) ∘ 𝐻)) |
| ioombl1.f1 | ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) |
| ioombl1.f2 | ⊢ (𝜑 → 𝐸 ⊆ ∪ ran ((,) ∘ 𝐹)) |
| ioombl1.f3 | ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶)) |
| ioombl1.p | ⊢ 𝑃 = (1st ‘(𝐹‘𝑛)) |
| ioombl1.q | ⊢ 𝑄 = (2nd ‘(𝐹‘𝑛)) |
| ioombl1.g | ⊢ 𝐺 = (𝑛 ∈ ℕ ↦ 〈if(if(𝑃 ≤ 𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃 ≤ 𝐴, 𝐴, 𝑃), 𝑄), 𝑄〉) |
| ioombl1.h | ⊢ 𝐻 = (𝑛 ∈ ℕ ↦ 〈𝑃, if(if(𝑃 ≤ 𝐴, 𝐴, 𝑃) ≤ 𝑄, if(𝑃 ≤ 𝐴, 𝐴, 𝑃), 𝑄)〉) |
| Ref | Expression |
|---|---|
| ioombl1lem2 | ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ioombl1.f1 | . . . . . 6 ⊢ (𝜑 → 𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ))) | |
| 2 | eqid 2760 | . . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹) | |
| 3 | ioombl1.s | . . . . . . 7 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
| 4 | 2, 3 | ovolsf 25800 | . . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞)) |
| 6 | 5 | frnd 6721 | . . . 4 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞)) |
| 7 | icossxr 13568 | . . . 4 ⊢ (0[,)+∞) ⊆ ℝ* | |
| 8 | 6, 7 | sstrdi 3921 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*) |
| 9 | supxrcl 13450 | . . 3 ⊢ (ran 𝑆 ⊆ ℝ* → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) | |
| 10 | 8, 9 | syl 18 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) |
| 11 | ioombl1.v | . . 3 ⊢ (𝜑 → (vol*‘𝐸) ∈ ℝ) | |
| 12 | ioombl1.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 13 | 12 | rpred 13169 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 14 | 11, 13 | readdcld 11343 | . 2 ⊢ (𝜑 → ((vol*‘𝐸) + 𝐶) ∈ ℝ) |
| 15 | mnfxr 11371 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 17 | 5 | ffnd 6713 | . . . . 5 ⊢ (𝜑 → 𝑆 Fn ℕ) |
| 18 | 1nn 12351 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 19 | fnfvelrn 7083 | . . . . 5 ⊢ ((𝑆 Fn ℕ ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ ran 𝑆) | |
| 20 | 17, 18, 19 | sylancl 598 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ran 𝑆) |
| 21 | 8, 20 | sseldd 3910 | . . 3 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ*) |
| 22 | rge0ssre 13592 | . . . . 5 ⊢ (0[,)+∞) ⊆ ℝ | |
| 23 | ffvelcdm 7084 | . . . . . 6 ⊢ ((𝑆:ℕ⟶(0[,)+∞) ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ (0[,)+∞)) | |
| 24 | 5, 18, 23 | sylancl 598 | . . . . 5 ⊢ (𝜑 → (𝑆‘1) ∈ (0[,)+∞)) |
| 25 | 22, 24 | sselid 3907 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ) |
| 26 | 25 | mnfltd 13258 | . . 3 ⊢ (𝜑 → -∞ < (𝑆‘1)) |
| 27 | supxrub 13459 | . . . 4 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ (𝑆‘1) ∈ ran 𝑆) → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) | |
| 28 | 8, 20, 27 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) |
| 29 | 16, 21, 10, 26, 28 | xrltletrd 13295 | . 2 ⊢ (𝜑 → -∞ < sup(ran 𝑆, ℝ*, < )) |
| 30 | ioombl1.f3 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶)) | |
| 31 | xrre 13304 | . 2 ⊢ (((sup(ran 𝑆, ℝ*, < ) ∈ ℝ* ∧ ((vol*‘𝐸) + 𝐶) ∈ ℝ) ∧ (-∞ < sup(ran 𝑆, ℝ*, < ) ∧ sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶))) → sup(ran 𝑆, ℝ*, < ) ∈ ℝ) | |
| 32 | 10, 14, 29, 30, 31 | syl22anc 852 | 1 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1569 ∈ wcel 2144 ⊆ wss 3896 ∩ cin 4088 ifcif 4481 〈cop 4834 ∪ cuni 4866 class class class wbr 5102 ↦ cmpt 5185 × cxp 5648 ran crn 5651 ∘ ccom 5654 Fn wfn 6536 ⟶wf 6537 ‘cfv 6541 (class class class)co 7422 1st c1st 8001 2nd c2nd 8002 supcsup 9437 ℝcr 11204 0cc0 11205 1c1 11206 + caddc 11208 +∞cpnf 11345 -∞cmnf 11346 ℝ*cxr 11347 < clt 11348 ≤ cle 11349 − cmin 11546 ℕcn 12340 ℝ+crp 13125 (,)cioo 13481 [,)cico 13483 seqcseq 14149 abscabs 15408 vol*covol 25790 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7753 ax-cnex 11261 ax-resscn 11262 ax-1cn 11263 ax-icn 11264 ax-addcl 11265 ax-addrcl 11266 ax-mulcl 11267 ax-mulrcl 11268 ax-mulcom 11269 ax-addass 11270 ax-mulass 11271 ax-distr 11272 ax-i2m1 11273 ax-1ne0 11274 ax-1rid 11275 ax-rnegex 11276 ax-rrecex 11277 ax-cnre 11278 ax-pre-lttri 11279 ax-pre-lttrn 11280 ax-pre-ltadd 11281 ax-pre-mulgt0 11282 ax-pre-sup 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6543 df-fn 6544 df-f 6545 df-f1 6546 df-fo 6547 df-f1o 6548 df-fv 6549 df-riota 7379 df-ov 7425 df-oprab 7426 df-mpo 7427 df-om 7880 df-1st 8003 df-2nd 8004 df-frecs 8304 df-wrecs 8335 df-recs 8384 df-rdg 8423 df-er 8722 df-en 8979 df-dom 8980 df-sdom 8981 df-sup 9439 df-pnf 11350 df-mnf 11351 df-xr 11352 df-ltxr 11353 df-le 11354 df-sub 11548 df-neg 11549 df-div 11979 df-nn 12341 df-2 12410 df-3 12411 df-n0 12612 df-z 12699 df-uz 12971 df-rp 13126 df-ico 13487 df-fz 13645 df-seq 14150 df-exp 14210 df-cj 15273 df-re 15274 df-im 15275 df-sqrt 15409 df-abs 15410 |
| This theorem is used by: ioombl1lem4 25889 |
| Copyright terms: Public domain | W3C validator |