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 43474

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 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ)
3		ioodvbdlimc1.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4	3	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ)
5		simpr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
6		ioodvbdlimc1.f	. . . . 5 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
7	6	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
8		ioodvbdlimc1.dmdv	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
9	8	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
10		ioodvbdlimc1.dvbd	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
11	10	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
12		2fveq3 6779	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (abs‘((ℝ D 𝐹)‘𝑦)) = (abs‘((ℝ D 𝐹)‘𝑥)))
13	12	cbvmptv 5187	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
14	13	rneqi 5846	. . . . 5 ⊢ ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
15	14	supeq1i 9206	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) = sup(ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))), ℝ, < )
16		eqid 2738	. . . 4 ⊢ ((⌊‘(1 / (𝐵 − 𝐴))) + 1) = ((⌊‘(1 / (𝐵 − 𝐴))) + 1)
17		oveq2 7283	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (1 / 𝑗) = (1 / 𝑘))
18	17	oveq2d 7291	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝐴 + (1 / 𝑗)) = (𝐴 + (1 / 𝑘)))
19	18	fveq2d 6778	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝐹‘(𝐴 + (1 / 𝑗))) = (𝐹‘(𝐴 + (1 / 𝑘))))
20	19	cbvmptv 5187	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗)))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑘))))
21	18	cbvmptv 5187	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑗))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑘)))
22		eqid 2738	. . . 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 260	. . . 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 43473	. . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (lim sup‘(𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗))))) ∈ (𝐹 lim_ℂ 𝐴))
25	24	ne0d 4269	. 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
26		ax-resscn 10928	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
27	26	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ)
28	6, 27	fssd 6618	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
29	28	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
30		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴)
31	1	rexrd 11025	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
32	31	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ^*)
33	3	rexrd 11025	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
34	33	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ^*)
35		ioo0 13104	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
36	32, 34, 35	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
37	30, 36	mpbird 256	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅)
38	37	feq2d 6586	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ↔ 𝐹:∅⟶ℂ))
39	29, 38	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:∅⟶ℂ)
40	1	recnd 11003	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
41	40	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℂ)
42	39, 41	limcdm0 43159	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) = ℂ)
43		0cn 10967	. . . . 5 ⊢ 0 ∈ ℂ
44	43	ne0ii 4271	. . . 4 ⊢ ℂ ≠ ∅
45	44	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ℂ ≠ ∅)
46	42, 45	eqnetrd 3011	. 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
47	25, 46, 1, 3	ltlecasei 11083	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1539 ∈ wcel 2106 ≠ wne 2943 ∀wral 3064 ∃wrex 3065 ⊆ wss 3887 ∅c0 4256 ifcif 4459 class class class wbr 5074 ↦ cmpt 5157 dom cdm 5589 ran crn 5590 ⟶wf 6429 ‘cfv 6433 (class class class)co 7275 supcsup 9199 ℂcc 10869 ℝcr 10870 0cc0 10871 1c1 10872 + caddc 10874 ℝ^*cxr 11008 < clt 11009 ≤ cle 11010 − cmin 11205 / cdiv 11632 2c2 12028 ℤ_≥cuz 12582 ℝ⁺crp 12730 (,)cioo 13079 ⌊cfl 13510 abscabs 14945 lim supclsp 15179 lim_ℂ climc 25026 D cdv 25027

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 ax-rep 5209 ax-sep 5223 ax-nul 5230 ax-pow 5288 ax-pr 5352 ax-un 7588 ax-cnex 10927 ax-resscn 10928 ax-1cn 10929 ax-icn 10930 ax-addcl 10931 ax-addrcl 10932 ax-mulcl 10933 ax-mulrcl 10934 ax-mulcom 10935 ax-addass 10936 ax-mulass 10937 ax-distr 10938 ax-i2m1 10939 ax-1ne0 10940 ax-1rid 10941 ax-rnegex 10942 ax-rrecex 10943 ax-cnre 10944 ax-pre-lttri 10945 ax-pre-lttrn 10946 ax-pre-ltadd 10947 ax-pre-mulgt0 10948 ax-pre-sup 10949 ax-addf 10950 ax-mulf 10951

This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-nf 1787 df-sb 2068 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ne 2944 df-nel 3050 df-ral 3069 df-rex 3070 df-rmo 3071 df-reu 3072 df-rab 3073 df-v 3434 df-sbc 3717 df-csb 3833 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-pss 3906 df-nul 4257 df-if 4460 df-pw 4535 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4840 df-int 4880 df-iun 4926 df-iin 4927 df-br 5075 df-opab 5137 df-mpt 5158 df-tr 5192 df-id 5489 df-eprel 5495 df-po 5503 df-so 5504 df-fr 5544 df-se 5545 df-we 5546 df-xp 5595 df-rel 5596 df-cnv 5597 df-co 5598 df-dm 5599 df-rn 5600 df-res 5601 df-ima 5602 df-pred 6202 df-ord 6269 df-on 6270 df-lim 6271 df-suc 6272 df-iota 6391 df-fun 6435 df-fn 6436 df-f 6437 df-f1 6438 df-fo 6439 df-f1o 6440 df-fv 6441 df-isom 6442 df-riota 7232 df-ov 7278 df-oprab 7279 df-mpo 7280 df-of 7533 df-om 7713 df-1st 7831 df-2nd 7832 df-supp 7978 df-frecs 8097 df-wrecs 8128 df-recs 8202 df-rdg 8241 df-1o 8297 df-2o 8298 df-er 8498 df-map 8617 df-pm 8618 df-ixp 8686 df-en 8734 df-dom 8735 df-sdom 8736 df-fin 8737 df-fsupp 9129 df-fi 9170 df-sup 9201 df-inf 9202 df-oi 9269 df-card 9697 df-pnf 11011 df-mnf 11012 df-xr 11013 df-ltxr 11014 df-le 11015 df-sub 11207 df-neg 11208 df-div 11633 df-nn 11974 df-2 12036 df-3 12037 df-4 12038 df-5 12039 df-6 12040 df-7 12041 df-8 12042 df-9 12043 df-n0 12234 df-z 12320 df-dec 12438 df-uz 12583 df-q 12689 df-rp 12731 df-xneg 12848 df-xadd 12849 df-xmul 12850 df-ioo 13083 df-ico 13085 df-icc 13086 df-fz 13240 df-fzo 13383 df-fl 13512 df-seq 13722 df-exp 13783 df-hash 14045 df-cj 14810 df-re 14811 df-im 14812 df-sqrt 14946 df-abs 14947 df-limsup 15180 df-clim 15197 df-rlim 15198 df-struct 16848 df-sets 16865 df-slot 16883 df-ndx 16895 df-base 16913 df-ress 16942 df-plusg 16975 df-mulr 16976 df-starv 16977 df-sca 16978 df-vsca 16979 df-ip 16980 df-tset 16981 df-ple 16982 df-ds 16984 df-unif 16985 df-hom 16986 df-cco 16987 df-rest 17133 df-topn 17134 df-0g 17152 df-gsum 17153 df-topgen 17154 df-pt 17155 df-prds 17158 df-xrs 17213 df-qtop 17218 df-imas 17219 df-xps 17221 df-mre 17295 df-mrc 17296 df-acs 17298 df-mgm 18326 df-sgrp 18375 df-mnd 18386 df-submnd 18431 df-mulg 18701 df-cntz 18923 df-cmn 19388 df-psmet 20589 df-xmet 20590 df-met 20591 df-bl 20592 df-mopn 20593 df-fbas 20594 df-fg 20595 df-cnfld 20598 df-top 22043 df-topon 22060 df-topsp 22082 df-bases 22096 df-cld 22170 df-ntr 22171 df-cls 22172 df-nei 22249 df-lp 22287 df-perf 22288 df-cn 22378 df-cnp 22379 df-haus 22466 df-cmp 22538 df-tx 22713 df-hmeo 22906 df-fil 22997 df-fm 23089 df-flim 23090 df-flf 23091 df-xms 23473 df-ms 23474 df-tms 23475 df-cncf 24041 df-limc 25030 df-dv 25031

This theorem is referenced by: fourierdlem94 43741 fourierdlem113 43760

W3C validator