dvres3a - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dvres3a		Structured version Visualization version GIF version

Theorem dvres3a 24983

Description: Restriction of a complex differentiable function to the reals. This version of dvres3 24982 assumes that 𝐹 is differentiable on its domain, but does not require 𝐹 to be differentiable on the whole real line. (Contributed by Mario Carneiro, 11-Feb-2015.)

**Hypothesis**
Ref	Expression
dvres3a.j	⊢ 𝐽 = (TopOpen‘ℂ_fld)

**Assertion**
Ref	Expression
dvres3a	⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 D (𝐹 ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))

**Proof of Theorem dvres3a**
Step	Hyp	Ref	Expression
1		reldv 24939	. . 3 ⊢ Rel (𝑆 D (𝐹 ↾ 𝑆))
2		recnprss 24973	. . . . . 6 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
3	2	ad2antrr 722	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝑆 ⊆ ℂ)
4		simplr 765	. . . . . . 7 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐹:𝐴⟶ℂ)
5		inss2 4160	. . . . . . 7 ⊢ (𝑆 ∩ 𝐴) ⊆ 𝐴
6		fssres 6624	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℂ ∧ (𝑆 ∩ 𝐴) ⊆ 𝐴) → (𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ)
7	4, 5, 6	sylancl 585	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ)
8		rescom 5906	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑆) = ((𝐹 ↾ 𝑆) ↾ 𝐴)
9		resres 5893	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝑆) ↾ 𝐴) = (𝐹 ↾ (𝑆 ∩ 𝐴))
10	8, 9	eqtri 2766	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑆) = (𝐹 ↾ (𝑆 ∩ 𝐴))
11		ffn 6584	. . . . . . . . . 10 ⊢ (𝐹:𝐴⟶ℂ → 𝐹 Fn 𝐴)
12		fnresdm 6535	. . . . . . . . . 10 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
13	4, 11, 12	3syl 18	. . . . . . . . 9 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ 𝐴) = 𝐹)
14	13	reseq1d 5879	. . . . . . . 8 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝐹 ↾ 𝐴) ↾ 𝑆) = (𝐹 ↾ 𝑆))
15	10, 14	eqtr3id 2793	. . . . . . 7 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ (𝑆 ∩ 𝐴)) = (𝐹 ↾ 𝑆))
16	15	feq1d 6569	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ ↔ (𝐹 ↾ 𝑆):(𝑆 ∩ 𝐴)⟶ℂ))
17	7, 16	mpbid 231	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ 𝑆):(𝑆 ∩ 𝐴)⟶ℂ)
18		inss1 4159	. . . . . 6 ⊢ (𝑆 ∩ 𝐴) ⊆ 𝑆
19	18	a1i 11	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 ∩ 𝐴) ⊆ 𝑆)
20	3, 17, 19	dvbss 24970	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ (𝑆 ∩ 𝐴))
21		dmres 5902	. . . . 5 ⊢ dom ((ℂ D 𝐹) ↾ 𝑆) = (𝑆 ∩ dom (ℂ D 𝐹))
22		simprr 769	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (ℂ D 𝐹) = 𝐴)
23	22	ineq2d 4143	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 ∩ dom (ℂ D 𝐹)) = (𝑆 ∩ 𝐴))
24	21, 23	syl5eq 2791	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom ((ℂ D 𝐹) ↾ 𝑆) = (𝑆 ∩ 𝐴))
25	20, 24	sseqtrrd 3958	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ dom ((ℂ D 𝐹) ↾ 𝑆))
26		relssres 5921	. . 3 ⊢ ((Rel (𝑆 D (𝐹 ↾ 𝑆)) ∧ dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ dom ((ℂ D 𝐹) ↾ 𝑆)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = (𝑆 D (𝐹 ↾ 𝑆)))
27	1, 25, 26	sylancr 586	. 2 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = (𝑆 D (𝐹 ↾ 𝑆)))
28		dvfg 24975	. . . . 5 ⊢ (𝑆 ∈ {ℝ, ℂ} → (𝑆 D (𝐹 ↾ 𝑆)):dom (𝑆 D (𝐹 ↾ 𝑆))⟶ℂ)
29	28	ad2antrr 722	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 D (𝐹 ↾ 𝑆)):dom (𝑆 D (𝐹 ↾ 𝑆))⟶ℂ)
30	29	ffund 6588	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → Fun (𝑆 D (𝐹 ↾ 𝑆)))
31		ssidd 3940	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ℂ ⊆ ℂ)
32		dvres3a.j	. . . . . 6 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
33	32	cnfldtopon 23852	. . . . 5 ⊢ 𝐽 ∈ (TopOn‘ℂ)
34		simprl 767	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐴 ∈ 𝐽)
35		toponss 21984	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝐴 ∈ 𝐽) → 𝐴 ⊆ ℂ)
36	33, 34, 35	sylancr 586	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐴 ⊆ ℂ)
37		dvres2 24981	. . . 4 ⊢ (((ℂ ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ ℂ ∧ 𝑆 ⊆ ℂ)) → ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆)))
38	31, 4, 36, 3, 37	syl22anc 835	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆)))
39		funssres 6462	. . 3 ⊢ ((Fun (𝑆 D (𝐹 ↾ 𝑆)) ∧ ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆))) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))
40	30, 38, 39	syl2anc 583	. 2 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))
41	27, 40	eqtr3d 2780	1 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 D (𝐹 ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∩ cin 3882 ⊆ wss 3883 {cpr 4560 dom cdm 5580 ↾ cres 5582 Rel wrel 5585 Fun wfun 6412 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ℂcc 10800 ℝcr 10801 TopOpenctopn 17049 ℂ_fldccnfld 20510 TopOnctopon 21967 D cdv 24932

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-cnex 10858 ax-resscn 10859 ax-1cn 10860 ax-icn 10861 ax-addcl 10862 ax-addrcl 10863 ax-mulcl 10864 ax-mulrcl 10865 ax-mulcom 10866 ax-addass 10867 ax-mulass 10868 ax-distr 10869 ax-i2m1 10870 ax-1ne0 10871 ax-1rid 10872 ax-rnegex 10873 ax-rrecex 10874 ax-cnre 10875 ax-pre-lttri 10876 ax-pre-lttrn 10877 ax-pre-ltadd 10878 ax-pre-mulgt0 10879 ax-pre-sup 10880

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-nel 3049 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-pss 3902 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-tp 4563 df-op 4565 df-uni 4837 df-int 4877 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-tr 5188 df-id 5480 df-eprel 5486 df-po 5494 df-so 5495 df-fr 5535 df-we 5537 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-pred 6191 df-ord 6254 df-on 6255 df-lim 6256 df-suc 6257 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-om 7688 df-1st 7804 df-2nd 7805 df-frecs 8068 df-wrecs 8099 df-recs 8173 df-rdg 8212 df-1o 8267 df-er 8456 df-map 8575 df-pm 8576 df-en 8692 df-dom 8693 df-sdom 8694 df-fin 8695 df-fi 9100 df-sup 9131 df-inf 9132 df-pnf 10942 df-mnf 10943 df-xr 10944 df-ltxr 10945 df-le 10946 df-sub 11137 df-neg 11138 df-div 11563 df-nn 11904 df-2 11966 df-3 11967 df-4 11968 df-5 11969 df-6 11970 df-7 11971 df-8 11972 df-9 11973 df-n0 12164 df-z 12250 df-dec 12367 df-uz 12512 df-q 12618 df-rp 12660 df-xneg 12777 df-xadd 12778 df-xmul 12779 df-icc 13015 df-fz 13169 df-seq 13650 df-exp 13711 df-cj 14738 df-re 14739 df-im 14740 df-sqrt 14874 df-abs 14875 df-struct 16776 df-slot 16811 df-ndx 16823 df-base 16841 df-plusg 16901 df-mulr 16902 df-starv 16903 df-tset 16907 df-ple 16908 df-ds 16910 df-unif 16911 df-rest 17050 df-topn 17051 df-topgen 17071 df-psmet 20502 df-xmet 20503 df-met 20504 df-bl 20505 df-mopn 20506 df-fbas 20507 df-fg 20508 df-cnfld 20511 df-top 21951 df-topon 21968 df-topsp 21990 df-bases 22004 df-cld 22078 df-ntr 22079 df-cls 22080 df-nei 22157 df-lp 22195 df-perf 22196 df-cnp 22287 df-haus 22374 df-fil 22905 df-fm 22997 df-flim 22998 df-flf 22999 df-xms 23381 df-ms 23382 df-limc 24935 df-dv 24936

This theorem is referenced by: dvnres 25000 dvmptres3 25025

W3C validator