| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ioombl1lem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for ioombl1 25790. (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 25700 | . . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞)) |
| 5 | 1, 4 | syl 18 | . . . . 5 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞)) |
| 6 | 5 | frnd 6711 | . . . 4 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞)) |
| 7 | icossxr 13485 | . . . 4 ⊢ (0[,)+∞) ⊆ ℝ* | |
| 8 | 6, 7 | sstrdi 3943 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*) |
| 9 | supxrcl 13367 | . . 3 ⊢ (ran 𝑆 ⊆ ℝ* → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) | |
| 10 | 8, 9 | syl 18 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) |
| 11 | ioombl1.v | . . 3 ⊢ (𝜑 → (vol*‘𝐸) ∈ ℝ) | |
| 12 | ioombl1.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
| 13 | 12 | rpred 13086 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
| 14 | 11, 13 | readdcld 11262 | . 2 ⊢ (𝜑 → ((vol*‘𝐸) + 𝐶) ∈ ℝ) |
| 15 | mnfxr 11290 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 17 | 5 | ffnd 6703 | . . . . 5 ⊢ (𝜑 → 𝑆 Fn ℕ) |
| 18 | 1nn 12268 | . . . . 5 ⊢ 1 ∈ ℕ | |
| 19 | fnfvelrn 7073 | . . . . 5 ⊢ ((𝑆 Fn ℕ ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ ran 𝑆) | |
| 20 | 17, 18, 19 | sylancl 598 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ran 𝑆) |
| 21 | 8, 20 | sseldd 3932 | . . 3 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ*) |
| 22 | rge0ssre 13509 | . . . . 5 ⊢ (0[,)+∞) ⊆ ℝ | |
| 23 | ffvelcdm 7074 | . . . . . 6 ⊢ ((𝑆:ℕ⟶(0[,)+∞) ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ (0[,)+∞)) | |
| 24 | 5, 18, 23 | sylancl 598 | . . . . 5 ⊢ (𝜑 → (𝑆‘1) ∈ (0[,)+∞)) |
| 25 | 22, 24 | sselid 3929 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ) |
| 26 | 25 | mnfltd 13175 | . . 3 ⊢ (𝜑 → -∞ < (𝑆‘1)) |
| 27 | supxrub 13376 | . . . 4 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ (𝑆‘1) ∈ ran 𝑆) → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) | |
| 28 | 8, 20, 27 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) |
| 29 | 16, 21, 10, 26, 28 | xrltletrd 13212 | . 2 ⊢ (𝜑 → -∞ < sup(ran 𝑆, ℝ*, < )) |
| 30 | ioombl1.f3 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶)) | |
| 31 | xrre 13221 | . 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 2145 ∩ cin 3898 ⊆ wss 3899 ifcif 4482 〈cop 4590 ∪ cuni 4867 class class class wbr 5103 ↦ cmpt 5186 × cxp 5653 ran crn 5656 ∘ ccom 5659 Fn wfn 6528 ⟶wf 6529 ‘cfv 6533 (class class class)co 7413 1st c1st 7984 2nd c2nd 7985 supcsup 9410 ℝcr 11123 0cc0 11124 1c1 11125 + caddc 11127 +∞cpnf 11264 -∞cmnf 11265 ℝ*cxr 11266 < clt 11267 ≤ cle 11268 − cmin 11465 ℕcn 12257 ℝ+crp 13042 (,)cioo 13398 [,)cico 13400 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-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 ax-pre-sup 11202 |
| 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-reu 3366 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-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 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-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 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-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-sup 9412 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-div 11896 df-nn 12258 df-2 12327 df-3 12328 df-n0 12529 df-z 12616 df-uz 12888 df-rp 13043 df-ico 13404 df-fz 13562 df-seq 14066 df-exp 14126 df-cj 15186 df-re 15187 df-im 15188 df-sqrt 15322 df-abs 15323 |
| This theorem is used by: ioombl1lem4 25789 |
| Copyright terms: Public domain | W3C validator |