ioodvbdlimc2 - Mathbox for Glauco Siliprandi

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

Theorem ioodvbdlimc2 43457

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
ioodvbdlimc2.a	⊢ (𝜑 → 𝐴 ∈ ℝ)
ioodvbdlimc2.b	⊢ (𝜑 → 𝐵 ∈ ℝ)
ioodvbdlimc2.f	⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
ioodvbdlimc2.dmdv	⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
ioodvbdlimc2.dvbd	⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)

**Assertion**
Ref	Expression
ioodvbdlimc2	⊢ (𝜑 → (𝐹 lim_ℂ 𝐵) ≠ ∅)

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

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

Step	Hyp	Ref	Expression
1		ioodvbdlimc2.a	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℝ)
2	1	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ)
3		ioodvbdlimc2.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4	3	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ)
5		simpr 485	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
6		ioodvbdlimc2.f	. . . . 5 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
7	6	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
8		ioodvbdlimc2.dmdv	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
9	8	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
10		ioodvbdlimc2.dvbd	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
11	10	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
12		2fveq3 6771	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (abs‘((ℝ D 𝐹)‘𝑦)) = (abs‘((ℝ D 𝐹)‘𝑥)))
13	12	cbvmptv 5186	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
14	13	rneqi 5839	. . . . 5 ⊢ ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
15	14	supeq1i 9193	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) = sup(ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))), ℝ, < )
16		eqid 2738	. . . 4 ⊢ ((⌊‘(1 / (𝐵 − 𝐴))) + 1) = ((⌊‘(1 / (𝐵 − 𝐴))) + 1)
17		oveq2 7275	. . . . . . 7 ⊢ (𝑘 = 𝑗 → (1 / 𝑘) = (1 / 𝑗))
18	17	oveq2d 7283	. . . . . 6 ⊢ (𝑘 = 𝑗 → (𝐵 − (1 / 𝑘)) = (𝐵 − (1 / 𝑗)))
19	18	fveq2d 6770	. . . . 5 ⊢ (𝑘 = 𝑗 → (𝐹‘(𝐵 − (1 / 𝑘))) = (𝐹‘(𝐵 − (1 / 𝑗))))
20	19	cbvmptv 5186	. . . 4 ⊢ (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘)))) = (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑗))))
21	18	cbvmptv 5186	. . . 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	ioodvbdlimc2lem 43456	. . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (lim sup‘(𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐵 − (1 / 𝑘))))) ∈ (𝐹 lim_ℂ 𝐵))
25	24	ne0d 4269	. 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (𝐹 lim_ℂ 𝐵) ≠ ∅)
26		ax-resscn 10938	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
27	26	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ)
28	6, 27	fssd 6610	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
29	28	adantr 481	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
30		simpr 485	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴)
31	1	rexrd 11035	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
32	31	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ^*)
33	3	rexrd 11035	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
34	33	adantr 481	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ^*)
35		ioo0 13114	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
36	32, 34, 35	syl2anc 584	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
37	30, 36	mpbird 256	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅)
38	37	feq2d 6578	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ↔ 𝐹:∅⟶ℂ))
39	29, 38	mpbid 231	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:∅⟶ℂ)
40	3	recnd 11013	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℂ)
41	40	adantr 481	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℂ)
42	39, 41	limcdm0 43140	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐵) = ℂ)
43		0cn 10977	. . . . 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 11093	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 3886 ∅c0 4256 ifcif 4459 class class class wbr 5073 ↦ cmpt 5156 dom cdm 5584 ran crn 5585 ⟶wf 6422 ‘cfv 6426 (class class class)co 7267 supcsup 9186 ℂcc 10879 ℝcr 10880 0cc0 10881 1c1 10882 + caddc 10884 ℝ^*cxr 11018 < clt 11019 ≤ cle 11020 − cmin 11215 / cdiv 11642 2c2 12038 ℤ_≥cuz 12592 ℝ⁺crp 12740 (,)cioo 13089 ⌊cfl 13520 abscabs 14955 lim supclsp 15189 lim_ℂ climc 25036 D cdv 25037

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 5208 ax-sep 5221 ax-nul 5228 ax-pow 5286 ax-pr 5350 ax-un 7578 ax-cnex 10937 ax-resscn 10938 ax-1cn 10939 ax-icn 10940 ax-addcl 10941 ax-addrcl 10942 ax-mulcl 10943 ax-mulrcl 10944 ax-mulcom 10945 ax-addass 10946 ax-mulass 10947 ax-distr 10948 ax-i2m1 10949 ax-1ne0 10950 ax-1rid 10951 ax-rnegex 10952 ax-rrecex 10953 ax-cnre 10954 ax-pre-lttri 10955 ax-pre-lttrn 10956 ax-pre-ltadd 10957 ax-pre-mulgt0 10958 ax-pre-sup 10959 ax-addf 10960 ax-mulf 10961

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-reu 3071 df-rmo 3072 df-rab 3073 df-v 3431 df-sbc 3716 df-csb 3832 df-dif 3889 df-un 3891 df-in 3893 df-ss 3903 df-pss 3905 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 5074 df-opab 5136 df-mpt 5157 df-tr 5191 df-id 5484 df-eprel 5490 df-po 5498 df-so 5499 df-fr 5539 df-se 5540 df-we 5541 df-xp 5590 df-rel 5591 df-cnv 5592 df-co 5593 df-dm 5594 df-rn 5595 df-res 5596 df-ima 5597 df-pred 6195 df-ord 6262 df-on 6263 df-lim 6264 df-suc 6265 df-iota 6384 df-fun 6428 df-fn 6429 df-f 6430 df-f1 6431 df-fo 6432 df-f1o 6433 df-fv 6434 df-isom 6435 df-riota 7224 df-ov 7270 df-oprab 7271 df-mpo 7272 df-of 7523 df-om 7703 df-1st 7820 df-2nd 7821 df-supp 7965 df-frecs 8084 df-wrecs 8115 df-recs 8189 df-rdg 8228 df-1o 8284 df-2o 8285 df-er 8485 df-map 8604 df-pm 8605 df-ixp 8673 df-en 8721 df-dom 8722 df-sdom 8723 df-fin 8724 df-fsupp 9116 df-fi 9157 df-sup 9188 df-inf 9189 df-oi 9256 df-card 9707 df-pnf 11021 df-mnf 11022 df-xr 11023 df-ltxr 11024 df-le 11025 df-sub 11217 df-neg 11218 df-div 11643 df-nn 11984 df-2 12046 df-3 12047 df-4 12048 df-5 12049 df-6 12050 df-7 12051 df-8 12052 df-9 12053 df-n0 12244 df-z 12330 df-dec 12448 df-uz 12593 df-q 12699 df-rp 12741 df-xneg 12858 df-xadd 12859 df-xmul 12860 df-ioo 13093 df-ico 13095 df-icc 13096 df-fz 13250 df-fzo 13393 df-fl 13522 df-seq 13732 df-exp 13793 df-hash 14055 df-cj 14820 df-re 14821 df-im 14822 df-sqrt 14956 df-abs 14957 df-limsup 15190 df-clim 15207 df-rlim 15208 df-struct 16858 df-sets 16875 df-slot 16893 df-ndx 16905 df-base 16923 df-ress 16952 df-plusg 16985 df-mulr 16986 df-starv 16987 df-sca 16988 df-vsca 16989 df-ip 16990 df-tset 16991 df-ple 16992 df-ds 16994 df-unif 16995 df-hom 16996 df-cco 16997 df-rest 17143 df-topn 17144 df-0g 17162 df-gsum 17163 df-topgen 17164 df-pt 17165 df-prds 17168 df-xrs 17223 df-qtop 17228 df-imas 17229 df-xps 17231 df-mre 17305 df-mrc 17306 df-acs 17308 df-mgm 18336 df-sgrp 18385 df-mnd 18396 df-submnd 18441 df-mulg 18711 df-cntz 18933 df-cmn 19398 df-psmet 20599 df-xmet 20600 df-met 20601 df-bl 20602 df-mopn 20603 df-fbas 20604 df-fg 20605 df-cnfld 20608 df-top 22053 df-topon 22070 df-topsp 22092 df-bases 22106 df-cld 22180 df-ntr 22181 df-cls 22182 df-nei 22259 df-lp 22297 df-perf 22298 df-cn 22388 df-cnp 22389 df-haus 22476 df-cmp 22548 df-tx 22723 df-hmeo 22916 df-fil 23007 df-fm 23099 df-flim 23100 df-flf 23101 df-xms 23483 df-ms 23484 df-tms 23485 df-cncf 24051 df-limc 25040 df-dv 25041

This theorem is referenced by: fourierdlem94 43722 fourierdlem113 43741

W3C validator