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 42225

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 483	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 ∈ ℝ)
3		ioodvbdlimc1.b	. . . . 5 ⊢ (𝜑 → 𝐵 ∈ ℝ)
4	3	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐵 ∈ ℝ)
5		simpr 487	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐴 < 𝐵)
6		ioodvbdlimc1.f	. . . . 5 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℝ)
7	6	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → 𝐹:(𝐴(,)𝐵)⟶ℝ)
8		ioodvbdlimc1.dmdv	. . . . 5 ⊢ (𝜑 → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
9	8	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → dom (ℝ D 𝐹) = (𝐴(,)𝐵))
10		ioodvbdlimc1.dvbd	. . . . 5 ⊢ (𝜑 → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
11	10	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → ∃𝑦 ∈ ℝ ∀𝑥 ∈ (𝐴(,)𝐵)(abs‘((ℝ D 𝐹)‘𝑥)) ≤ 𝑦)
12		2fveq3 6677	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (abs‘((ℝ D 𝐹)‘𝑦)) = (abs‘((ℝ D 𝐹)‘𝑥)))
13	12	cbvmptv 5171	. . . . . 6 ⊢ (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
14	13	rneqi 5809	. . . . 5 ⊢ ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))) = ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥)))
15	14	supeq1i 8913	. . . 4 ⊢ sup(ran (𝑦 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑦))), ℝ, < ) = sup(ran (𝑥 ∈ (𝐴(,)𝐵) ↦ (abs‘((ℝ D 𝐹)‘𝑥))), ℝ, < )
16		eqid 2823	. . . 4 ⊢ ((⌊‘(1 / (𝐵 − 𝐴))) + 1) = ((⌊‘(1 / (𝐵 − 𝐴))) + 1)
17		oveq2 7166	. . . . . . 7 ⊢ (𝑗 = 𝑘 → (1 / 𝑗) = (1 / 𝑘))
18	17	oveq2d 7174	. . . . . 6 ⊢ (𝑗 = 𝑘 → (𝐴 + (1 / 𝑗)) = (𝐴 + (1 / 𝑘)))
19	18	fveq2d 6676	. . . . 5 ⊢ (𝑗 = 𝑘 → (𝐹‘(𝐴 + (1 / 𝑗))) = (𝐹‘(𝐴 + (1 / 𝑘))))
20	19	cbvmptv 5171	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗)))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑘))))
21	18	cbvmptv 5171	. . . 4 ⊢ (𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑗))) = (𝑘 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐴 + (1 / 𝑘)))
22		eqid 2823	. . . 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 263	. . . 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 42224	. . 3 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (lim sup‘(𝑗 ∈ (ℤ_≥‘((⌊‘(1 / (𝐵 − 𝐴))) + 1)) ↦ (𝐹‘(𝐴 + (1 / 𝑗))))) ∈ (𝐹 lim_ℂ 𝐴))
25	24	ne0d 4303	. 2 ⊢ ((𝜑 ∧ 𝐴 < 𝐵) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
26		ax-resscn 10596	. . . . . . . 8 ⊢ ℝ ⊆ ℂ
27	26	a1i 11	. . . . . . 7 ⊢ (𝜑 → ℝ ⊆ ℂ)
28	6, 27	fssd 6530	. . . . . 6 ⊢ (𝜑 → 𝐹:(𝐴(,)𝐵)⟶ℂ)
29	28	adantr 483	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:(𝐴(,)𝐵)⟶ℂ)
30		simpr 487	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ≤ 𝐴)
31	1	rexrd 10693	. . . . . . . . 9 ⊢ (𝜑 → 𝐴 ∈ ℝ^*)
32	31	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℝ^*)
33	3	rexrd 10693	. . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ ℝ^*)
34	33	adantr 483	. . . . . . . 8 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐵 ∈ ℝ^*)
35		ioo0 12766	. . . . . . . 8 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
36	32, 34, 35	syl2anc 586	. . . . . . 7 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ((𝐴(,)𝐵) = ∅ ↔ 𝐵 ≤ 𝐴))
37	30, 36	mpbird 259	. . . . . 6 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐴(,)𝐵) = ∅)
38	37	feq2d 6502	. . . . 5 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹:(𝐴(,)𝐵)⟶ℂ ↔ 𝐹:∅⟶ℂ))
39	29, 38	mpbid 234	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐹:∅⟶ℂ)
40	1	recnd 10671	. . . . 5 ⊢ (𝜑 → 𝐴 ∈ ℂ)
41	40	adantr 483	. . . 4 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → 𝐴 ∈ ℂ)
42	39, 41	limcdm0 41906	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) = ℂ)
43		0cn 10635	. . . . 5 ⊢ 0 ∈ ℂ
44	43	ne0ii 4305	. . . 4 ⊢ ℂ ≠ ∅
45	44	a1i 11	. . 3 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → ℂ ≠ ∅)
46	42, 45	eqnetrd 3085	. 2 ⊢ ((𝜑 ∧ 𝐵 ≤ 𝐴) → (𝐹 lim_ℂ 𝐴) ≠ ∅)
47	25, 46, 1, 3	ltlecasei 10750	1 ⊢ (𝜑 → (𝐹 lim_ℂ 𝐴) ≠ ∅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3018 ∀wral 3140 ∃wrex 3141 ⊆ wss 3938 ∅c0 4293 ifcif 4469 class class class wbr 5068 ↦ cmpt 5148 dom cdm 5557 ran crn 5558 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 supcsup 8906 ℂcc 10537 ℝcr 10538 0cc0 10539 1c1 10540 + caddc 10542 ℝ^*cxr 10676 < clt 10677 ≤ cle 10678 − cmin 10872 / cdiv 11299 2c2 11695 ℤ_≥cuz 12246 ℝ⁺crp 12392 (,)cioo 12741 ⌊cfl 13163 abscabs 14595 lim supclsp 14829 lim_ℂ climc 24462 D cdv 24463

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 ax-pre-sup 10617 ax-addf 10618 ax-mulf 10619

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-iin 4924 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-se 5517 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-isom 6366 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-of 7411 df-om 7583 df-1st 7691 df-2nd 7692 df-supp 7833 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-2o 8105 df-oadd 8108 df-er 8291 df-map 8410 df-pm 8411 df-ixp 8464 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-fsupp 8836 df-fi 8877 df-sup 8908 df-inf 8909 df-oi 8976 df-card 9370 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-div 11300 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-q 12352 df-rp 12393 df-xneg 12510 df-xadd 12511 df-xmul 12512 df-ioo 12745 df-ico 12747 df-icc 12748 df-fz 12896 df-fzo 13037 df-fl 13165 df-seq 13373 df-exp 13433 df-hash 13694 df-cj 14460 df-re 14461 df-im 14462 df-sqrt 14596 df-abs 14597 df-limsup 14830 df-clim 14847 df-rlim 14848 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-sets 16492 df-ress 16493 df-plusg 16580 df-mulr 16581 df-starv 16582 df-sca 16583 df-vsca 16584 df-ip 16585 df-tset 16586 df-ple 16587 df-ds 16589 df-unif 16590 df-hom 16591 df-cco 16592 df-rest 16698 df-topn 16699 df-0g 16717 df-gsum 16718 df-topgen 16719 df-pt 16720 df-prds 16723 df-xrs 16777 df-qtop 16782 df-imas 16783 df-xps 16785 df-mre 16859 df-mrc 16860 df-acs 16862 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-submnd 17959 df-mulg 18227 df-cntz 18449 df-cmn 18910 df-psmet 20539 df-xmet 20540 df-met 20541 df-bl 20542 df-mopn 20543 df-fbas 20544 df-fg 20545 df-cnfld 20548 df-top 21504 df-topon 21521 df-topsp 21543 df-bases 21556 df-cld 21629 df-ntr 21630 df-cls 21631 df-nei 21708 df-lp 21746 df-perf 21747 df-cn 21837 df-cnp 21838 df-haus 21925 df-cmp 21997 df-tx 22172 df-hmeo 22365 df-fil 22456 df-fm 22548 df-flim 22549 df-flf 22550 df-xms 22932 df-ms 22933 df-tms 22934 df-cncf 23488 df-limc 24466 df-dv 24467

This theorem is referenced by: fourierdlem94 42492 fourierdlem113 42511

W3C validator