| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvfsumrlim3 | Structured version Visualization version GIF version | ||
| Description: Conjoin the statements of dvfsumrlim 26357 and dvfsumrlim2 26358. (This is useful as a target for lemmas, because the hypotheses to this theorem are complex, and we don't want to repeat ourselves.) (Contributed by Mario Carneiro, 18-May-2016.) |
| Ref | Expression |
|---|---|
| dvfsum.s | ⊢ 𝑆 = (𝑇(,)+∞) |
| dvfsum.z | ⊢ 𝑍 = (ℤ≥‘𝑀) |
| dvfsum.m | ⊢ (𝜑 → 𝑀 ∈ ℤ) |
| dvfsum.d | ⊢ (𝜑 → 𝐷 ∈ ℝ) |
| dvfsum.md | ⊢ (𝜑 → 𝑀 ≤ (𝐷 + 1)) |
| dvfsum.t | ⊢ (𝜑 → 𝑇 ∈ ℝ) |
| dvfsum.a | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) |
| dvfsum.b1 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐵 ∈ 𝑉) |
| dvfsum.b2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝐵 ∈ ℝ) |
| dvfsum.b3 | ⊢ (𝜑 → (ℝ D (𝑥 ∈ 𝑆 ↦ 𝐴)) = (𝑥 ∈ 𝑆 ↦ 𝐵)) |
| dvfsum.c | ⊢ (𝑥 = 𝑘 → 𝐵 = 𝐶) |
| dvfsumrlim.l | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) ∧ (𝐷 ≤ 𝑥 ∧ 𝑥 ≤ 𝑘)) → 𝐶 ≤ 𝐵) |
| dvfsumrlim.g | ⊢ 𝐺 = (𝑥 ∈ 𝑆 ↦ (Σ𝑘 ∈ (𝑀...(⌊‘𝑥))𝐶 − 𝐴)) |
| dvfsumrlim.k | ⊢ (𝜑 → (𝑥 ∈ 𝑆 ↦ 𝐵) ⇝𝑟 0) |
| dvfsumrlim3.1 | ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐸) |
| Ref | Expression |
|---|---|
| dvfsumrlim3 | ⊢ (𝜑 → (𝐺:𝑆⟶ℝ ∧ 𝐺 ∈ dom ⇝𝑟 ∧ ((𝐺 ⇝𝑟 𝐿 ∧ 𝑋 ∈ 𝑆 ∧ 𝐷 ≤ 𝑋) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dvfsum.s | . . 3 ⊢ 𝑆 = (𝑇(,)+∞) | |
| 2 | dvfsum.z | . . 3 ⊢ 𝑍 = (ℤ≥‘𝑀) | |
| 3 | dvfsum.m | . . 3 ⊢ (𝜑 → 𝑀 ∈ ℤ) | |
| 4 | dvfsum.d | . . 3 ⊢ (𝜑 → 𝐷 ∈ ℝ) | |
| 5 | dvfsum.md | . . 3 ⊢ (𝜑 → 𝑀 ≤ (𝐷 + 1)) | |
| 6 | dvfsum.t | . . 3 ⊢ (𝜑 → 𝑇 ∈ ℝ) | |
| 7 | dvfsum.a | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) | |
| 8 | dvfsum.b1 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑆) → 𝐵 ∈ 𝑉) | |
| 9 | dvfsum.b2 | . . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝑍) → 𝐵 ∈ ℝ) | |
| 10 | dvfsum.b3 | . . 3 ⊢ (𝜑 → (ℝ D (𝑥 ∈ 𝑆 ↦ 𝐴)) = (𝑥 ∈ 𝑆 ↦ 𝐵)) | |
| 11 | dvfsum.c | . . 3 ⊢ (𝑥 = 𝑘 → 𝐵 = 𝐶) | |
| 12 | dvfsumrlim.g | . . 3 ⊢ 𝐺 = (𝑥 ∈ 𝑆 ↦ (Σ𝑘 ∈ (𝑀...(⌊‘𝑥))𝐶 − 𝐴)) | |
| 13 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12 | dvfsumrlimf 26351 | . 2 ⊢ (𝜑 → 𝐺:𝑆⟶ℝ) |
| 14 | dvfsumrlim.l | . . 3 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) ∧ (𝐷 ≤ 𝑥 ∧ 𝑥 ≤ 𝑘)) → 𝐶 ≤ 𝐵) | |
| 15 | dvfsumrlim.k | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝑆 ↦ 𝐵) ⇝𝑟 0) | |
| 16 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 14, 12, 15 | dvfsumrlim 26357 | . 2 ⊢ (𝜑 → 𝐺 ∈ dom ⇝𝑟 ) |
| 17 | 3 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝑀 ∈ ℤ) |
| 18 | 4 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝐷 ∈ ℝ) |
| 19 | 5 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝑀 ≤ (𝐷 + 1)) |
| 20 | 6 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝑇 ∈ ℝ) |
| 21 | 7 | adantlr 728 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐴 ∈ ℝ) |
| 22 | 8 | adantlr 728 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑆) → 𝐵 ∈ 𝑉) |
| 23 | 9 | adantlr 728 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝑥 ∈ 𝑍) → 𝐵 ∈ ℝ) |
| 24 | 10 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → (ℝ D (𝑥 ∈ 𝑆 ↦ 𝐴)) = (𝑥 ∈ 𝑆 ↦ 𝐵)) |
| 25 | 14 | 3adant1r 1196 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ (𝑥 ∈ 𝑆 ∧ 𝑘 ∈ 𝑆) ∧ (𝐷 ≤ 𝑥 ∧ 𝑥 ≤ 𝑘)) → 𝐶 ≤ 𝐵) |
| 26 | 15 | adantr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → (𝑥 ∈ 𝑆 ↦ 𝐵) ⇝𝑟 0) |
| 27 | simprr 785 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝑋 ∈ 𝑆) | |
| 28 | simprl 783 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) → 𝐷 ≤ 𝑋) | |
| 29 | 1, 2, 17, 18, 19, 20, 21, 22, 23, 24, 11, 25, 12, 26, 27, 28 | dvfsumrlim2 26358 | . . . . . 6 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ ⦋𝑋 / 𝑥⦌𝐵) |
| 30 | 27 | adantr 486 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → 𝑋 ∈ 𝑆) |
| 31 | nfcvd 2923 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑆 → Ⅎ𝑥𝐸) | |
| 32 | dvfsumrlim3.1 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐸) | |
| 33 | 31, 32 | csbiegf 3879 | . . . . . . 7 ⊢ (𝑋 ∈ 𝑆 → ⦋𝑋 / 𝑥⦌𝐵 = 𝐸) |
| 34 | 30, 33 | syl 18 | . . . . . 6 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → ⦋𝑋 / 𝑥⦌𝐵 = 𝐸) |
| 35 | 29, 34 | breqtrd 5130 | . . . . 5 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸) |
| 36 | 35 | exp42 441 | . . . 4 ⊢ (𝜑 → (𝐷 ≤ 𝑋 → (𝑋 ∈ 𝑆 → (𝐺 ⇝𝑟 𝐿 → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸)))) |
| 37 | 36 | com24 96 | . . 3 ⊢ (𝜑 → (𝐺 ⇝𝑟 𝐿 → (𝑋 ∈ 𝑆 → (𝐷 ≤ 𝑋 → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸)))) |
| 38 | 37 | 3impd 1367 | . 2 ⊢ (𝜑 → ((𝐺 ⇝𝑟 𝐿 ∧ 𝑋 ∈ 𝑆 ∧ 𝐷 ≤ 𝑋) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸)) |
| 39 | 13, 16, 38 | 3jca 1146 | 1 ⊢ (𝜑 → (𝐺:𝑆⟶ℝ ∧ 𝐺 ∈ dom ⇝𝑟 ∧ ((𝐺 ⇝𝑟 𝐿 ∧ 𝑋 ∈ 𝑆 ∧ 𝐷 ≤ 𝑋) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ 𝐸))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ⦋csb 3846 class class class wbr 5102 ↦ cmpt 5185 dom cdm 5650 ⟶wf 6535 ‘cfv 6539 (class class class)co 7421 ℝcr 11203 0cc0 11204 1c1 11205 + caddc 11207 +∞cpnf 11344 ≤ cle 11348 − cmin 11545 ℤcz 12697 ℤ≥cuz 12969 (,)cioo 13480 ...cfz 13643 ⌊cfl 13934 abscabs 15407 ⇝𝑟 crli 15658 Σcsu 15859 D cdv 26189 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-inf2 9646 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 ax-pre-sup 11282 ax-addf 11283 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-iin 4953 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-se 5604 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-isom 6548 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-of 7694 df-om 7879 df-1st 8002 df-2nd 8003 df-supp 8181 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-1o 8480 df-2o 8481 df-er 8721 df-map 8853 df-pm 8854 df-ixp 8930 df-en 8978 df-dom 8979 df-sdom 8980 df-fin 8981 df-fsupp 9358 df-fi 9407 df-sup 9438 df-inf 9439 df-oi 9508 df-card 10024 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-div 11978 df-nn 12340 df-2 12409 df-3 12410 df-4 12411 df-5 12412 df-6 12413 df-7 12414 df-8 12415 df-9 12416 df-n0 12611 df-z 12698 df-dec 12819 df-uz 12970 df-q 13080 df-rp 13125 df-xneg 13245 df-xadd 13246 df-xmul 13247 df-ioo 13484 df-ico 13486 df-icc 13487 df-fz 13644 df-fzo 13793 df-fl 13936 df-seq 14149 df-exp 14209 df-hash 14479 df-cj 15272 df-re 15273 df-im 15274 df-sqrt 15408 df-abs 15409 df-limsup 15644 df-clim 15661 df-rlim 15662 df-sum 15860 df-struct 17331 df-sets 17348 df-slot 17366 df-ndx 17378 df-base 17394 df-ress 17415 df-plusg 17447 df-mulr 17448 df-starv 17449 df-sca 17450 df-vsca 17451 df-ip 17452 df-tset 17453 df-ple 17454 df-ds 17456 df-unif 17457 df-hom 17458 df-cco 17459 df-rest 17599 df-topn 17600 df-0g 17618 df-gsum 17619 df-topgen 17620 df-pt 17621 df-prds 17624 df-xrs 17680 df-qtop 17685 df-imas 17686 df-xps 17688 df-mre 17762 df-mrc 17763 df-acs 17765 df-mgm 18822 df-sgrp 18914 df-mnd 18930 df-submnd 18985 df-mulg 19284 df-cntz 19537 df-cmn 20002 df-psmet 21676 df-xmet 21677 df-met 21678 df-bl 21679 df-mopn 21680 df-fbas 21681 df-fg 21682 df-cnfld 21685 df-top 23218 df-topon 23235 df-topsp 23257 df-bases 23270 df-cld 23343 df-ntr 23344 df-cls 23345 df-nei 23422 df-lp 23460 df-perf 23461 df-cn 23551 df-cnp 23552 df-haus 23639 df-cmp 23711 df-tx 23887 df-hmeo 24080 df-fil 24171 df-fm 24263 df-flim 24264 df-flf 24265 df-xms 24645 df-ms 24646 df-tms 24647 df-cncf 25205 df-limc 26192 df-dv 26193 |
| This theorem is used by: divsqrtsumlem 27313 logdivsum 27866 |
| Copyright terms: Public domain | W3C validator |