| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ioombl1lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for ioombl1 25752. (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 2765 | . . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹) | |
| 3 | ioombl1.s | . . . . . . 7 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
| 4 | 2, 3 | ovolsf 25662 | . . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞)) |
| 6 | 5 | frnd 6718 | . . . 4 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞)) |
| 7 | icossxr 13471 | . . . 4 ⊢ (0[,)+∞) ⊆ ℝ* | |
| 8 | 6, 7 | sstrdi 3950 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*) |
| 9 | supxrcl 13353 | . . 3 ⊢ (ran 𝑆 ⊆ ℝ* → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) | |
| 10 | 8, 9 | syl 18 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) |
| 11 | ioombl1.v | . . 3 ⊢ (𝜑 → (vol*‘𝐸) ∈ ℝ) | |
| 12 | ioombl1.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 13 | 12 | rpred 13072 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 14 | 11, 13 | readdcld 11249 | . 2 ⊢ (𝜑 → ((vol*‘𝐸) + 𝐶) ∈ ℝ) |
| 15 | mnfxr 11277 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 17 | 5 | ffnd 6710 | . . . . 5 ⊢ (𝜑 → 𝑆 Fn ℕ) |
| 18 | 1nn 12255 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 19 | fnfvelrn 7079 | . . . . 5 ⊢ ((𝑆 Fn ℕ ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ ran 𝑆) | |
| 20 | 17, 18, 19 | sylancl 598 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ran 𝑆) |
| 21 | 8, 20 | sseldd 3939 | . . 3 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ*) |
| 22 | rge0ssre 13495 | . . . . 5 ⊢ (0[,)+∞) ⊆ ℝ | |
| 23 | ffvelcdm 7080 | . . . . . 6 ⊢ ((𝑆:ℕ⟶(0[,)+∞) ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ (0[,)+∞)) | |
| 24 | 5, 18, 23 | sylancl 598 | . . . . 5 ⊢ (𝜑 → (𝑆‘1) ∈ (0[,)+∞)) |
| 25 | 22, 24 | sselid 3936 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ) |
| 26 | 25 | mnfltd 13161 | . . 3 ⊢ (𝜑 → -∞ < (𝑆‘1)) |
| 27 | supxrub 13362 | . . . 4 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ (𝑆‘1) ∈ ran 𝑆) → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) | |
| 28 | 8, 20, 27 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) |
| 29 | 16, 21, 10, 26, 28 | xrltletrd 13198 | . 2 ⊢ (𝜑 → -∞ < sup(ran 𝑆, ℝ*, < )) |
| 30 | ioombl1.f3 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶)) | |
| 31 | xrre 13207 | . 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 1570 ∈ wcel 2146 ∩ cin 3905 ⊆ wss 3906 ifcif 4489 〈cop 4597 ∪ cuni 4874 class class class wbr 5111 ↦ cmpt 5194 × cxp 5661 ran crn 5664 ∘ ccom 5667 Fn wfn 6535 ⟶wf 6536 ‘cfv 6540 (class class class)co 7416 1st c1st 7986 2nd c2nd 7987 supcsup 9403 ℝcr 11110 0cc0 11111 1c1 11112 + caddc 11114 +∞cpnf 11251 -∞cmnf 11252 ℝ*cxr 11253 < clt 11254 ≤ cle 11255 − cmin 11452 ℕcn 12244 ℝ+crp 13028 (,)cioo 13384 [,)cico 13386 seqcseq 14051 abscabs 15305 vol*covol 25652 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-nul 5271 ax-pow 5338 ax-pr 5406 ax-un 7738 ax-cnex 11167 ax-resscn 11168 ax-1cn 11169 ax-icn 11170 ax-addcl 11171 ax-addrcl 11172 ax-mulcl 11173 ax-mulrcl 11174 ax-mulcom 11175 ax-addass 11176 ax-mulass 11177 ax-distr 11178 ax-i2m1 11179 ax-1ne0 11180 ax-1rid 11181 ax-rnegex 11182 ax-rrecex 11183 ax-cnre 11184 ax-pre-lttri 11185 ax-pre-lttrn 11186 ax-pre-ltadd 11187 ax-pre-mulgt0 11188 ax-pre-sup 11189 |
| 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 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ne 2961 df-nel 3067 df-ral 3082 df-rex 3092 df-rmo 3371 df-reu 3372 df-rab 3419 df-v 3459 df-sbc 3747 df-csb 3855 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-pss 3926 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-eprel 5563 df-po 5571 df-so 5572 df-fr 5616 df-we 5618 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-pred 6306 df-ord 6367 df-on 6368 df-lim 6369 df-suc 6370 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-riota 7373 df-ov 7419 df-oprab 7420 df-mpo 7421 df-om 7865 df-1st 7988 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8946 df-dom 8947 df-sdom 8948 df-sup 9405 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11454 df-neg 11455 df-div 11883 df-nn 12245 df-2 12314 df-3 12315 df-n0 12516 df-z 12603 df-uz 12875 df-rp 13029 df-ico 13390 df-fz 13548 df-seq 14052 df-exp 14112 df-cj 15170 df-re 15171 df-im 15172 df-sqrt 15306 df-abs 15307 |
| This theorem is used by: ioombl1lem4 25751 |
| Copyright terms: Public domain | W3C validator |