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 4295 | . . . . . . . 8 ⊢ ¬ 𝑦 ∈ ∅ | |
2 | 1 | a1i 11 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝑦 ∈ ∅) |
3 | unbdqndv1.2 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑋 ⊆ 𝑆) | |
4 | unbdqndv1.1 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝑆 ⊆ ℂ) | |
5 | 3, 4 | sstrd 3976 | . . . . . . . . . 10 ⊢ (𝜑 → 𝑋 ⊆ ℂ) |
6 | 5 | adantr 483 | . . . . . . . . 9 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝑋 ⊆ ℂ) |
7 | 6 | ssdifssd 4118 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝑋 ∖ {𝐴}) ⊆ ℂ) |
8 | unbdqndv1.3 | . . . . . . . . . . 11 ⊢ (𝜑 → 𝐹:𝑋⟶ℂ) | |
9 | 8 | adantr 483 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐹:𝑋⟶ℂ) |
10 | 4, 8, 3 | dvbss 24493 | . . . . . . . . . . 11 ⊢ (𝜑 → dom (𝑆 D 𝐹) ⊆ 𝑋) |
11 | 10 | sselda 3966 | . . . . . . . . . 10 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ 𝑋) |
12 | 9, 6, 11 | dvlem 24488 | . . . . . . . . 9 ⊢ (((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) ∧ 𝑧 ∈ (𝑋 ∖ {𝐴})) → (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴)) ∈ ℂ) |
13 | unbdqndv1.g | . . . . . . . . 9 ⊢ 𝐺 = (𝑧 ∈ (𝑋 ∖ {𝐴}) ↦ (((𝐹‘𝑧) − (𝐹‘𝐴)) / (𝑧 − 𝐴))) | |
14 | 12, 13 | fmptd 6872 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐺:(𝑋 ∖ {𝐴})⟶ℂ) |
15 | 6, 11 | sseldd 3967 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ ℂ) |
16 | unbdqndv1.4 | . . . . . . . . 9 ⊢ (𝜑 → ∀𝑏 ∈ ℝ+ ∀𝑑 ∈ ℝ+ ∃𝑥 ∈ (𝑋 ∖ {𝐴})((abs‘(𝑥 − 𝐴)) < 𝑑 ∧ 𝑏 ≤ (abs‘(𝐺‘𝑥)))) | |
17 | 16 | adantr 483 | . . . . . . . 8 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ∀𝑏 ∈ ℝ+ ∀𝑑 ∈ ℝ+ ∃𝑥 ∈ (𝑋 ∖ {𝐴})((abs‘(𝑥 − 𝐴)) < 𝑑 ∧ 𝑏 ≤ (abs‘(𝐺‘𝑥)))) |
18 | 7, 14, 15, 17 | unblimceq0 33841 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝐺 limℂ 𝐴) = ∅) |
19 | 2, 18 | neleqtrrd 2935 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝑦 ∈ (𝐺 limℂ 𝐴)) |
20 | 19 | intnand 491 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴))) |
21 | eqid 2821 | . . . . . . . 8 ⊢ ((TopOpen‘ℂfld) ↾t 𝑆) = ((TopOpen‘ℂfld) ↾t 𝑆) | |
22 | eqid 2821 | . . . . . . . 8 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
23 | 21, 22, 13, 4, 8, 3 | eldv 24490 | . . . . . . 7 ⊢ (𝜑 → (𝐴(𝑆 D 𝐹)𝑦 ↔ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
24 | 23 | notbid 320 | . . . . . 6 ⊢ (𝜑 → (¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
25 | 24 | adantr 483 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ (𝐴 ∈ ((int‘((TopOpen‘ℂfld) ↾t 𝑆))‘𝑋) ∧ 𝑦 ∈ (𝐺 limℂ 𝐴)))) |
26 | 20, 25 | mpbird 259 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝐴(𝑆 D 𝐹)𝑦) |
27 | 26 | alrimiv 1924 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦) |
28 | simpr 487 | . . . . . 6 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → 𝐴 ∈ dom (𝑆 D 𝐹)) | |
29 | eldmg 5761 | . . . . . 6 ⊢ (𝐴 ∈ dom (𝑆 D 𝐹) → (𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) | |
30 | 28, 29 | syl 17 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
31 | 30 | notbid 320 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴 ∈ dom (𝑆 D 𝐹) ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
32 | alnex 1778 | . . . . . 6 ⊢ (∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦) | |
33 | 32 | a1i 11 | . . . . 5 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦 ↔ ¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦)) |
34 | 33 | bicomd 225 | . . . 4 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ ∃𝑦 𝐴(𝑆 D 𝐹)𝑦 ↔ ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦)) |
35 | 31, 34 | bitrd 281 | . . 3 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → (¬ 𝐴 ∈ dom (𝑆 D 𝐹) ↔ ∀𝑦 ¬ 𝐴(𝑆 D 𝐹)𝑦)) |
36 | 27, 35 | mpbird 259 | . 2 ⊢ ((𝜑 ∧ 𝐴 ∈ dom (𝑆 D 𝐹)) → ¬ 𝐴 ∈ dom (𝑆 D 𝐹)) |
37 | 36 | pm2.01da 797 | 1 ⊢ (𝜑 → ¬ 𝐴 ∈ dom (𝑆 D 𝐹)) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 ∀wal 1531 = wceq 1533 ∃wex 1776 ∈ wcel 2110 ∀wral 3138 ∃wrex 3139 ∖ cdif 3932 ⊆ wss 3935 ∅c0 4290 {csn 4560 class class class wbr 5058 ↦ cmpt 5138 dom cdm 5549 ⟶wf 6345 ‘cfv 6349 (class class class)co 7150 ℂcc 10529 < clt 10669 ≤ cle 10670 − cmin 10864 / cdiv 11291 ℝ+crp 12383 abscabs 14587 ↾t crest 16688 TopOpenctopn 16689 ℂfldccnfld 20539 intcnt 21619 limℂ climc 24454 D cdv 24455 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-rep 5182 ax-sep 5195 ax-nul 5202 ax-pow 5258 ax-pr 5321 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 ax-pre-sup 10609 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3772 df-csb 3883 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-pss 3953 df-nul 4291 df-if 4467 df-pw 4540 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-int 4869 df-iun 4913 df-br 5059 df-opab 5121 df-mpt 5139 df-tr 5165 df-id 5454 df-eprel 5459 df-po 5468 df-so 5469 df-fr 5508 df-we 5510 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-rn 5560 df-res 5561 df-ima 5562 df-pred 6142 df-ord 6188 df-on 6189 df-lim 6190 df-suc 6191 df-iota 6308 df-fun 6351 df-fn 6352 df-f 6353 df-f1 6354 df-fo 6355 df-f1o 6356 df-fv 6357 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-1st 7683 df-2nd 7684 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-1o 8096 df-oadd 8100 df-er 8283 df-map 8402 df-pm 8403 df-en 8504 df-dom 8505 df-sdom 8506 df-fin 8507 df-fi 8869 df-sup 8900 df-inf 8901 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-div 11292 df-nn 11633 df-2 11694 df-3 11695 df-4 11696 df-5 11697 df-6 11698 df-7 11699 df-8 11700 df-9 11701 df-n0 11892 df-z 11976 df-dec 12093 df-uz 12238 df-q 12343 df-rp 12384 df-xneg 12501 df-xadd 12502 df-xmul 12503 df-fz 12887 df-seq 13364 df-exp 13424 df-cj 14452 df-re 14453 df-im 14454 df-sqrt 14588 df-abs 14589 df-struct 16479 df-ndx 16480 df-slot 16481 df-base 16483 df-plusg 16572 df-mulr 16573 df-starv 16574 df-tset 16578 df-ple 16579 df-ds 16581 df-unif 16582 df-rest 16690 df-topn 16691 df-topgen 16711 df-psmet 20531 df-xmet 20532 df-met 20533 df-bl 20534 df-mopn 20535 df-cnfld 20540 df-top 21496 df-topon 21513 df-topsp 21535 df-bases 21548 df-ntr 21622 df-cnp 21830 df-xms 22924 df-ms 22925 df-limc 24458 df-dv 24459 |
This theorem is referenced by: unbdqndv2 33845 |
Copyright terms: Public domain | W3C validator |