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 25894

Description: Restriction of a complex differentiable function to the reals. This version of dvres3 25893 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 25850	. . 3 ⊢ Rel (𝑆 D (𝐹 ↾ 𝑆))
2		recnprss 25884	. . . . . 6 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
3	2	ad2antrr 727	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝑆 ⊆ ℂ)
4		simplr 769	. . . . . . 7 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐹:𝐴⟶ℂ)
5		inss2 4179	. . . . . . 7 ⊢ (𝑆 ∩ 𝐴) ⊆ 𝐴
6		fssres 6701	. . . . . . 7 ⊢ ((𝐹:𝐴⟶ℂ ∧ (𝑆 ∩ 𝐴) ⊆ 𝐴) → (𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ)
7	4, 5, 6	sylancl 587	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ)
8		rescom 5962	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑆) = ((𝐹 ↾ 𝑆) ↾ 𝐴)
9		resres 5952	. . . . . . . . 9 ⊢ ((𝐹 ↾ 𝑆) ↾ 𝐴) = (𝐹 ↾ (𝑆 ∩ 𝐴))
10	8, 9	eqtri 2760	. . . . . . . 8 ⊢ ((𝐹 ↾ 𝐴) ↾ 𝑆) = (𝐹 ↾ (𝑆 ∩ 𝐴))
11		ffn 6663	. . . . . . . . . 10 ⊢ (𝐹:𝐴⟶ℂ → 𝐹 Fn 𝐴)
12		fnresdm 6612	. . . . . . . . . 10 ⊢ (𝐹 Fn 𝐴 → (𝐹 ↾ 𝐴) = 𝐹)
13	4, 11, 12	3syl 18	. . . . . . . . 9 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ 𝐴) = 𝐹)
14	13	reseq1d 5938	. . . . . . . 8 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝐹 ↾ 𝐴) ↾ 𝑆) = (𝐹 ↾ 𝑆))
15	10, 14	eqtr3id 2786	. . . . . . 7 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ (𝑆 ∩ 𝐴)) = (𝐹 ↾ 𝑆))
16	15	feq1d 6645	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝐹 ↾ (𝑆 ∩ 𝐴)):(𝑆 ∩ 𝐴)⟶ℂ ↔ (𝐹 ↾ 𝑆):(𝑆 ∩ 𝐴)⟶ℂ))
17	7, 16	mpbid 232	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝐹 ↾ 𝑆):(𝑆 ∩ 𝐴)⟶ℂ)
18		inss1 4178	. . . . . 6 ⊢ (𝑆 ∩ 𝐴) ⊆ 𝑆
19	18	a1i 11	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 ∩ 𝐴) ⊆ 𝑆)
20	3, 17, 19	dvbss 25881	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ (𝑆 ∩ 𝐴))
21		dmres 5972	. . . . 5 ⊢ dom ((ℂ D 𝐹) ↾ 𝑆) = (𝑆 ∩ dom (ℂ D 𝐹))
22		simprr 773	. . . . . 6 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (ℂ D 𝐹) = 𝐴)
23	22	ineq2d 4161	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 ∩ dom (ℂ D 𝐹)) = (𝑆 ∩ 𝐴))
24	21, 23	eqtrid 2784	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom ((ℂ D 𝐹) ↾ 𝑆) = (𝑆 ∩ 𝐴))
25	20, 24	sseqtrrd 3960	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ dom ((ℂ D 𝐹) ↾ 𝑆))
26		relssres 5982	. . 3 ⊢ ((Rel (𝑆 D (𝐹 ↾ 𝑆)) ∧ dom (𝑆 D (𝐹 ↾ 𝑆)) ⊆ dom ((ℂ D 𝐹) ↾ 𝑆)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = (𝑆 D (𝐹 ↾ 𝑆)))
27	1, 25, 26	sylancr 588	. 2 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = (𝑆 D (𝐹 ↾ 𝑆)))
28		dvfg 25886	. . . . 5 ⊢ (𝑆 ∈ {ℝ, ℂ} → (𝑆 D (𝐹 ↾ 𝑆)):dom (𝑆 D (𝐹 ↾ 𝑆))⟶ℂ)
29	28	ad2antrr 727	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 D (𝐹 ↾ 𝑆)):dom (𝑆 D (𝐹 ↾ 𝑆))⟶ℂ)
30	29	ffund 6667	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → Fun (𝑆 D (𝐹 ↾ 𝑆)))
31		ssidd 3946	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ℂ ⊆ ℂ)
32		dvres3a.j	. . . . . 6 ⊢ 𝐽 = (TopOpen‘ℂ_fld)
33	32	cnfldtopon 24760	. . . . 5 ⊢ 𝐽 ∈ (TopOn‘ℂ)
34		simprl 771	. . . . 5 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐴 ∈ 𝐽)
35		toponss 22905	. . . . 5 ⊢ ((𝐽 ∈ (TopOn‘ℂ) ∧ 𝐴 ∈ 𝐽) → 𝐴 ⊆ ℂ)
36	33, 34, 35	sylancr 588	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → 𝐴 ⊆ ℂ)
37		dvres2 25892	. . . 4 ⊢ (((ℂ ⊆ ℂ ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ⊆ ℂ ∧ 𝑆 ⊆ ℂ)) → ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆)))
38	31, 4, 36, 3, 37	syl22anc 839	. . 3 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆)))
39		funssres 6537	. . 3 ⊢ ((Fun (𝑆 D (𝐹 ↾ 𝑆)) ∧ ((ℂ D 𝐹) ↾ 𝑆) ⊆ (𝑆 D (𝐹 ↾ 𝑆))) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))
40	30, 38, 39	syl2anc 585	. 2 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → ((𝑆 D (𝐹 ↾ 𝑆)) ↾ dom ((ℂ D 𝐹) ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))
41	27, 40	eqtr3d 2774	1 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹:𝐴⟶ℂ) ∧ (𝐴 ∈ 𝐽 ∧ dom (ℂ D 𝐹) = 𝐴)) → (𝑆 D (𝐹 ↾ 𝑆)) = ((ℂ D 𝐹) ↾ 𝑆))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∩ cin 3889 ⊆ wss 3890 {cpr 4570 dom cdm 5625 ↾ cres 5627 Rel wrel 5630 Fun wfun 6487 Fn wfn 6488 ⟶wf 6489 ‘cfv 6493 (class class class)co 7361 ℂcc 11030 ℝcr 11031 TopOpenctopn 17378 ℂ_fldccnfld 21347 TopOnctopon 22888 D cdv 25843

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5213 ax-sep 5232 ax-nul 5242 ax-pow 5303 ax-pr 5371 ax-un 7683 ax-cnex 11088 ax-resscn 11089 ax-1cn 11090 ax-icn 11091 ax-addcl 11092 ax-addrcl 11093 ax-mulcl 11094 ax-mulrcl 11095 ax-mulcom 11096 ax-addass 11097 ax-mulass 11098 ax-distr 11099 ax-i2m1 11100 ax-1ne0 11101 ax-1rid 11102 ax-rnegex 11103 ax-rrecex 11104 ax-cnre 11105 ax-pre-lttri 11106 ax-pre-lttrn 11107 ax-pre-ltadd 11108 ax-pre-mulgt0 11109 ax-pre-sup 11110

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-pss 3910 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-tp 4573 df-op 4575 df-uni 4852 df-int 4891 df-iun 4936 df-iin 4937 df-br 5087 df-opab 5149 df-mpt 5168 df-tr 5194 df-id 5520 df-eprel 5525 df-po 5533 df-so 5534 df-fr 5578 df-we 5580 df-xp 5631 df-rel 5632 df-cnv 5633 df-co 5634 df-dm 5635 df-rn 5636 df-res 5637 df-ima 5638 df-pred 6260 df-ord 6321 df-on 6322 df-lim 6323 df-suc 6324 df-iota 6449 df-fun 6495 df-fn 6496 df-f 6497 df-f1 6498 df-fo 6499 df-f1o 6500 df-fv 6501 df-riota 7318 df-ov 7364 df-oprab 7365 df-mpo 7366 df-om 7812 df-1st 7936 df-2nd 7937 df-frecs 8225 df-wrecs 8256 df-recs 8305 df-rdg 8343 df-1o 8399 df-er 8637 df-map 8769 df-pm 8770 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fi 9318 df-sup 9349 df-inf 9350 df-pnf 11175 df-mnf 11176 df-xr 11177 df-ltxr 11178 df-le 11179 df-sub 11373 df-neg 11374 df-div 11802 df-nn 12169 df-2 12238 df-3 12239 df-4 12240 df-5 12241 df-6 12242 df-7 12243 df-8 12244 df-9 12245 df-n0 12432 df-z 12519 df-dec 12639 df-uz 12783 df-q 12893 df-rp 12937 df-xneg 13057 df-xadd 13058 df-xmul 13059 df-icc 13299 df-fz 13456 df-seq 13958 df-exp 14018 df-cj 15055 df-re 15056 df-im 15057 df-sqrt 15191 df-abs 15192 df-struct 17111 df-slot 17146 df-ndx 17158 df-base 17174 df-plusg 17227 df-mulr 17228 df-starv 17229 df-tset 17233 df-ple 17234 df-ds 17236 df-unif 17237 df-rest 17379 df-topn 17380 df-topgen 17400 df-psmet 21339 df-xmet 21340 df-met 21341 df-bl 21342 df-mopn 21343 df-fbas 21344 df-fg 21345 df-cnfld 21348 df-top 22872 df-topon 22889 df-topsp 22911 df-bases 22924 df-cld 22997 df-ntr 22998 df-cls 22999 df-nei 23076 df-lp 23114 df-perf 23115 df-cnp 23206 df-haus 23293 df-fil 23824 df-fm 23916 df-flim 23917 df-flf 23918 df-xms 24298 df-ms 24299 df-limc 25846 df-dv 25847

This theorem is referenced by: dvnres 25911 dvmptres3 25936

W3C validator