| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg2monolem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg2mono 26104. (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 13594 | . . . . . . . 8 ⊢ (0[,)+∞) ⊆ (0[,]+∞) | |
| 4 | fss 6748 | . . . . . . . 8 ⊢ (((𝐹‘𝑛):ℝ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ (0[,]+∞)) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) | |
| 5 | 2, 3, 4 | sylancl 598 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 6 | itg2cl 26083 | . . . . . . 7 ⊢ ((𝐹‘𝑛):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) | |
| 7 | 5, 6 | syl 18 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) |
| 8 | 7 | fmpttd 7139 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))):ℕ⟶ℝ*) |
| 9 | 8 | frnd 6740 | . . . 4 ⊢ (𝜑 → ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ*) |
| 10 | supxrcl 13472 | . . . 4 ⊢ (ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 18 | . . 3 ⊢ (𝜑 → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) |
| 12 | 1, 11 | eqeltrid 2868 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℝ*) |
| 13 | itg2monolem2.7 | . . 3 ⊢ (𝜑 → 𝑃 ∈ dom ∫1) | |
| 14 | itg1cl 26036 | . . 3 ⊢ (𝑃 ∈ dom ∫1 → (∫1‘𝑃) ∈ ℝ) | |
| 15 | 13, 14 | syl 18 | . 2 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ) |
| 16 | mnfxr 11393 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 17 | 16 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 18 | fveq2 6908 | . . . . . 6 ⊢ (𝑛 = 1 → (𝐹‘𝑛) = (𝐹‘1)) | |
| 19 | 18 | feq1d 6713 | . . . . 5 ⊢ (𝑛 = 1 → ((𝐹‘𝑛):ℝ⟶(0[,]+∞) ↔ (𝐹‘1):ℝ⟶(0[,]+∞))) |
| 20 | 5 | ralrimiva 3158 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 21 | 1nn 12373 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℕ) |
| 23 | 19, 20, 22 | rspcdva 3581 | . . . 4 ⊢ (𝜑 → (𝐹‘1):ℝ⟶(0[,]+∞)) |
| 24 | itg2cl 26083 | . . . 4 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘1)) ∈ ℝ*) | |
| 25 | 23, 24 | syl 18 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ℝ*) |
| 26 | itg2ge0 26086 | . . . . 5 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → 0 ≤ (∫2‘(𝐹‘1))) | |
| 27 | 23, 26 | syl 18 | . . . 4 ⊢ (𝜑 → 0 ≤ (∫2‘(𝐹‘1))) |
| 28 | mnflt0 13281 | . . . . 5 ⊢ -∞ < 0 | |
| 29 | 0xr 11383 | . . . . . 6 ⊢ 0 ∈ ℝ* | |
| 30 | xrltletr 13313 | . . . . . 6 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ℝ*) → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) | |
| 31 | 16, 29, 25, 30 | mp3an12i 1495 | . . . . 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 6913 | . . . . . . . 8 ⊢ (𝑛 = 1 → (∫2‘(𝐹‘𝑛)) = (∫2‘(𝐹‘1))) | |
| 35 | eqid 2763 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) = (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) | |
| 36 | fvex 6921 | . . . . . . . 8 ⊢ (∫2‘(𝐹‘1)) ∈ V | |
| 37 | 34, 35, 36 | fvmpt 7016 | . . . . . . 7 ⊢ (1 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1))) |
| 38 | 21, 37 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1)) |
| 39 | 8 | ffnd 6732 | . . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ) |
| 40 | fnfvelrn 7104 | . . . . . . 7 ⊢ (((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ ∧ 1 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) | |
| 41 | 39, 21, 40 | sylancl 598 | . . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 42 | 38, 41 | eqeltrrid 2869 | . . . . 5 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 43 | supxrub 13481 | . . . . 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 5150 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ 𝑆) |
| 46 | 17, 25, 12, 33, 45 | xrltletrd 13317 | . 2 ⊢ (𝜑 → -∞ < 𝑆) |
| 47 | 15 | rexrd 11386 | . . 3 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ*) |
| 48 | itg2monolem2.9 | . . . 4 ⊢ (𝜑 → ¬ (∫1‘𝑃) ≤ 𝑆) | |
| 49 | xrltnle 11403 | . . . . 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 13306 | . 2 ⊢ (𝜑 → 𝑆 ≤ (∫1‘𝑃)) |
| 53 | xrre 13326 | . 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 2147 ∀wral 3080 ∃wrex 3090 ⊆ wss 3900 class class class wbr 5106 ↦ cmpt 5189 dom cdm 5655 ran crn 5656 Fn wfn 6553 ⟶wf 6554 ‘cfv 6558 (class class class)co 7443 ∘r cofr 7716 supcsup 9459 ℝcr 11226 0cc0 11227 1c1 11228 + caddc 11230 +∞cpnf 11367 -∞cmnf 11368 ℝ*cxr 11369 < clt 11370 ≤ cle 11371 ℕcn 12362 [,)cico 13505 [,]cicc 13506 MblFncmbf 25965 ∫1citg1 25966 ∫2citg2 25967 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-inf2 9669 ax-cnex 11283 ax-resscn 11284 ax-1cn 11285 ax-icn 11286 ax-addcl 11287 ax-addrcl 11288 ax-mulcl 11289 ax-mulrcl 11290 ax-mulcom 11291 ax-addass 11292 ax-mulass 11293 ax-distr 11294 ax-i2m1 11295 ax-1ne0 11296 ax-1rid 11297 ax-rnegex 11298 ax-rrecex 11299 ax-cnre 11300 ax-pre-lttri 11301 ax-pre-lttrn 11302 ax-pre-ltadd 11303 ax-pre-mulgt0 11304 ax-pre-sup 11305 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-br 5107 df-opab 5171 df-mpt 5190 df-tr 5216 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-se 5609 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 6322 df-ord 6383 df-on 6384 df-lim 6385 df-suc 6386 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-isom 6567 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-of 7717 df-ofr 7718 df-om 7902 df-1st 8025 df-2nd 8026 df-frecs 8327 df-wrecs 8358 df-recs 8407 df-rdg 8446 df-1o 8504 df-2o 8505 df-er 8745 df-map 8877 df-pm 8878 df-en 9002 df-dom 9003 df-sdom 9004 df-fin 9005 df-sup 9461 df-inf 9462 df-oi 9531 df-dju 10009 df-card 10047 df-pnf 11372 df-mnf 11373 df-xr 11374 df-ltxr 11375 df-le 11376 df-sub 11570 df-neg 11571 df-div 12001 df-nn 12363 df-2 12432 df-3 12433 df-n0 12634 df-z 12721 df-uz 12993 df-q 13103 df-rp 13148 df-xadd 13269 df-ioo 13507 df-ico 13509 df-icc 13510 df-fz 13667 df-fzo 13816 df-fl 13959 df-seq 14172 df-exp 14232 df-hash 14502 df-cj 15295 df-re 15296 df-im 15297 df-sqrt 15431 df-abs 15432 df-clim 15684 df-sum 15883 df-xmet 21701 df-met 21702 df-ovol 25815 df-vol 25816 df-mbf 25970 df-itg1 25971 df-itg2 25972 |
| This theorem is used by: itg2monolem3 26103 |
| Copyright terms: Public domain | W3C validator |