![]() |
Mathbox for Asger C. Ipsen |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > unbdqndv1 | Structured version Visualization version GIF version |
Description: If the difference quotient (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴)) is unbounded near 𝐴 then 𝐹 is not differentiable at 𝐴. (Contributed by Asger C. Ipsen, 12-May-2021.) |
Ref | Expression |
---|---|
unbdqndv1.g | ⊢ 𝐺 = (𝑧 ∈ (𝑋 ∖ {𝐴}) ↦ (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴))) |
unbdqndv1.1 | ⊢ (𝜑 → 𝑆 ⊆ ℂ) |
unbdqndv1.2 | ⊢ (𝜑 → 𝑋 ⊆ 𝑆) |
unbdqndv1.3 | ⊢ (𝜑 → 𝐹:𝑋⟶ℂ) |
unbdqndv1.4 | ⊢ (𝜑 → ∀𝑏 ∈ ℝ+ ∀𝑑 ∈ ℝ+ ∃𝑥 ∈ (𝑋 ∖ {𝐴})((abs‘(𝑥 − 𝐴)) < 𝑑 ∧ 𝑏 ≤ (abs‘(𝐺‘𝑥)))) |
Ref | Expression |
---|---|
unbdqndv1 | ⊢ (𝜑 → ¬ 𝐴 ∈ dom (𝑆 D 𝐹)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | noel 4328 | . . . . . . . 8 ⊢ ¬ 𝑦 ∈ ∅ | |
2 | 1 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝑦 ∈ ∅) |
3 | unbdqndv1.2 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ⊆ 𝑆) | |
4 | unbdqndv1.1 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ⊆ ℂ) | |
5 | 3, 4 | sstrd 3990 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℂ) |
6 | 5 | adantr 482 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝑋 ⊆ ℂ) |
7 | 6 | ssdifssd 4140 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝑋 ∖ {𝐴}) ⊆ ℂ) |
8 | unbdqndv1.3 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑋⟶ℂ) | |
9 | 8 | adantr 482 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐹:𝑋⟶ℂ) |
10 | 4, 8, 3 | dvbss 25387 | . . . . . . . . . . 11 ⊢ (𝜑 → dom (𝑆 D 𝐹) ⊆ 𝑋) |
11 | 10 | sselda 3980 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ 𝑋) |
12 | 9, 6, 11 | dvlem 25382 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) ∧ 𝑧 ∈ (𝑋 ∖ {𝐴})) → (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴)) ∈ ℂ) |
13 | unbdqndv1.g | . . . . . . . . 9 ⊢ 𝐺 = (𝑧 ∈ (𝑋 ∖ {𝐴}) ↦ (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴))) | |
14 | 12, 13 | fmptd 7101 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐺:(𝑋 ∖ {𝐴})⟶ℂ) |
15 | 6, 11 | sseldd 3981 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ ℂ) |
16 | unbdqndv1.4 | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑏 ∈ ℝ+ ∀𝑑 ∈ ℝ+ ∃𝑥 ∈ (𝑋 ∖ {𝐴})((abs‘(𝑥 − 𝐴)) < 𝑑 ∧ 𝑏 ≤ (abs‘(𝐺‘𝑥)))) | |
17 | 16 | adantr 482 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ∀𝑏 ∈ ℝ+ ∀𝑑 ∈ ℝ+ ∃𝑥 ∈ (𝑋 ∖ {𝐴})((abs‘(𝑥 − 𝐴)) < 𝑑 ∧ 𝑏 ≤ (abs‘(𝐺‘𝑥)))) |
18 | 7, 14, 15, 17 | unblimceq0 35288 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝐺 limℂ 𝐴) = ∅) |
19 | 2, 18 | neleqtrrd 2857 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝑦 ∈ (𝐺 limℂ 𝐴)) |
20 | 19 | intnand 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴))) |
21 | eqid 2733 | . . . . . . . 8 ⊢ ((TopOpen‘ℂfld) ↾t 𝑆) = ((TopOpen‘ℂfld) ↾t 𝑆) | |
22 | eqid 2733 | . . . . . . . 8 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
23 | 21, 22, 13, 4, 8, 3 | eldv 25384 | . . . . . . 7 ⊢ (𝜑 → (𝐴(𝑆 D 𝐹)𝑦 ↔ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
24 | 23 | notbid 318 | . . . . . 6 ⊢ (𝜑 → (¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
25 | 24 | adantr 482 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
26 | 20, 25 | mpbird 257 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝐴(𝑆 D 𝐹)𝑦) |
27 | 26 | alrimiv 1931 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦) |
28 | simpr 486 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ dom (𝑆 D 𝐹)) | |
29 | eldmg 5893 | . . . . . 6 ⊢ (𝐴 ∈ dom (𝑆 D 𝐹) → (𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) | |
30 | 28, 29 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
31 | 30 | notbid 318 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴 ∈ dom (𝑆 D 𝐹) ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
32 | alnex 1784 | . . . . . 6 ⊢ (∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦) | |
33 | 32 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
34 | 33 | bicomd 222 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦 ↔ ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦)) |
35 | 31, 34 | bitrd 279 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦)) |
36 | 27, 35 | mpbird 257 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝐴 ∈ dom (𝑆 D 𝐹)) |
37 | 36 | pm2.01da 798 | 1 ⊢ (𝜑 → ¬ 𝐴 ∈ dom (𝑆 D 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∀wal 1540 = wceq 1542 ∃wex 1782 ∈ wcel 2107 ∀wral 3062 ∃wrex 3071 ∖ cdif 3943 ⊆ wss 3946 ∅c0 4320 {csn 4624 class class class wbr 5144 ↦ cmpt 5227 dom cdm 5672 ⟶wf 6531 ‘cfv 6535 (class class class)co 7396 ℂcc 11095 < clt 11235 ≤ cle 11236 − cmin 11431 / cdiv 11858 ℝ+crp 12961 abscabs 15168 ↾t crest 17353 TopOpenctopn 17354 ℂfldccnfld 20918 intcnt 22490 limℂ climc 25348 D cdv 25349 |
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 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5281 ax-sep 5295 ax-nul 5302 ax-pow 5359 ax-pr 5423 ax-un 7712 ax-cnex 11153 ax-resscn 11154 ax-1cn 11155 ax-icn 11156 ax-addcl 11157 ax-addrcl 11158 ax-mulcl 11159 ax-mulrcl 11160 ax-mulcom 11161 ax-addass 11162 ax-mulass 11163 ax-distr 11164 ax-i2m1 11165 ax-1ne0 11166 ax-1rid 11167 ax-rnegex 11168 ax-rrecex 11169 ax-cnre 11170 ax-pre-lttri 11171 ax-pre-lttrn 11172 ax-pre-ltadd 11173 ax-pre-mulgt0 11174 ax-pre-sup 11175 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-nel 3048 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 df-sbc 3776 df-csb 3892 df-dif 3949 df-un 3951 df-in 3953 df-ss 3963 df-pss 3965 df-nul 4321 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4905 df-int 4947 df-iun 4995 df-br 5145 df-opab 5207 df-mpt 5228 df-tr 5262 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6292 df-ord 6359 df-on 6360 df-lim 6361 df-suc 6362 df-iota 6487 df-fun 6537 df-fn 6538 df-f 6539 df-f1 6540 df-fo 6541 df-f1o 6542 df-fv 6543 df-riota 7352 df-ov 7399 df-oprab 7400 df-mpo 7401 df-om 7843 df-1st 7962 df-2nd 7963 df-frecs 8253 df-wrecs 8284 df-recs 8358 df-rdg 8397 df-1o 8453 df-er 8691 df-map 8810 df-pm 8811 df-en 8928 df-dom 8929 df-sdom 8930 df-fin 8931 df-fi 9393 df-sup 9424 df-inf 9425 df-pnf 11237 df-mnf 11238 df-xr 11239 df-ltxr 11240 df-le 11241 df-sub 11433 df-neg 11434 df-div 11859 df-nn 12200 df-2 12262 df-3 12263 df-4 12264 df-5 12265 df-6 12266 df-7 12267 df-8 12268 df-9 12269 df-n0 12460 df-z 12546 df-dec 12665 df-uz 12810 df-q 12920 df-rp 12962 df-xneg 13079 df-xadd 13080 df-xmul 13081 df-fz 13472 df-seq 13954 df-exp 14015 df-cj 15033 df-re 15034 df-im 15035 df-sqrt 15169 df-abs 15170 df-struct 17067 df-slot 17102 df-ndx 17114 df-base 17132 df-plusg 17197 df-mulr 17198 df-starv 17199 df-tset 17203 df-ple 17204 df-ds 17206 df-unif 17207 df-rest 17355 df-topn 17356 df-topgen 17376 df-psmet 20910 df-xmet 20911 df-met 20912 df-bl 20913 df-mopn 20914 df-cnfld 20919 df-top 22365 df-topon 22382 df-topsp 22404 df-bases 22418 df-ntr 22493 df-cnp 22701 df-xms 23795 df-ms 23796 df-limc 25352 df-dv 25353 |
This theorem is referenced by: unbdqndv2 35292 |
Copyright terms: Public domain | W3C validator |