cpnres - Metamath Proof Explorer

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

Theorem cpnres 25006

Description: The restriction of a 𝓑C^𝑛 function is 𝓑C^𝑛. (Contributed by Mario Carneiro, 11-Feb-2015.)

**Assertion**
Ref	Expression
cpnres	⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁))

**Proof of Theorem cpnres**
Step	Hyp	Ref	Expression
1		simpr 484	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁))
2		ssid 3939	. . . . . 6 ⊢ ℂ ⊆ ℂ
3		elfvdm 6788	. . . . . . . 8 ⊢ (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) → 𝑁 ∈ dom (𝓑C^𝑛‘ℂ))
4	3	adantl 481	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑁 ∈ dom (𝓑C^𝑛‘ℂ))
5		fncpn 25002	. . . . . . . . 9 ⊢ (ℂ ⊆ ℂ → (𝓑C^𝑛‘ℂ) Fn ℕ₀)
6	2, 5	ax-mp 5	. . . . . . . 8 ⊢ (𝓑C^𝑛‘ℂ) Fn ℕ₀
7		fndm 6520	. . . . . . . 8 ⊢ ((𝓑C^𝑛‘ℂ) Fn ℕ₀ → dom (𝓑C^𝑛‘ℂ) = ℕ₀)
8	6, 7	mp1i 13	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → dom (𝓑C^𝑛‘ℂ) = ℕ₀)
9	4, 8	eleqtrd 2841	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑁 ∈ ℕ₀)
10		elcpn 25003	. . . . . 6 ⊢ ((ℂ ⊆ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) ↔ (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))))
11	2, 9, 10	sylancr 586	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) ↔ (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))))
12	1, 11	mpbid 231	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ)))
13	12	simpld 494	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝐹 ∈ (ℂ ↑_pm ℂ))
14		pmresg 8616	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm ℂ)) → (𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆))
15	13, 14	syldan 590	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆))
16		simpl 482	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑆 ∈ {ℝ, ℂ})
17	12	simprd 495	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))
18		cncff 23962	. . . . . 6 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ) → ((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ)
19	17, 18	syl 17	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ)
20	19	fdmd 6595	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → dom ((ℂ D^𝑛 𝐹)‘𝑁) = dom 𝐹)
21		dvnres 25000	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm ℂ) ∧ 𝑁 ∈ ℕ₀) ∧ dom ((ℂ D^𝑛 𝐹)‘𝑁) = dom 𝐹) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
22	16, 13, 9, 20, 21	syl31anc 1371	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
23		resres 5893	. . . . . . 7 ⊢ ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ↾ dom 𝐹) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹))
24		rescom 5906	. . . . . . 7 ⊢ ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ↾ dom 𝐹) = ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆)
25	23, 24	eqtr3i 2768	. . . . . 6 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) = ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆)
26		ffn 6584	. . . . . . . 8 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ → ((ℂ D^𝑛 𝐹)‘𝑁) Fn dom 𝐹)
27		fnresdm 6535	. . . . . . . 8 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) Fn dom 𝐹 → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) = ((ℂ D^𝑛 𝐹)‘𝑁))
28	19, 26, 27	3syl 18	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) = ((ℂ D^𝑛 𝐹)‘𝑁))
29	28	reseq1d 5879	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
30	25, 29	syl5eq 2791	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
31		inss2 4160	. . . . . 6 ⊢ (𝑆 ∩ dom 𝐹) ⊆ dom 𝐹
32		rescncf 23966	. . . . . 6 ⊢ ((𝑆 ∩ dom 𝐹) ⊆ dom 𝐹 → (((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ)))
33	31, 17, 32	mpsyl 68	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ))
34	30, 33	eqeltrrd 2840	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ))
35		dmres 5902	. . . . 5 ⊢ dom (𝐹 ↾ 𝑆) = (𝑆 ∩ dom 𝐹)
36	35	oveq1i 7265	. . . 4 ⊢ (dom (𝐹 ↾ 𝑆)–cn→ℂ) = ((𝑆 ∩ dom 𝐹)–cn→ℂ)
37	34, 36	eleqtrrdi 2850	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))
38	22, 37	eqeltrd 2839	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))
39		recnprss 24973	. . 3 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
40		elcpn 25003	. . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ₀) → ((𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁) ↔ ((𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))))
41	39, 9, 40	syl2an2r 681	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁) ↔ ((𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))))
42	15, 38, 41	mpbir2and 709	1 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1539 ∈ wcel 2108 ∩ cin 3882 ⊆ wss 3883 {cpr 4560 dom cdm 5580 ↾ cres 5582 Fn wfn 6413 ⟶wf 6414 ‘cfv 6418 (class class class)co 7255 ↑_pm cpm 8574 ℂcc 10800 ℝcr 10801 ℕ₀cn0 12163 –cn→ccncf 23945 D^𝑛 cdvn 24933 𝓑C^𝑛ccpn 24934

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-inf2 9329 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-cncf 23947 df-limc 24935 df-dv 24936 df-dvn 24937 df-cpn 24938

This theorem is referenced by: aalioulem3 25399

W3C validator