Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > dvcn | GIF version |
Description: A differentiable function is continuous. (Contributed by Mario Carneiro, 7-Sep-2014.) (Revised by Mario Carneiro, 7-Sep-2015.) |
Ref | Expression |
---|---|
dvcn | ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐹 ∈ (𝐴–cn→ℂ)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpl2 986 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐹:𝐴⟶ℂ) | |
2 | eqid 2157 | . . . . . 6 ⊢ ((MetOpen‘(abs ∘ − )) ↾t 𝐴) = ((MetOpen‘(abs ∘ − )) ↾t 𝐴) | |
3 | eqid 2157 | . . . . . 6 ⊢ (MetOpen‘(abs ∘ − )) = (MetOpen‘(abs ∘ − )) | |
4 | 2, 3 | dvcnp2cntop 13023 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ 𝑥 ∈ dom (𝑆 D 𝐹)) → 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)) |
5 | 4 | ralrimiva 2530 | . . . 4 ⊢ ((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) → ∀𝑥 ∈ dom (𝑆 D 𝐹)𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)) |
6 | raleq 2652 | . . . . 5 ⊢ (dom (𝑆 D 𝐹) = 𝐴 → (∀𝑥 ∈ dom (𝑆 D 𝐹)𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥) ↔ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥))) | |
7 | 6 | biimpd 143 | . . . 4 ⊢ (dom (𝑆 D 𝐹) = 𝐴 → (∀𝑥 ∈ dom (𝑆 D 𝐹)𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥) → ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥))) |
8 | 5, 7 | mpan9 279 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)) |
9 | 3 | cntoptopon 12892 | . . . . 5 ⊢ (MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ) |
10 | simpl3 987 | . . . . . 6 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐴 ⊆ 𝑆) | |
11 | simpl1 985 | . . . . . 6 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝑆 ⊆ ℂ) | |
12 | 10, 11 | sstrd 3138 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐴 ⊆ ℂ) |
13 | resttopon 12531 | . . . . 5 ⊢ (((MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ) ∧ 𝐴 ⊆ ℂ) → ((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴)) | |
14 | 9, 12, 13 | sylancr 411 | . . . 4 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → ((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴)) |
15 | cncnp 12590 | . . . 4 ⊢ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) ∈ (TopOn‘𝐴) ∧ (MetOpen‘(abs ∘ − )) ∈ (TopOn‘ℂ)) → (𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − ))) ↔ (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)))) | |
16 | 14, 9, 15 | sylancl 410 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → (𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − ))) ↔ (𝐹:𝐴⟶ℂ ∧ ∀𝑥 ∈ 𝐴 𝐹 ∈ ((((MetOpen‘(abs ∘ − )) ↾t 𝐴) CnP (MetOpen‘(abs ∘ − )))‘𝑥)))) |
17 | 1, 8, 16 | mpbir2and 929 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐹 ∈ (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − )))) |
18 | ssid 3148 | . . 3 ⊢ ℂ ⊆ ℂ | |
19 | 9 | toponrestid 12379 | . . . 4 ⊢ (MetOpen‘(abs ∘ − )) = ((MetOpen‘(abs ∘ − )) ↾t ℂ) |
20 | 3, 2, 19 | cncfcncntop 12940 | . . 3 ⊢ ((𝐴 ⊆ ℂ ∧ ℂ ⊆ ℂ) → (𝐴–cn→ℂ) = (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − )))) |
21 | 12, 18, 20 | sylancl 410 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → (𝐴–cn→ℂ) = (((MetOpen‘(abs ∘ − )) ↾t 𝐴) Cn (MetOpen‘(abs ∘ − )))) |
22 | 17, 21 | eleqtrrd 2237 | 1 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ ∧ 𝐴 ⊆ 𝑆) ∧ dom (𝑆 D 𝐹) = 𝐴) → 𝐹 ∈ (𝐴–cn→ℂ)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ↔ wb 104 ∧ w3a 963 = wceq 1335 ∈ wcel 2128 ∀wral 2435 ⊆ wss 3102 dom cdm 4583 ∘ ccom 4587 ⟶wf 5163 ‘cfv 5167 (class class class)co 5818 ℂcc 7713 − cmin 8029 abscabs 10879 ↾t crest 12311 MetOpencmopn 12345 TopOnctopon 12368 Cn ccn 12545 CnP ccnp 12546 –cn→ccncf 12917 D cdv 12984 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-in1 604 ax-in2 605 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-13 2130 ax-14 2131 ax-ext 2139 ax-coll 4079 ax-sep 4082 ax-nul 4090 ax-pow 4134 ax-pr 4168 ax-un 4392 ax-setind 4494 ax-iinf 4545 ax-cnex 7806 ax-resscn 7807 ax-1cn 7808 ax-1re 7809 ax-icn 7810 ax-addcl 7811 ax-addrcl 7812 ax-mulcl 7813 ax-mulrcl 7814 ax-addcom 7815 ax-mulcom 7816 ax-addass 7817 ax-mulass 7818 ax-distr 7819 ax-i2m1 7820 ax-0lt1 7821 ax-1rid 7822 ax-0id 7823 ax-rnegex 7824 ax-precex 7825 ax-cnre 7826 ax-pre-ltirr 7827 ax-pre-ltwlin 7828 ax-pre-lttrn 7829 ax-pre-apti 7830 ax-pre-ltadd 7831 ax-pre-mulgt0 7832 ax-pre-mulext 7833 ax-arch 7834 ax-caucvg 7835 ax-addf 7837 ax-mulf 7838 |
This theorem depends on definitions: df-bi 116 df-stab 817 df-dc 821 df-3or 964 df-3an 965 df-tru 1338 df-fal 1341 df-nf 1441 df-sb 1743 df-eu 2009 df-mo 2010 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ne 2328 df-nel 2423 df-ral 2440 df-rex 2441 df-reu 2442 df-rmo 2443 df-rab 2444 df-v 2714 df-sbc 2938 df-csb 3032 df-dif 3104 df-un 3106 df-in 3108 df-ss 3115 df-nul 3395 df-if 3506 df-pw 3545 df-sn 3566 df-pr 3567 df-op 3569 df-uni 3773 df-int 3808 df-iun 3851 df-br 3966 df-opab 4026 df-mpt 4027 df-tr 4063 df-id 4252 df-po 4255 df-iso 4256 df-iord 4325 df-on 4327 df-ilim 4328 df-suc 4330 df-iom 4548 df-xp 4589 df-rel 4590 df-cnv 4591 df-co 4592 df-dm 4593 df-rn 4594 df-res 4595 df-ima 4596 df-iota 5132 df-fun 5169 df-fn 5170 df-f 5171 df-f1 5172 df-fo 5173 df-f1o 5174 df-fv 5175 df-isom 5176 df-riota 5774 df-ov 5821 df-oprab 5822 df-mpo 5823 df-1st 6082 df-2nd 6083 df-recs 6246 df-frec 6332 df-map 6588 df-pm 6589 df-sup 6920 df-inf 6921 df-pnf 7897 df-mnf 7898 df-xr 7899 df-ltxr 7900 df-le 7901 df-sub 8031 df-neg 8032 df-reap 8433 df-ap 8440 df-div 8529 df-inn 8817 df-2 8875 df-3 8876 df-4 8877 df-n0 9074 df-z 9151 df-uz 9423 df-q 9511 df-rp 9543 df-xneg 9661 df-xadd 9662 df-seqfrec 10327 df-exp 10401 df-cj 10724 df-re 10725 df-im 10726 df-rsqrt 10880 df-abs 10881 df-rest 12313 df-topgen 12332 df-psmet 12347 df-xmet 12348 df-met 12349 df-bl 12350 df-mopn 12351 df-top 12356 df-topon 12369 df-bases 12401 df-ntr 12456 df-cn 12548 df-cnp 12549 df-tx 12613 df-cncf 12918 df-limced 12985 df-dvap 12986 |
This theorem is referenced by: efcn 13049 |
Copyright terms: Public domain | W3C validator |