Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > itg2monolem2 | Structured version Visualization version GIF version |
Description: Lemma for itg2mono 24357. (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 12827 | . . . . . . . 8 ⊢ (0[,)+∞) ⊆ (0[,]+∞) | |
4 | fss 6530 | . . . . . . . 8 ⊢ (((𝐹‘𝑛):ℝ⟶(0[,)+∞) ∧ (0[,)+∞) ⊆ (0[,]+∞)) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) | |
5 | 2, 3, 4 | sylancl 588 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
6 | itg2cl 24336 | . . . . . . 7 ⊢ ((𝐹‘𝑛):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) | |
7 | 5, 6 | syl 17 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (∫2‘(𝐹‘𝑛)) ∈ ℝ*) |
8 | 7 | fmpttd 6882 | . . . . 5 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))):ℕ⟶ℝ*) |
9 | 8 | frnd 6524 | . . . 4 ⊢ (𝜑 → ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ*) |
10 | supxrcl 12711 | . . . 4 ⊢ (ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) | |
11 | 9, 10 | syl 17 | . . 3 ⊢ (𝜑 → sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < ) ∈ ℝ*) |
12 | 1, 11 | eqeltrid 2920 | . 2 ⊢ (𝜑 → 𝑆 ∈ ℝ*) |
13 | itg2monolem2.7 | . . 3 ⊢ (𝜑 → 𝑃 ∈ dom ∫1) | |
14 | itg1cl 24289 | . . 3 ⊢ (𝑃 ∈ dom ∫1 → (∫1‘𝑃) ∈ ℝ) | |
15 | 13, 14 | syl 17 | . 2 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ) |
16 | mnfxr 10701 | . . . 4 ⊢ -∞ ∈ ℝ* | |
17 | 16 | a1i 11 | . . 3 ⊢ (𝜑 → -∞ ∈ ℝ*) |
18 | fveq2 6673 | . . . . . 6 ⊢ (𝑛 = 1 → (𝐹‘𝑛) = (𝐹‘1)) | |
19 | 18 | feq1d 6502 | . . . . 5 ⊢ (𝑛 = 1 → ((𝐹‘𝑛):ℝ⟶(0[,]+∞) ↔ (𝐹‘1):ℝ⟶(0[,]+∞))) |
20 | 5 | ralrimiva 3185 | . . . . 5 ⊢ (𝜑 → ∀𝑛 ∈ ℕ (𝐹‘𝑛):ℝ⟶(0[,]+∞)) |
21 | 1nn 11652 | . . . . . 6 ⊢ 1 ∈ ℕ | |
22 | 21 | a1i 11 | . . . . 5 ⊢ (𝜑 → 1 ∈ ℕ) |
23 | 19, 20, 22 | rspcdva 3628 | . . . 4 ⊢ (𝜑 → (𝐹‘1):ℝ⟶(0[,]+∞)) |
24 | itg2cl 24336 | . . . 4 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → (∫2‘(𝐹‘1)) ∈ ℝ*) | |
25 | 23, 24 | syl 17 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ℝ*) |
26 | itg2ge0 24339 | . . . . 5 ⊢ ((𝐹‘1):ℝ⟶(0[,]+∞) → 0 ≤ (∫2‘(𝐹‘1))) | |
27 | 23, 26 | syl 17 | . . . 4 ⊢ (𝜑 → 0 ≤ (∫2‘(𝐹‘1))) |
28 | mnflt0 12523 | . . . . 5 ⊢ -∞ < 0 | |
29 | 0xr 10691 | . . . . . 6 ⊢ 0 ∈ ℝ* | |
30 | xrltletr 12553 | . . . . . 6 ⊢ ((-∞ ∈ ℝ* ∧ 0 ∈ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ℝ*) → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) | |
31 | 16, 29, 25, 30 | mp3an12i 1461 | . . . . 5 ⊢ (𝜑 → ((-∞ < 0 ∧ 0 ≤ (∫2‘(𝐹‘1))) → -∞ < (∫2‘(𝐹‘1)))) |
32 | 28, 31 | mpani 694 | . . . 4 ⊢ (𝜑 → (0 ≤ (∫2‘(𝐹‘1)) → -∞ < (∫2‘(𝐹‘1)))) |
33 | 27, 32 | mpd 15 | . . 3 ⊢ (𝜑 → -∞ < (∫2‘(𝐹‘1))) |
34 | 2fveq3 6678 | . . . . . . . 8 ⊢ (𝑛 = 1 → (∫2‘(𝐹‘𝑛)) = (∫2‘(𝐹‘1))) | |
35 | eqid 2824 | . . . . . . . 8 ⊢ (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) = (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) | |
36 | fvex 6686 | . . . . . . . 8 ⊢ (∫2‘(𝐹‘1)) ∈ V | |
37 | 34, 35, 36 | fvmpt 6771 | . . . . . . 7 ⊢ (1 ∈ ℕ → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1))) |
38 | 21, 37 | ax-mp 5 | . . . . . 6 ⊢ ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) = (∫2‘(𝐹‘1)) |
39 | 8 | ffnd 6518 | . . . . . . 7 ⊢ (𝜑 → (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ) |
40 | fnfvelrn 6851 | . . . . . . 7 ⊢ (((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) Fn ℕ ∧ 1 ∈ ℕ) → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) | |
41 | 39, 21, 40 | sylancl 588 | . . . . . 6 ⊢ (𝜑 → ((𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))‘1) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
42 | 38, 41 | eqeltrrid 2921 | . . . . 5 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) |
43 | supxrub 12720 | . . . . 5 ⊢ ((ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))) ⊆ ℝ* ∧ (∫2‘(𝐹‘1)) ∈ ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛)))) → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) | |
44 | 9, 42, 43 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ sup(ran (𝑛 ∈ ℕ ↦ (∫2‘(𝐹‘𝑛))), ℝ*, < )) |
45 | 44, 1 | breqtrrdi 5111 | . . 3 ⊢ (𝜑 → (∫2‘(𝐹‘1)) ≤ 𝑆) |
46 | 17, 25, 12, 33, 45 | xrltletrd 12557 | . 2 ⊢ (𝜑 → -∞ < 𝑆) |
47 | 15 | rexrd 10694 | . . 3 ⊢ (𝜑 → (∫1‘𝑃) ∈ ℝ*) |
48 | itg2monolem2.9 | . . . 4 ⊢ (𝜑 → ¬ (∫1‘𝑃) ≤ 𝑆) | |
49 | xrltnle 10711 | . . . . 5 ⊢ ((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ*) → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) | |
50 | 12, 47, 49 | syl2anc 586 | . . . 4 ⊢ (𝜑 → (𝑆 < (∫1‘𝑃) ↔ ¬ (∫1‘𝑃) ≤ 𝑆)) |
51 | 48, 50 | mpbird 259 | . . 3 ⊢ (𝜑 → 𝑆 < (∫1‘𝑃)) |
52 | 12, 47, 51 | xrltled 12546 | . 2 ⊢ (𝜑 → 𝑆 ≤ (∫1‘𝑃)) |
53 | xrre 12565 | . 2 ⊢ (((𝑆 ∈ ℝ* ∧ (∫1‘𝑃) ∈ ℝ) ∧ (-∞ < 𝑆 ∧ 𝑆 ≤ (∫1‘𝑃))) → 𝑆 ∈ ℝ) | |
54 | 12, 15, 46, 52, 53 | syl22anc 836 | 1 ⊢ (𝜑 → 𝑆 ∈ ℝ) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∀wral 3141 ∃wrex 3142 ⊆ wss 3939 class class class wbr 5069 ↦ cmpt 5149 dom cdm 5558 ran crn 5559 Fn wfn 6353 ⟶wf 6354 ‘cfv 6358 (class class class)co 7159 ∘r cofr 7411 supcsup 8907 ℝcr 10539 0cc0 10540 1c1 10541 + caddc 10543 +∞cpnf 10675 -∞cmnf 10676 ℝ*cxr 10677 < clt 10678 ≤ cle 10679 ℕcn 11641 [,)cico 12743 [,]cicc 12744 MblFncmbf 24218 ∫1citg1 24219 ∫2citg2 24220 |
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-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 ax-inf2 9107 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-fal 1549 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-int 4880 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-se 5518 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-isom 6367 df-riota 7117 df-ov 7162 df-oprab 7163 df-mpo 7164 df-of 7412 df-ofr 7413 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-2o 8106 df-oadd 8109 df-er 8292 df-map 8411 df-pm 8412 df-en 8513 df-dom 8514 df-sdom 8515 df-fin 8516 df-sup 8909 df-inf 8910 df-oi 8977 df-dju 9333 df-card 9371 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-q 12352 df-rp 12393 df-xadd 12511 df-ioo 12745 df-ico 12747 df-icc 12748 df-fz 12896 df-fzo 13037 df-fl 13165 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14461 df-re 14462 df-im 14463 df-sqrt 14597 df-abs 14598 df-clim 14848 df-sum 15046 df-xmet 20541 df-met 20542 df-ovol 24068 df-vol 24069 df-mbf 24223 df-itg1 24224 df-itg2 24225 |
This theorem is referenced by: itg2monolem3 24356 |
Copyright terms: Public domain | W3C validator |