ioodvbdlimc1 - Mathbox for Glauco Siliprandi

	Mathbox for Glauco Siliprandi		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > ioodvbdlimc1		Structured version Visualization version GIF version

Theorem ioodvbdlimc1 45931

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.)

**Hypotheses**
Ref	Expression
ioodvbdlimc1.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
ioodvbdlimc1.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
ioodvbdlimc1.f	⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
ioodvbdlimc1.dmdv	⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
ioodvbdlimc1.dvbd	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)

**Assertion**
Ref	Expression
ioodvbdlimc1	⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) ≠ ∅)

Distinct variable groups: 𝑥,𝐴,𝑦 𝑥,𝐵,𝑦 𝑥,𝐹,𝑦 𝜑,𝑥,𝑦

Proof of Theorem ioodvbdlimc1 Dummy variables 𝑗 𝑘 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ioodvbdlimc1.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2	1	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ)
3		ioodvbdlimc1.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4	3	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ)
5		simpr 484	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
6		ioodvbdlimc1.f	. . . . 5 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
7	6	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
8		ioodvbdlimc1.dmdv	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
9	8	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
10		ioodvbdlimc1.dvbd	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
11	10	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
12		2fveq3 6863	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (abs‘((ℝ D 𝐹)‘𝑦)) = (abs‘((ℝ D 𝐹)‘𝑥)))
13	12	cbvmptv 5211	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
14	13	rneqi 5901	. . . . 5 ⊢ ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
15	14	supeq1i 9398	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) = sup(ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))), ℝ, < )
16		eqid 2729	. . . 4 ⊢ ((⌊‘(1 / (𝐵 − 𝐴))) + 1) = ((⌊‘(1 / (𝐵 − 𝐴))) + 1)
17		oveq2 7395	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (1 / 𝑗) = (1 / 𝑘))
18	17	oveq2d 7403	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝐴 + (1 / 𝑗)) = (𝐴 + (1 / 𝑘)))
19	18	fveq2d 6862	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝐹‘(𝐴 + (1 / 𝑗))) = (𝐹‘(𝐴 + (1 / 𝑘))))
20	19	cbvmptv 5211	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗)))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑘))))
21	18	cbvmptv 5211	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑗))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑘)))
22		eqid 2729	. . . 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	ioodvbdlimc1lem2 45930	. . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (lim sup‘(𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗))))) ∈ (𝐹 lim_ℂ 𝐴))
25	24	ne0d 4305	. 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
26		ax-resscn 11125	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
27	26	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ)
28	6, 27	fssd 6705	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
29	28	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
30		simpr 484	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴)
31	1	rexrd 11224	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
32	31	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ^*)
33	3	rexrd 11224	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
34	33	adantr 480	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ^*)
35		ioo0 13331	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
36	32, 34, 35	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
37	30, 36	mpbird 257	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅)
38	37	feq2d 6672	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ↔ 𝐹:∅⟶ℂ))
39	29, 38	mpbid 232	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:∅⟶ℂ)
40	1	recnd 11202	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
41	40	adantr 480	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℂ)
42	39, 41	limcdm0 45616	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) = ℂ)
43		0cn 11166	. . . . 5 ⊢ 0 ∈ ℂ
44	43	ne0ii 4307	. . . 4 ⊢ ℂ ≠ ∅
45	44	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ℂ ≠ ∅)
46	42, 45	eqnetrd 2992	. 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
47	25, 46, 1, 3	ltlecasei 11282	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∀wral 3044 ∃wrex 3053 ⊆ wss 3914 ∅c0 4296 ifcif 4488 class class class wbr 5107 ↦ cmpt 5188 dom cdm 5638 ran crn 5639 ⟶wf 6507 ‘cfv 6511 (class class class)co 7387 supcsup 9391 ℂcc 11066 ℝcr 11067 0cc0 11068 1c1 11069 + caddc 11071 ℝ^*cxr 11207 < clt 11208 ≤ cle 11209 − cmin 11405 / cdiv 11835 2c2 12241 ℤ_≥cuz 12793 ℝ⁺crp 12951 (,)cioo 13306 ⌊cfl 13752 abscabs 15200 lim supclsp 15436 lim_ℂ climc 25763 D cdv 25764

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 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5234 ax-sep 5251 ax-nul 5261 ax-pow 5320 ax-pr 5387 ax-un 7711 ax-cnex 11124 ax-resscn 11125 ax-1cn 11126 ax-icn 11127 ax-addcl 11128 ax-addrcl 11129 ax-mulcl 11130 ax-mulrcl 11131 ax-mulcom 11132 ax-addass 11133 ax-mulass 11134 ax-distr 11135 ax-i2m1 11136 ax-1ne0 11137 ax-1rid 11138 ax-rnegex 11139 ax-rrecex 11140 ax-cnre 11141 ax-pre-lttri 11142 ax-pre-lttrn 11143 ax-pre-ltadd 11144 ax-pre-mulgt0 11145 ax-pre-sup 11146 ax-addf 11147

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-nel 3030 df-ral 3045 df-rex 3054 df-rmo 3354 df-reu 3355 df-rab 3406 df-v 3449 df-sbc 3754 df-csb 3863 df-dif 3917 df-un 3919 df-in 3921 df-ss 3931 df-pss 3934 df-nul 4297 df-if 4489 df-pw 4565 df-sn 4590 df-pr 4592 df-tp 4594 df-op 4596 df-uni 4872 df-int 4911 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5170 df-mpt 5189 df-tr 5215 df-id 5533 df-eprel 5538 df-po 5546 df-so 5547 df-fr 5591 df-se 5592 df-we 5593 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-res 5650 df-ima 5651 df-pred 6274 df-ord 6335 df-on 6336 df-lim 6337 df-suc 6338 df-iota 6464 df-fun 6513 df-fn 6514 df-f 6515 df-f1 6516 df-fo 6517 df-f1o 6518 df-fv 6519 df-isom 6520 df-riota 7344 df-ov 7390 df-oprab 7391 df-mpo 7392 df-of 7653 df-om 7843 df-1st 7968 df-2nd 7969 df-supp 8140 df-frecs 8260 df-wrecs 8291 df-recs 8340 df-rdg 8378 df-1o 8434 df-2o 8435 df-er 8671 df-map 8801 df-pm 8802 df-ixp 8871 df-en 8919 df-dom 8920 df-sdom 8921 df-fin 8922 df-fsupp 9313 df-fi 9362 df-sup 9393 df-inf 9394 df-oi 9463 df-card 9892 df-pnf 11210 df-mnf 11211 df-xr 11212 df-ltxr 11213 df-le 11214 df-sub 11407 df-neg 11408 df-div 11836 df-nn 12187 df-2 12249 df-3 12250 df-4 12251 df-5 12252 df-6 12253 df-7 12254 df-8 12255 df-9 12256 df-n0 12443 df-z 12530 df-dec 12650 df-uz 12794 df-q 12908 df-rp 12952 df-xneg 13072 df-xadd 13073 df-xmul 13074 df-ioo 13310 df-ico 13312 df-icc 13313 df-fz 13469 df-fzo 13616 df-fl 13754 df-seq 13967 df-exp 14027 df-hash 14296 df-cj 15065 df-re 15066 df-im 15067 df-sqrt 15201 df-abs 15202 df-limsup 15437 df-clim 15454 df-rlim 15455 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-starv 17235 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-hom 17244 df-cco 17245 df-rest 17385 df-topn 17386 df-0g 17404 df-gsum 17405 df-topgen 17406 df-pt 17407 df-prds 17410 df-xrs 17465 df-qtop 17470 df-imas 17471 df-xps 17473 df-mre 17547 df-mrc 17548 df-acs 17550 df-mgm 18567 df-sgrp 18646 df-mnd 18662 df-submnd 18711 df-mulg 19000 df-cntz 19249 df-cmn 19712 df-psmet 21256 df-xmet 21257 df-met 21258 df-bl 21259 df-mopn 21260 df-fbas 21261 df-fg 21262 df-cnfld 21265 df-top 22781 df-topon 22798 df-topsp 22820 df-bases 22833 df-cld 22906 df-ntr 22907 df-cls 22908 df-nei 22985 df-lp 23023 df-perf 23024 df-cn 23114 df-cnp 23115 df-haus 23202 df-cmp 23274 df-tx 23449 df-hmeo 23642 df-fil 23733 df-fm 23825 df-flim 23826 df-flf 23827 df-xms 24208 df-ms 24209 df-tms 24210 df-cncf 24771 df-limc 25767 df-dv 25768

This theorem is referenced by: fourierdlem94 46198 fourierdlem113 46217

W3C validator