| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dvres2 | Structured version Visualization version GIF version | ||
| Description: Restriction of the base set of a derivative. The primary application of this theorem says that if a function is complex-differentiable then it is also real-differentiable. Unlike dvres 26231, there is no simple reverse relation relating real-differentiable functions to complex differentiability, and indeed there are functions like ℜ(𝑥) which are everywhere real-differentiable but nowhere complex-differentiable.) (Contributed by Mario Carneiro, 9-Feb-2015.) |
| Ref | Expression |
|---|---|
| dvres2 | ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → ((𝑆 D 𝐹) ↾ 𝐵) ⊆ (𝐵 D (𝐹 ↾ 𝐵))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | relres 5996 | . . 3 ⊢ Rel ((𝑆 D 𝐹) ↾ 𝐵) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → Rel ((𝑆 D 𝐹) ↾ 𝐵)) |
| 3 | eqid 2761 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 4 | eqid 2761 | . . . . 5 ⊢ ((TopOpen‘ℂfld) ↾t 𝑆) = ((TopOpen‘ℂfld) ↾t 𝑆) | |
| 5 | eqid 2761 | . . . . 5 ⊢ (𝑧 ∈ (𝐴 ∖ {𝑥}) ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) = (𝑧 ∈ (𝐴 ∖ {𝑥}) ↦ (((𝐹‘𝑧) − (𝐹‘𝑥)) / (𝑧 − 𝑥))) | |
| 6 | simp1l 1216 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑆 ⊆ ℂ) | |
| 7 | simp1r 1217 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝐹:𝐴⟶ℂ) | |
| 8 | simp2l 1218 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝐴 ⊆ 𝑆) | |
| 9 | simp2r 1219 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝐵 ⊆ 𝑆) | |
| 10 | simp3r 1221 | . . . . . 6 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑥(𝑆 D 𝐹)𝑦) | |
| 11 | 6, 7, 8 | dvcl 26219 | . . . . . 6 ⊢ ((((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) ∧ 𝑥(𝑆 D 𝐹)𝑦) → 𝑦 ∈ ℂ) |
| 12 | 10, 11 | mpdan 700 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑦 ∈ ℂ) |
| 13 | simp3l 1220 | . . . . 5 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑥 ∈ 𝐵) | |
| 14 | 3, 4, 5, 6, 7, 8, 9, 12, 10, 13 | dvres2lem 26230 | . . . 4 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦) |
| 15 | 14 | 3expia 1139 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → ((𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦) → 𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦)) |
| 16 | vex 3455 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 17 | 16 | brresi 5979 | . . . 4 ⊢ (𝑥((𝑆 D 𝐹) ↾ 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) |
| 18 | df-br 5104 | . . . 4 ⊢ (𝑥((𝑆 D 𝐹) ↾ 𝐵)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵)) | |
| 19 | 17, 18 | bitr3i 280 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦) ↔ 〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵)) |
| 20 | df-br 5104 | . . 3 ⊢ (𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (𝐵 D (𝐹 ↾ 𝐵))) | |
| 21 | 15, 19, 20 | 3imtr3g 298 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → (〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 D (𝐹 ↾ 𝐵)))) |
| 22 | 2, 21 | relssdv 5764 | 1 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → ((𝑆 D 𝐹) ↾ 𝐵) ⊆ (𝐵 D (𝐹 ↾ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2145 ∖ cdif 3896 ⊆ wss 3899 {csn 4584 〈cop 4590 class class class wbr 5103 ↦ cmpt 5186 ↾ cres 5653 Rel wrel 5656 ⟶wf 6534 ‘cfv 6538 (class class class)co 7420 ℂcc 11198 − cmin 11541 / cdiv 11973 ↾t crest 17591 TopOpenctopn 17592 ℂfldccnfld 21678 D cdv 26183 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7751 ax-cnex 11256 ax-resscn 11257 ax-1cn 11258 ax-icn 11259 ax-addcl 11260 ax-addrcl 11261 ax-mulcl 11262 ax-mulrcl 11263 ax-mulcom 11264 ax-addass 11265 ax-mulass 11266 ax-distr 11267 ax-i2m1 11268 ax-1ne0 11269 ax-1rid 11270 ax-rnegex 11271 ax-rrecex 11272 ax-cnre 11273 ax-pre-lttri 11274 ax-pre-lttrn 11275 ax-pre-ltadd 11276 ax-pre-mulgt0 11277 ax-pre-sup 11278 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3063 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-iin 4954 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7878 df-1st 8001 df-2nd 8002 df-frecs 8299 df-wrecs 8330 df-recs 8379 df-rdg 8418 df-1o 8476 df-er 8717 df-map 8849 df-pm 8850 df-en 8974 df-dom 8975 df-sdom 8976 df-fin 8977 df-fi 9403 df-sup 9434 df-inf 9435 df-pnf 11345 df-mnf 11346 df-xr 11347 df-ltxr 11348 df-le 11349 df-sub 11543 df-neg 11544 df-div 11974 df-nn 12336 df-2 12405 df-3 12406 df-4 12407 df-5 12408 df-6 12409 df-7 12410 df-8 12411 df-9 12412 df-n0 12607 df-z 12694 df-dec 12815 df-uz 12966 df-q 13076 df-rp 13121 df-xneg 13241 df-xadd 13242 df-xmul 13243 df-fz 13640 df-seq 14145 df-exp 14205 df-cj 15266 df-re 15267 df-im 15268 df-sqrt 15402 df-abs 15403 df-struct 17325 df-slot 17360 df-ndx 17372 df-base 17388 df-plusg 17441 df-mulr 17442 df-starv 17443 df-tset 17447 df-ple 17448 df-ds 17450 df-unif 17451 df-rest 17593 df-topn 17594 df-topgen 17614 df-psmet 21670 df-xmet 21671 df-met 21672 df-bl 21673 df-mopn 21674 df-cnfld 21679 df-top 23212 df-topon 23229 df-topsp 23251 df-bases 23264 df-cld 23337 df-ntr 23338 df-cls 23339 df-cnp 23546 df-xms 24639 df-ms 24640 df-limc 26186 df-dv 26187 |
| This theorem is used by: dvres3 26233 dvres3a 26234 |
| Copyright terms: Public domain | W3C validator |