| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > itg2monolem2 | Structured version Visualization version GIF version | ||
| Description: Lemma for itg2mono 25722. (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 13364 | . . . . . . . 8 ⊢ (0[,)+∞) ⊆ (0[,]+∞) | |
| 4 | fss 6686 | . . . . . . . 8 ⊢ (((𝐹‘𝑛):ℝ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ (0[,]+∞)) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) | |
| 5 | 2, 3, 4 | sylancl 587 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 6 | itg2cl 25701 | . . . . . . 7 ⊢ ((𝐹‘𝑛):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) | |
| 7 | 5, 6 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) |
| 8 | 7 | fmpttd 7069 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))):ℕ⟶ℝ*) |
| 9 | 8 | frnd 6678 | . . . 4 ⊢ (𝜑 → ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ*) |
| 10 | supxrcl 13242 | . . . 4 ⊢ (ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) | |
| 11 | 9, 10 | syl 17 | . . 3 ⊢ (𝜑 → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) |
| 12 | 1, 11 | eqeltrid 2841 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℝ*) |
| 13 | itg2monolem2.7 | . . 3 ⊢ (𝜑 → 𝑃 ∈ dom ∫1) | |
| 14 | itg1cl 25654 | . . 3 ⊢ (𝑃 ∈ dom ∫1 → (∫1‘𝑃) ∈ ℝ) | |
| 15 | 13, 14 | syl 17 | . 2 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ) |
| 16 | mnfxr 11201 | . . . 4 ⊢ -∞ ∈ ℝ* | |
| 17 | 16 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
| 18 | fveq2 6842 | . . . . . 6 ⊢ (𝑛 = 1 → (𝐹‘𝑛) = (𝐹‘1)) | |
| 19 | 18 | feq1d 6652 | . . . . 5 ⊢ (𝑛 = 1 → ((𝐹‘𝑛):ℝ⟶(0[,]+∞) ↔ (𝐹‘1):ℝ⟶(0[,]+∞))) |
| 20 | 5 | ralrimiva 3130 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
| 21 | 1nn 12168 | . . . . . 6 ⊢ 1 ∈ ℕ | |
| 22 | 21 | a1i 11 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℕ) |
| 23 | 19, 20, 22 | rspcdva 3579 | . . . 4 ⊢ (𝜑 → (𝐹‘1):ℝ⟶(0[,]+∞)) |
| 24 | itg2cl 25701 | . . . 4 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘1)) ∈ ℝ*) | |
| 25 | 23, 24 | syl 17 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ℝ*) |
| 26 | itg2ge0 25704 | . . . . 5 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → 0 ≤ (∫2‘(𝐹‘1))) | |
| 27 | 23, 26 | syl 17 | . . . 4 ⊢ (𝜑 → 0 ≤ (∫2‘(𝐹‘1))) |
| 28 | mnflt0 13051 | . . . . 5 ⊢ -∞ < 0 | |
| 29 | 0xr 11191 | . . . . . 6 ⊢ 0 ∈ ℝ* | |
| 30 | xrltletr 13083 | . . . . . 6 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ℝ*) → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) | |
| 31 | 16, 29, 25, 30 | mp3an12i 1468 | . . . . 5 ⊢ (𝜑 → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) |
| 32 | 28, 31 | mpani 697 | . . . 4 ⊢ (𝜑 → (0 ≤ (∫2‘(𝐹‘1)) → -∞ < (∫2‘(𝐹‘1)))) |
| 33 | 27, 32 | mpd 15 | . . 3 ⊢ (𝜑 → -∞ < (∫2‘(𝐹‘1))) |
| 34 | 2fveq3 6847 | . . . . . . . 8 ⊢ (𝑛 = 1 → (∫2‘(𝐹‘𝑛)) = (∫2‘(𝐹‘1))) | |
| 35 | eqid 2737 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) = (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) | |
| 36 | fvex 6855 | . . . . . . . 8 ⊢ (∫2‘(𝐹‘1)) ∈ V | |
| 37 | 34, 35, 36 | fvmpt 6949 | . . . . . . 7 ⊢ (1 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1))) |
| 38 | 21, 37 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1)) |
| 39 | 8 | ffnd 6671 | . . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ) |
| 40 | fnfvelrn 7034 | . . . . . . 7 ⊢ (((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ ∧ 1 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) | |
| 41 | 39, 21, 40 | sylancl 587 | . . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 42 | 38, 41 | eqeltrrid 2842 | . . . . 5 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
| 43 | supxrub 13251 | . . . . 5 ⊢ ((ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) | |
| 44 | 9, 42, 43 | syl2anc 585 | . . . 4 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) |
| 45 | 44, 1 | breqtrrdi 5142 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ 𝑆) |
| 46 | 17, 25, 12, 33, 45 | xrltletrd 13087 | . 2 ⊢ (𝜑 → -∞ < 𝑆) |
| 47 | 15 | rexrd 11194 | . . 3 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ*) |
| 48 | itg2monolem2.9 | . . . 4 ⊢ (𝜑 → ¬ (∫1‘𝑃) ≤ 𝑆) | |
| 49 | xrltnle 11211 | . . . . 5 ⊢ ((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ*) → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) | |
| 50 | 12, 47, 49 | syl2anc 585 | . . . 4 ⊢ (𝜑 → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) |
| 51 | 48, 50 | mpbird 257 | . . 3 ⊢ (𝜑 → 𝑆 < (∫1‘𝑃)) |
| 52 | 12, 47, 51 | xrltled 13076 | . 2 ⊢ (𝜑 → 𝑆 ≤ (∫1‘𝑃)) |
| 53 | xrre 13096 | . 2 ⊢ (((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ) ∧ (-∞ < 𝑆 ∧ 𝑆 ≤ (∫1‘𝑃))) → 𝑆 ∈ ℝ) | |
| 54 | 12, 15, 46, 52, 53 | syl22anc 839 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∃wrex 3062 ⊆ wss 3903 class class class wbr 5100 ↦ cmpt 5181 dom cdm 5632 ran crn 5633 Fn wfn 6495 ⟶wf 6496 ‘cfv 6500 (class class class)co 7368 ∘r cofr 7631 supcsup 9355 ℝcr 11037 0cc0 11038 1c1 11039 + caddc 11041 +∞cpnf 11175 -∞cmnf 11176 ℝ*cxr 11177 < clt 11178 ≤ cle 11179 ℕcn 12157 [,)cico 13275 [,]cicc 13276 MblFncmbf 25583 ∫1citg1 25584 ∫2citg2 25585 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-inf2 9562 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4905 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-se 5586 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-isom 6509 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-of 7632 df-ofr 7633 df-om 7819 df-1st 7943 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-1o 8407 df-2o 8408 df-er 8645 df-map 8777 df-pm 8778 df-en 8896 df-dom 8897 df-sdom 8898 df-fin 8899 df-sup 9357 df-inf 9358 df-oi 9427 df-dju 9825 df-card 9863 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-div 11807 df-nn 12158 df-2 12220 df-3 12221 df-n0 12414 df-z 12501 df-uz 12764 df-q 12874 df-rp 12918 df-xadd 13039 df-ioo 13277 df-ico 13279 df-icc 13280 df-fz 13436 df-fzo 13583 df-fl 13724 df-seq 13937 df-exp 13997 df-hash 14266 df-cj 15034 df-re 15035 df-im 15036 df-sqrt 15170 df-abs 15171 df-clim 15423 df-sum 15622 df-xmet 21314 df-met 21315 df-ovol 25433 df-vol 25434 df-mbf 25588 df-itg1 25589 df-itg2 25590 |
| This theorem is referenced by: itg2monolem3 25721 |
| Copyright terms: Public domain | W3C validator |