| 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 26384 and dvfsumrlim2 26385. (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 26378 | . 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 26384 | . 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 26385 | . . . . . 6 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → (abs‘((𝐺‘𝑋) − 𝐿)) ≤ ⦋𝑋 / 𝑥⦌𝐵) |
| 30 | 27 | adantr 486 | . . . . . . 7 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → 𝑋 ∈ 𝑆) |
| 31 | nfcvd 2927 | . . . . . . . 8 ⊢ (𝑋 ∈ 𝑆 → Ⅎ𝑥𝐸) | |
| 32 | dvfsumrlim3.1 | . . . . . . . 8 ⊢ (𝑥 = 𝑋 → 𝐵 = 𝐸) | |
| 33 | 31, 32 | csbiegf 3884 | . . . . . . 7 ⊢ (𝑋 ∈ 𝑆 → ⦋𝑋 / 𝑥⦌𝐵 = 𝐸) |
| 34 | 30, 33 | syl 18 | . . . . . 6 ⊢ (((𝜑 ∧ (𝐷 ≤ 𝑋 ∧ 𝑋 ∈ 𝑆)) ∧ 𝐺 ⇝𝑟 𝐿) → ⦋𝑋 / 𝑥⦌𝐵 = 𝐸) |
| 35 | 29, 34 | breqtrd 5135 | . . . . 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 1570 ∈ wcel 2147 ⦋csb 3851 class class class wbr 5106 ↦ cmpt 5190 dom cdm 5656 ⟶wf 6557 ‘cfv 6561 (class class class)co 7446 ℝcr 11229 0cc0 11230 1c1 11231 + caddc 11233 +∞cpnf 11370 ≤ cle 11374 − cmin 11571 ℤcz 12723 ℤ≥cuz 12995 (,)cioo 13506 ...cfz 13669 ⌊cfl 13960 abscabs 15433 ⇝𝑟 crli 15684 Σcsu 15885 D cdv 26216 |
| 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 5236 ax-sep 5253 ax-nul 5264 ax-pow 5332 ax-pr 5396 ax-un 7778 ax-inf2 9672 ax-cnex 11286 ax-resscn 11287 ax-1cn 11288 ax-icn 11289 ax-addcl 11290 ax-addrcl 11291 ax-mulcl 11292 ax-mulrcl 11293 ax-mulcom 11294 ax-addass 11295 ax-mulass 11296 ax-distr 11297 ax-i2m1 11298 ax-1ne0 11299 ax-1rid 11300 ax-rnegex 11301 ax-rrecex 11302 ax-cnre 11303 ax-pre-lttri 11304 ax-pre-lttrn 11305 ax-pre-ltadd 11306 ax-pre-mulgt0 11307 ax-pre-sup 11308 ax-addf 11309 |
| 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-tp 4593 df-op 4839 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5551 df-eprel 5556 df-po 5564 df-so 5565 df-fr 5609 df-se 5610 df-we 5611 df-xp 5662 df-rel 5663 df-cnv 5664 df-co 5665 df-dm 5666 df-rn 5667 df-res 5668 df-ima 5669 df-pred 6325 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6515 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-isom 6570 df-riota 7403 df-ov 7449 df-oprab 7450 df-mpo 7451 df-of 7720 df-om 7905 df-1st 8028 df-2nd 8029 df-supp 8208 df-frecs 8330 df-wrecs 8361 df-recs 8410 df-rdg 8449 df-1o 8507 df-2o 8508 df-er 8748 df-map 8880 df-pm 8881 df-ixp 8957 df-en 9005 df-dom 9006 df-sdom 9007 df-fin 9008 df-fsupp 9385 df-fi 9433 df-sup 9464 df-inf 9465 df-oi 9534 df-card 10050 df-pnf 11375 df-mnf 11376 df-xr 11377 df-ltxr 11378 df-le 11379 df-sub 11573 df-neg 11574 df-div 12004 df-nn 12366 df-2 12435 df-3 12436 df-4 12437 df-5 12438 df-6 12439 df-7 12440 df-8 12441 df-9 12442 df-n0 12637 df-z 12724 df-dec 12845 df-uz 12996 df-q 13106 df-rp 13151 df-xneg 13271 df-xadd 13272 df-xmul 13273 df-ioo 13510 df-ico 13512 df-icc 13513 df-fz 13670 df-fzo 13819 df-fl 13962 df-seq 14175 df-exp 14235 df-hash 14505 df-cj 15298 df-re 15299 df-im 15300 df-sqrt 15434 df-abs 15435 df-limsup 15670 df-clim 15687 df-rlim 15688 df-sum 15886 df-struct 17357 df-sets 17374 df-slot 17392 df-ndx 17404 df-base 17420 df-ress 17441 df-plusg 17473 df-mulr 17474 df-starv 17475 df-sca 17476 df-vsca 17477 df-ip 17478 df-tset 17479 df-ple 17480 df-ds 17482 df-unif 17483 df-hom 17484 df-cco 17485 df-rest 17625 df-topn 17626 df-0g 17644 df-gsum 17645 df-topgen 17646 df-pt 17647 df-prds 17650 df-xrs 17706 df-qtop 17711 df-imas 17712 df-xps 17714 df-mre 17788 df-mrc 17789 df-acs 17791 df-mgm 18848 df-sgrp 18940 df-mnd 18956 df-submnd 19011 df-mulg 19310 df-cntz 19564 df-cmn 20029 df-psmet 21703 df-xmet 21704 df-met 21705 df-bl 21706 df-mopn 21707 df-fbas 21708 df-fg 21709 df-cnfld 21712 df-top 23245 df-topon 23262 df-topsp 23284 df-bases 23297 df-cld 23370 df-ntr 23371 df-cls 23372 df-nei 23449 df-lp 23487 df-perf 23488 df-cn 23578 df-cnp 23579 df-haus 23666 df-cmp 23738 df-tx 23914 df-hmeo 24107 df-fil 24198 df-fm 24290 df-flim 24291 df-flf 24292 df-xms 24672 df-ms 24673 df-tms 24674 df-cncf 25232 df-limc 26219 df-dv 26220 |
| This theorem is used by: divsqrtsumlem 27340 logdivsum 27893 |
| Copyright terms: Public domain | W3C validator |