Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ioombl1lem2 | Structured version Visualization version GIF version |
Description: Lemma for ioombl1 24166. (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 2824 | . . . . . . 7 ⊢ ((abs ∘ − ) ∘ 𝐹) = ((abs ∘ − ) ∘ 𝐹) | |
3 | ioombl1.s | . . . . . . 7 ⊢ 𝑆 = seq1( + , ((abs ∘ − ) ∘ 𝐹)) | |
4 | 2, 3 | ovolsf 24076 | . . . . . 6 ⊢ (𝐹:ℕ⟶( ≤ ∩ (ℝ × ℝ)) → 𝑆:ℕ⟶(0[,)+∞)) |
5 | 1, 4 | syl 17 | . . . . 5 ⊢ (𝜑 → 𝑆:ℕ⟶(0[,)+∞)) |
6 | 5 | frnd 6524 | . . . 4 ⊢ (𝜑 → ran 𝑆 ⊆ (0[,)+∞)) |
7 | icossxr 12824 | . . . 4 ⊢ (0[,)+∞) ⊆ ℝ* | |
8 | 6, 7 | sstrdi 3982 | . . 3 ⊢ (𝜑 → ran 𝑆 ⊆ ℝ*) |
9 | supxrcl 12711 | . . 3 ⊢ (ran 𝑆 ⊆ ℝ* → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) | |
10 | 8, 9 | syl 17 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ*) |
11 | ioombl1.v | . . 3 ⊢ (𝜑 → (vol*‘𝐸) ∈ ℝ) | |
12 | ioombl1.c | . . . 4 ⊢ (𝜑 → 𝐶 ∈ ℝ+) | |
13 | 12 | rpred 12434 | . . 3 ⊢ (𝜑 → 𝐶 ∈ ℝ) |
14 | 11, 13 | readdcld 10673 | . 2 ⊢ (𝜑 → ((vol*‘𝐸) + 𝐶) ∈ ℝ) |
15 | mnfxr 10701 | . . . 4 ⊢ -∞ ∈ ℝ* | |
16 | 15 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
17 | 5 | ffnd 6518 | . . . . 5 ⊢ (𝜑 → 𝑆 Fn ℕ) |
18 | 1nn 11652 | . . . . 5 ⊢ 1 ∈ ℕ | |
19 | fnfvelrn 6851 | . . . . 5 ⊢ ((𝑆 Fn ℕ ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ ran 𝑆) | |
20 | 17, 18, 19 | sylancl 588 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ran 𝑆) |
21 | 8, 20 | sseldd 3971 | . . 3 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ*) |
22 | rge0ssre 12847 | . . . . 5 ⊢ (0[,)+∞) ⊆ ℝ | |
23 | ffvelrn 6852 | . . . . . 6 ⊢ ((𝑆:ℕ⟶(0[,)+∞) ∧ 1 ∈ ℕ) → (𝑆‘1) ∈ (0[,)+∞)) | |
24 | 5, 18, 23 | sylancl 588 | . . . . 5 ⊢ (𝜑 → (𝑆‘1) ∈ (0[,)+∞)) |
25 | 22, 24 | sseldi 3968 | . . . 4 ⊢ (𝜑 → (𝑆‘1) ∈ ℝ) |
26 | 25 | mnfltd 12522 | . . 3 ⊢ (𝜑 → -∞ < (𝑆‘1)) |
27 | supxrub 12720 | . . . 4 ⊢ ((ran 𝑆 ⊆ ℝ* ∧ (𝑆‘1) ∈ ran 𝑆) → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) | |
28 | 8, 20, 27 | syl2anc 586 | . . 3 ⊢ (𝜑 → (𝑆‘1) ≤ sup(ran 𝑆, ℝ*, < )) |
29 | 16, 21, 10, 26, 28 | xrltletrd 12557 | . 2 ⊢ (𝜑 → -∞ < sup(ran 𝑆, ℝ*, < )) |
30 | ioombl1.f3 | . 2 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶)) | |
31 | xrre 12565 | . 2 ⊢ (((sup(ran 𝑆, ℝ*, < ) ∈ ℝ* ∧ ((vol*‘𝐸) + 𝐶) ∈ ℝ) ∧ (-∞ < sup(ran 𝑆, ℝ*, < ) ∧ sup(ran 𝑆, ℝ*, < ) ≤ ((vol*‘𝐸) + 𝐶))) → sup(ran 𝑆, ℝ*, < ) ∈ ℝ) | |
32 | 10, 14, 29, 30, 31 | syl22anc 836 | 1 ⊢ (𝜑 → sup(ran 𝑆, ℝ*, < ) ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1536 ∈ wcel 2113 ∩ cin 3938 ⊆ wss 3939 ifcif 4470 〈cop 4576 ∪ cuni 4841 class class class wbr 5069 ↦ cmpt 5149 × cxp 5556 ran crn 5559 ∘ ccom 5562 Fn wfn 6353 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 1st c1st 7690 2nd c2nd 7691 supcsup 8907 ℝcr 10539 0cc0 10540 1c1 10541 + caddc 10543 +∞cpnf 10675 -∞cmnf 10676 ℝ*cxr 10677 < clt 10678 ≤ cle 10679 − cmin 10873 ℕcn 11641 ℝ+crp 12392 (,)cioo 12741 [,)cico 12743 seqcseq 13372 abscabs 14596 vol*covol 24066 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-cnex 10596 ax-resscn 10597 ax-1cn 10598 ax-icn 10599 ax-addcl 10600 ax-addrcl 10601 ax-mulcl 10602 ax-mulrcl 10603 ax-mulcom 10604 ax-addass 10605 ax-mulass 10606 ax-distr 10607 ax-i2m1 10608 ax-1ne0 10609 ax-1rid 10610 ax-rnegex 10611 ax-rrecex 10612 ax-cnre 10613 ax-pre-lttri 10614 ax-pre-lttrn 10615 ax-pre-ltadd 10616 ax-pre-mulgt0 10617 ax-pre-sup 10618 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-nel 3127 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-er 8292 df-en 8513 df-dom 8514 df-sdom 8515 df-sup 8909 df-pnf 10680 df-mnf 10681 df-xr 10682 df-ltxr 10683 df-le 10684 df-sub 10875 df-neg 10876 df-div 11301 df-nn 11642 df-2 11703 df-3 11704 df-n0 11901 df-z 11985 df-uz 12247 df-rp 12393 df-ico 12747 df-fz 12896 df-seq 13373 df-exp 13433 df-cj 14461 df-re 14462 df-im 14463 df-sqrt 14597 df-abs 14598 |
This theorem is referenced by: ioombl1lem4 24165 |
Copyright terms: Public domain | W3C validator |