|   | Mathbox for Glauco Siliprandi | < Previous  
      Next > Nearby theorems | |
| Mirrors > Home > MPE Home > Th. List > Mathboxes > ioodvbdlimc2 | Structured version Visualization version GIF version | ||
| Description: A real function with bounded derivative, has a limit at the upper bound of an open interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.) (Proof shortened by AV, 3-Oct-2020.) | 
| Ref | Expression | 
|---|---|
| ioodvbdlimc2.a | ⊢ (𝜑 → 𝐴 ∈ ℝ) | 
| ioodvbdlimc2.b | ⊢ (𝜑 → 𝐵 ∈ ℝ) | 
| ioodvbdlimc2.f | ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ) | 
| ioodvbdlimc2.dmdv | ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵)) | 
| ioodvbdlimc2.dvbd | ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦) | 
| Ref | Expression | 
|---|---|
| ioodvbdlimc2 | ⊢ (𝜑 → (𝐹 limℂ 𝐵) ≠ ∅) | 
| Step | Hyp | Ref | Expression | 
|---|---|---|---|
| 1 | ioodvbdlimc2.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ) | 
| 3 | ioodvbdlimc2.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ) | |
| 4 | 3 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ) | 
| 5 | simpr 484 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵) | |
| 6 | ioodvbdlimc2.f | . . . . 5 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ) | |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ) | 
| 8 | ioodvbdlimc2.dmdv | . . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵)) | |
| 9 | 8 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → dom (ℝ D 𝐹) = (𝐴(,)𝐵)) | 
| 10 | ioodvbdlimc2.dvbd | . . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦) | |
| 11 | 10 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦) | 
| 12 | 2fveq3 6910 | . . . . . . 7 ⊢ (𝑦 = 𝑥 → (abs‘((ℝ D 𝐹)‘𝑦)) = (abs‘((ℝ D 𝐹)‘𝑥))) | |
| 13 | 12 | cbvmptv 5254 | . . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))) | 
| 14 | 13 | rneqi 5947 | . . . . 5 ⊢ ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))) | 
| 15 | 14 | supeq1i 9488 | . . . 4 ⊢ sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) = sup(ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))), ℝ, < ) | 
| 16 | eqid 2736 | . . . 4 ⊢ ((⌊‘(1 / (𝐵 − 𝐴))) + 1) = ((⌊‘(1 / (𝐵 − 𝐴))) + 1) | |
| 17 | oveq2 7440 | . . . . . . 7 ⊢ (𝑘 = 𝑗 → (1 / 𝑘) = (1 / 𝑗)) | |
| 18 | 17 | oveq2d 7448 | . . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐵 − (1 / 𝑘)) = (𝐵 − (1 / 𝑗))) | 
| 19 | 18 | fveq2d 6909 | . . . . 5 ⊢ (𝑘 = 𝑗 → (𝐹‘(𝐵 − (1 / 𝑘))) = (𝐹‘(𝐵 − (1 / 𝑗)))) | 
| 20 | 19 | cbvmptv 5254 | . . . 4 ⊢ (𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘)))) = (𝑗 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑗)))) | 
| 21 | 18 | cbvmptv 5254 | . . . 4 ⊢ (𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐵 − (1 / 𝑘))) = (𝑗 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐵 − (1 / 𝑗))) | 
| 22 | eqid 2736 | . . . 4 ⊢ if(((⌊‘(1 / (𝐵 − 𝐴))) + 1) ≤ ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(1 / (𝐵 − 𝐴))) + 1)) = if(((⌊‘(1 / (𝐵 − 𝐴))) + 1) ≤ ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(1 / (𝐵 − 𝐴))) + 1)) | |
| 23 | biid 261 | . . . 4 ⊢ (((((((𝜑 ∧ 𝐴 < 𝐵) ∧ 𝑥 ∈ ℝ+) ∧ 𝑗 ∈ (ℤ≥‘if(((⌊‘(1 / (𝐵 − 𝐴))) + 1) ≤ ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(1 / (𝐵 − 𝐴))) + 1)))) ∧ (abs‘(((𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))‘𝑗) − (lim sup‘(𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))))) < (𝑥 / 2)) ∧ 𝑧 ∈ (𝐴(,)𝐵)) ∧ (abs‘(𝑧 − 𝐵)) < (1 / 𝑗)) ↔ ((((((𝜑 ∧ 𝐴 < 𝐵) ∧ 𝑥 ∈ ℝ+) ∧ 𝑗 ∈ (ℤ≥‘if(((⌊‘(1 / (𝐵 − 𝐴))) + 1) ≤ ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) / (𝑥 / 2))) + 1), ((⌊‘(1 / (𝐵 − 𝐴))) + 1)))) ∧ (abs‘(((𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))‘𝑗) − (lim sup‘(𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))))) < (𝑥 / 2)) ∧ 𝑧 ∈ (𝐴(,)𝐵)) ∧ (abs‘(𝑧 − 𝐵)) < (1 / 𝑗))) | |
| 24 | 2, 4, 5, 7, 9, 11, 15, 16, 20, 21, 22, 23 | ioodvbdlimc2lem 45954 | . . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (lim sup‘(𝑘 ∈ (ℤ≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))) ∈ (𝐹 limℂ 𝐵)) | 
| 25 | 24 | ne0d 4341 | . 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (𝐹 limℂ 𝐵) ≠ ∅) | 
| 26 | ax-resscn 11213 | . . . . . . . 8 ⊢ ℝ ⊆ ℂ | |
| 27 | 26 | a1i 11 | . . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ) | 
| 28 | 6, 27 | fssd 6752 | . . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ) | 
| 29 | 28 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ) | 
| 30 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴) | |
| 31 | 1 | rexrd 11312 | . . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ*) | 
| 32 | 31 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ*) | 
| 33 | 3 | rexrd 11312 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ*) | 
| 34 | 33 | adantr 480 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ*) | 
| 35 | ioo0 13413 | . . . . . . . 8 ⊢ ((𝐴 ∈ ℝ* ∧ 𝐵 ∈ ℝ*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | |
| 36 | 32, 34, 35 | syl2anc 584 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴)) | 
| 37 | 30, 36 | mpbird 257 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅) | 
| 38 | 37 | feq2d 6721 | . . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ↔ 𝐹:∅⟶ℂ)) | 
| 39 | 29, 38 | mpbid 232 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:∅⟶ℂ) | 
| 40 | 3 | recnd 11290 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℂ) | 
| 41 | 40 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℂ) | 
| 42 | 39, 41 | limcdm0 45638 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 limℂ 𝐵) = ℂ) | 
| 43 | 0cn 11254 | . . . . 5 ⊢ 0 ∈ ℂ | |
| 44 | 43 | ne0ii 4343 | . . . 4 ⊢ ℂ ≠ ∅ | 
| 45 | 44 | a1i 11 | . . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ℂ ≠ ∅) | 
| 46 | 42, 45 | eqnetrd 3007 | . 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 limℂ 𝐵) ≠ ∅) | 
| 47 | 25, 46, 1, 3 | ltlecasei 11370 | 1 ⊢ (𝜑 → (𝐹 limℂ 𝐵) ≠ ∅) | 
| Colors of variables: wff setvar class | 
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1539 ∈ wcel 2107 ≠ wne 2939 ∀wral 3060 ∃wrex 3069 ⊆ wss 3950 ∅c0 4332 ifcif 4524 class class class wbr 5142 ↦ cmpt 5224 dom cdm 5684 ran crn 5685 ⟶wf 6556 ‘cfv 6560 (class class class)co 7432 supcsup 9481 ℂcc 11154 ℝcr 11155 0cc0 11156 1c1 11157 + caddc 11159 ℝ*cxr 11295 < clt 11296 ≤ cle 11297 − cmin 11493 / cdiv 11921 2c2 12322 ℤ≥cuz 12879 ℝ+crp 13035 (,)cioo 13388 ⌊cfl 13831 abscabs 15274 lim supclsp 15507 limℂ climc 25898 D cdv 25899 | 
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2707 ax-rep 5278 ax-sep 5295 ax-nul 5305 ax-pow 5364 ax-pr 5431 ax-un 7756 ax-cnex 11212 ax-resscn 11213 ax-1cn 11214 ax-icn 11215 ax-addcl 11216 ax-addrcl 11217 ax-mulcl 11218 ax-mulrcl 11219 ax-mulcom 11220 ax-addass 11221 ax-mulass 11222 ax-distr 11223 ax-i2m1 11224 ax-1ne0 11225 ax-1rid 11226 ax-rnegex 11227 ax-rrecex 11228 ax-cnre 11229 ax-pre-lttri 11230 ax-pre-lttrn 11231 ax-pre-ltadd 11232 ax-pre-mulgt0 11233 ax-pre-sup 11234 ax-addf 11235 | 
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2728 df-clel 2815 df-nfc 2891 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-rmo 3379 df-reu 3380 df-rab 3436 df-v 3481 df-sbc 3788 df-csb 3899 df-dif 3953 df-un 3955 df-in 3957 df-ss 3967 df-pss 3970 df-nul 4333 df-if 4525 df-pw 4601 df-sn 4626 df-pr 4628 df-tp 4630 df-op 4632 df-uni 4907 df-int 4946 df-iun 4992 df-iin 4993 df-br 5143 df-opab 5205 df-mpt 5225 df-tr 5259 df-id 5577 df-eprel 5583 df-po 5591 df-so 5592 df-fr 5636 df-se 5637 df-we 5638 df-xp 5690 df-rel 5691 df-cnv 5692 df-co 5693 df-dm 5694 df-rn 5695 df-res 5696 df-ima 5697 df-pred 6320 df-ord 6386 df-on 6387 df-lim 6388 df-suc 6389 df-iota 6513 df-fun 6562 df-fn 6563 df-f 6564 df-f1 6565 df-fo 6566 df-f1o 6567 df-fv 6568 df-isom 6569 df-riota 7389 df-ov 7435 df-oprab 7436 df-mpo 7437 df-of 7698 df-om 7889 df-1st 8015 df-2nd 8016 df-supp 8187 df-frecs 8307 df-wrecs 8338 df-recs 8412 df-rdg 8451 df-1o 8507 df-2o 8508 df-er 8746 df-map 8869 df-pm 8870 df-ixp 8939 df-en 8987 df-dom 8988 df-sdom 8989 df-fin 8990 df-fsupp 9403 df-fi 9452 df-sup 9483 df-inf 9484 df-oi 9551 df-card 9980 df-pnf 11298 df-mnf 11299 df-xr 11300 df-ltxr 11301 df-le 11302 df-sub 11495 df-neg 11496 df-div 11922 df-nn 12268 df-2 12330 df-3 12331 df-4 12332 df-5 12333 df-6 12334 df-7 12335 df-8 12336 df-9 12337 df-n0 12529 df-z 12616 df-dec 12736 df-uz 12880 df-q 12992 df-rp 13036 df-xneg 13155 df-xadd 13156 df-xmul 13157 df-ioo 13392 df-ico 13394 df-icc 13395 df-fz 13549 df-fzo 13696 df-fl 13833 df-seq 14044 df-exp 14104 df-hash 14371 df-cj 15139 df-re 15140 df-im 15141 df-sqrt 15275 df-abs 15276 df-limsup 15508 df-clim 15525 df-rlim 15526 df-struct 17185 df-sets 17202 df-slot 17220 df-ndx 17232 df-base 17249 df-ress 17276 df-plusg 17311 df-mulr 17312 df-starv 17313 df-sca 17314 df-vsca 17315 df-ip 17316 df-tset 17317 df-ple 17318 df-ds 17320 df-unif 17321 df-hom 17322 df-cco 17323 df-rest 17468 df-topn 17469 df-0g 17487 df-gsum 17488 df-topgen 17489 df-pt 17490 df-prds 17493 df-xrs 17548 df-qtop 17553 df-imas 17554 df-xps 17556 df-mre 17630 df-mrc 17631 df-acs 17633 df-mgm 18654 df-sgrp 18733 df-mnd 18749 df-submnd 18798 df-mulg 19087 df-cntz 19336 df-cmn 19801 df-psmet 21357 df-xmet 21358 df-met 21359 df-bl 21360 df-mopn 21361 df-fbas 21362 df-fg 21363 df-cnfld 21366 df-top 22901 df-topon 22918 df-topsp 22940 df-bases 22954 df-cld 23028 df-ntr 23029 df-cls 23030 df-nei 23107 df-lp 23145 df-perf 23146 df-cn 23236 df-cnp 23237 df-haus 23324 df-cmp 23396 df-tx 23571 df-hmeo 23764 df-fil 23855 df-fm 23947 df-flim 23948 df-flf 23949 df-xms 24331 df-ms 24332 df-tms 24333 df-cncf 24905 df-limc 25902 df-dv 25903 | 
| This theorem is referenced by: fourierdlem94 46220 fourierdlem113 46239 | 
| Copyright terms: Public domain | W3C validator |