| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg2monolem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg2mono 26054. (Contributed by Mario Carneiro, 16-Aug-2014.) |
| Ref | Expression |
|---|---|
| itg2mono.1 | ⊢ 𝐺 = (𝑥 ∈ ℝ ↦ sup(ran (𝑛 ∈ ℕ ↦ ((𝐹‘𝑛)‘𝑥)), ℝ, < )) |
| itg2mono.2 | ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∈ MblFn) |
| itg2mono.3 | ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,)+∞)) |
| itg2mono.4 | ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛) ∘r ≤ (𝐹‘(𝑛 + 1))) |
| itg2mono.5 | ⊢ ((𝜑 ∧ 𝑥 ∈ ℝ) → ∃𝑦 ∈ ℝ ∀𝑛 ∈ ℕ ((𝐹‘𝑛)‘𝑥) ≤ 𝑦) |
| itg2mono.6 | ⊢ 𝑆 = sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) |
| itg2monolem2.7 | ⊢ (𝜑 → 𝑃 ∈ dom ∫1) |
| itg2monolem2.8 | ⊢ (𝜑 → 𝑃 ∘r ≤ 𝐺) |
| itg2monolem2.9 | ⊢ (𝜑 → ¬ (∫1‘𝑃) ≤ 𝑆) |
| Ref | Expression |
|---|---|
| itg2monolem2 | ⊢ (𝜑 → 𝑆 ∈ ℝ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | itg2mono.6 | . . 3 ⊢ 𝑆 = sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) | |
| 2 | itg2mono.3 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,)+∞)) | |
| 3 | icossicc 13548 | . . . . . . . 8 ⊢ (0[,)+∞) ⊆ (0[,]+∞) | |
| 4 | fss 6718 | . . . . . . . 8 ⊢ (((𝐹‘𝑛):ℝ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ (0[,]+∞)) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) | |
| 5 | 2, 3, 4 | sylancl 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 6 | itg2cl 26033 | . . . . . . 7 ⊢ ((𝐹‘𝑛):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) | |
| 7 | 5, 6 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) |
| 8 | 7 | fmpttd 7107 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))):ℕ⟶ℝ*) |
| 9 | 8 | frnd 6710 | . . . 4 ⊢ (𝜑 → ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ*) |
| 10 | supxrcl 13426 | . . . 4 ⊢ (ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 18 | . . 3 ⊢ (𝜑 → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) |
| 12 | 1, 11 | eqeltrid 2865 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℝ*) |
| 13 | itg2monolem2.7 | . . 3 ⊢ (𝜑 → 𝑃 ∈ dom ∫1) | |
| 14 | itg1cl 25986 | . . 3 ⊢ (𝑃 ∈ dom ∫1 → (∫1‘𝑃) ∈ ℝ) | |
| 15 | 13, 14 | syl 18 | . 2 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ) |
| 16 | mnfxr 11347 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 17 | 16 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 18 | fveq2 6877 | . . . . . 6 ⊢ (𝑛 = 1 → (𝐹‘𝑛) = (𝐹‘1)) | |
| 19 | 18 | feq1d 6683 | . . . . 5 ⊢ (𝑛 = 1 → ((𝐹‘𝑛):ℝ⟶(0[,]+∞) ↔ (𝐹‘1):ℝ⟶(0[,]+∞))) |
| 20 | 5 | ralrimiva 3155 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 21 | 1nn 12327 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℕ) |
| 23 | 19, 20, 22 | rspcdva 3578 | . . . 4 ⊢ (𝜑 → (𝐹‘1):ℝ⟶(0[,]+∞)) |
| 24 | itg2cl 26033 | . . . 4 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘1)) ∈ ℝ*) | |
| 25 | 23, 24 | syl 18 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ℝ*) |
| 26 | itg2ge0 26036 | . . . . 5 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → 0 ≤ (∫2‘(𝐹‘1))) | |
| 27 | 23, 26 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ≤ (∫2‘(𝐹‘1))) |
| 28 | mnflt0 13235 | . . . . 5 ⊢ -∞ < 0 | |
| 29 | 0xr 11337 | . . . . . 6 ⊢ 0 ∈ ℝ* | |
| 30 | xrltletr 13267 | . . . . . 6 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ℝ*) → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) | |
| 31 | 16, 29, 25, 30 | mp3an12i 1494 | . . . . 5 ⊢ (𝜑 → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) |
| 32 | 28, 31 | mpani 709 | . . . 4 ⊢ (𝜑 → (0 ≤ (∫2‘(𝐹‘1)) → -∞ < (∫2‘(𝐹‘1)))) |
| 33 | 27, 32 | mpd 16 | . . 3 ⊢ (𝜑 → -∞ < (∫2‘(𝐹‘1))) |
| 34 | 2fveq3 6882 | . . . . . . . 8 ⊢ (𝑛 = 1 → (∫2‘(𝐹‘𝑛)) = (∫2‘(𝐹‘1))) | |
| 35 | eqid 2761 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) = (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) | |
| 36 | fvex 6890 | . . . . . . . 8 ⊢ (∫2‘(𝐹‘1)) ∈ V | |
| 37 | 34, 35, 36 | fvmpt 6985 | . . . . . . 7 ⊢ (1 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1))) |
| 38 | 21, 37 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1)) |
| 39 | 8 | ffnd 6702 | . . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ) |
| 40 | fnfvelrn 7072 | . . . . . . 7 ⊢ (((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ ∧ 1 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) | |
| 41 | 39, 21, 40 | sylancl 598 | . . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 42 | 38, 41 | eqeltrrid 2866 | . . . . 5 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 43 | supxrub 13435 | . . . . 5 ⊢ ((ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) | |
| 44 | 9, 42, 43 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) |
| 45 | 44, 1 | breqtrrdi 5147 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ 𝑆) |
| 46 | 17, 25, 12, 33, 45 | xrltletrd 13271 | . 2 ⊢ (𝜑 → -∞ < 𝑆) |
| 47 | 15 | rexrd 11340 | . . 3 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ*) |
| 48 | itg2monolem2.9 | . . . 4 ⊢ (𝜑 → ¬ (∫1‘𝑃) ≤ 𝑆) | |
| 49 | xrltnle 11357 | . . . . 5 ⊢ ((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ*) → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) | |
| 50 | 12, 47, 49 | syl2anc 596 | . . . 4 ⊢ (𝜑 → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) |
| 51 | 48, 50 | mpbird 260 | . . 3 ⊢ (𝜑 → 𝑆 < (∫1‘𝑃)) |
| 52 | 12, 47, 51 | xrltled 13260 | . 2 ⊢ (𝜑 → 𝑆 ≤ (∫1‘𝑃)) |
| 53 | xrre 13280 | . 2 ⊢ (((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ) ∧ (-∞ < 𝑆 ∧ 𝑆 ≤ (∫1‘𝑃))) → 𝑆 ∈ ℝ) | |
| 54 | 12, 15, 46, 52, 53 | syl22anc 852 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∀wral 3077 ∃wrex 3087 ⊆ wss 3899 class class class wbr 5103 ↦ cmpt 5186 dom cdm 5651 ran crn 5652 Fn wfn 6526 ⟶wf 6527 ‘cfv 6531 (class class class)co 7412 ∘r cofr 7681 supcsup 9416 ℝcr 11180 0cc0 11181 1c1 11182 + caddc 11184 +∞cpnf 11321 -∞cmnf 11322 ℝ*cxr 11323 < clt 11324 ≤ cle 11325 ℕcn 12316 [,)cico 13459 [,]cicc 13460 MblFncmbf 25915 ∫1citg1 25916 ∫2citg2 25917 |
| 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 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 ax-inf2 9626 ax-cnex 11237 ax-resscn 11238 ax-1cn 11239 ax-icn 11240 ax-addcl 11241 ax-addrcl 11242 ax-mulcl 11243 ax-mulrcl 11244 ax-mulcom 11245 ax-addass 11246 ax-mulass 11247 ax-distr 11248 ax-i2m1 11249 ax-1ne0 11250 ax-1rid 11251 ax-rnegex 11252 ax-rrecex 11253 ax-cnre 11254 ax-pre-lttri 11255 ax-pre-lttrn 11256 ax-pre-ltadd 11257 ax-pre-mulgt0 11258 ax-pre-sup 11259 |
| 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 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 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-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-se 5605 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6297 df-ord 6358 df-on 6359 df-lim 6360 df-suc 6361 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-isom 6540 df-riota 7369 df-ov 7415 df-oprab 7416 df-mpo 7417 df-of 7682 df-ofr 7683 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8283 df-wrecs 8314 df-recs 8363 df-rdg 8402 df-1o 8460 df-2o 8461 df-er 8701 df-map 8833 df-pm 8834 df-en 8958 df-dom 8959 df-sdom 8960 df-fin 8961 df-sup 9418 df-inf 9419 df-oi 9488 df-dju 9963 df-card 10001 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11524 df-neg 11525 df-div 11955 df-nn 12317 df-2 12386 df-3 12387 df-n0 12588 df-z 12675 df-uz 12947 df-q 13057 df-rp 13102 df-xadd 13223 df-ioo 13461 df-ico 13463 df-icc 13464 df-fz 13621 df-fzo 13769 df-fl 13912 df-seq 14125 df-exp 14185 df-hash 14455 df-cj 15246 df-re 15247 df-im 15248 df-sqrt 15382 df-abs 15383 df-clim 15635 df-sum 15834 df-xmet 21651 df-met 21652 df-ovol 25765 df-vol 25766 df-mbf 25920 df-itg1 25921 df-itg2 25922 |
| This theorem is used by: itg2monolem3 26053 |
| Copyright terms: Public domain | W3C validator |