| 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 26286, 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 6012 | . . 3 ⊢ Rel ((𝑆 D 𝐹) ↾ 𝐵) | |
| 2 | 1 | a1i 11 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → Rel ((𝑆 D 𝐹) ↾ 𝐵)) |
| 3 | eqid 2763 | . . . . 5 ⊢ (TopOpen‘ℂfld) = (TopOpen‘ℂfld) | |
| 4 | eqid 2763 | . . . . 5 ⊢ ((TopOpen‘ℂfld) ↾t 𝑆) = ((TopOpen‘ℂfld) ↾t 𝑆) | |
| 5 | eqid 2763 | . . . . 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 26274 | . . . . . 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 26285 | . . . 4 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆) ∧ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) → 𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦) |
| 15 | 14 | 3expia 1139 | . . 3 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → ((𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦) → 𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦)) |
| 16 | vex 3458 | . . . . 5 ⊢ 𝑦 ∈ V | |
| 17 | 16 | brresi 5995 | . . . 4 ⊢ (𝑥((𝑆 D 𝐹) ↾ 𝐵)𝑦 ↔ (𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦)) |
| 18 | df-br 5109 | . . . 4 ⊢ (𝑥((𝑆 D 𝐹) ↾ 𝐵)𝑦 ↔ 〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵)) | |
| 19 | 17, 18 | bitr3i 280 | . . 3 ⊢ ((𝑥 ∈ 𝐵 ∧ 𝑥(𝑆 D 𝐹)𝑦) ↔ 〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵)) |
| 20 | df-br 5109 | . . 3 ⊢ (𝑥(𝐵 D (𝐹 ↾ 𝐵))𝑦 ↔ 〈𝑥, 𝑦〉 ∈ (𝐵 D (𝐹 ↾ 𝐵))) | |
| 21 | 15, 19, 20 | 3imtr3g 298 | . 2 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → (〈𝑥, 𝑦〉 ∈ ((𝑆 D 𝐹) ↾ 𝐵) → 〈𝑥, 𝑦〉 ∈ (𝐵 D (𝐹 ↾ 𝐵)))) |
| 22 | 2, 21 | relssdv 5773 | 1 ⊢ (((𝑆 ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ 𝑆 ∧ 𝐵 ⊆ 𝑆)) → ((𝑆 D 𝐹) ↾ 𝐵) ⊆ (𝐵 D (𝐹 ↾ 𝐵))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2147 ⊆ wss 3900 ∖ cdif 4048 {csn 4588 〈cop 4840 class class class wbr 5108 ↦ cmpt 5192 ↾ cres 5660 Rel wrel 5663 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ℂcc 11237 − cmin 11580 / cdiv 12013 ↾t crest 17641 TopOpenctopn 17642 ℂfldccnfld 21729 D cdv 26238 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-tp 4593 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-iin 4959 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-fi 9440 df-sup 9471 df-inf 9472 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-4 12447 df-5 12448 df-6 12449 df-7 12450 df-8 12451 df-9 12452 df-n0 12647 df-z 12734 df-dec 12855 df-uz 13006 df-q 13116 df-rp 13161 df-xneg 13281 df-xadd 13282 df-xmul 13283 df-fz 13680 df-seq 14185 df-exp 14245 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-struct 17369 df-slot 17404 df-ndx 17416 df-base 17432 df-plusg 17486 df-mulr 17487 df-starv 17488 df-tset 17492 df-ple 17493 df-ds 17495 df-unif 17496 df-euf 17499 df-rest 17643 df-topn 17644 df-topgen 17664 df-psmet 21721 df-xmet 21722 df-met 21723 df-bl 21724 df-mopn 21725 df-cnfld 21730 df-top 23267 df-topon 23284 df-topsp 23306 df-bases 23319 df-cld 23392 df-ntr 23393 df-cls 23394 df-cnp 23601 df-xms 24694 df-ms 24695 df-limc 26241 df-dv 26242 |
| This theorem is used by: dvres3 26288 dvres3a 26289 |
| Copyright terms: Public domain | W3C validator |