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 26171

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 490	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁))
2		ssid 3956	. . . . . 6 ⊢ ℂ ⊆ ℂ
3		elfvdm 6916	. . . . . . . 8 ⊢ (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) → 𝑁 ∈ dom (𝓑C^𝑛‘ℂ))
4	3	adantl 487	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑁 ∈ dom (𝓑C^𝑛‘ℂ))
5		fncpn 26167	. . . . . . . . 9 ⊢ (ℂ ⊆ ℂ → (𝓑C^𝑛‘ℂ) Fn ℕ₀)
6	2, 5	ax-mp 5	. . . . . . . 8 ⊢ (𝓑C^𝑛‘ℂ) Fn ℕ₀
7		fndm 6639	. . . . . . . 8 ⊢ ((𝓑C^𝑛‘ℂ) Fn ℕ₀ → dom (𝓑C^𝑛‘ℂ) = ℕ₀)
8	6, 7	mp1i 14	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → dom (𝓑C^𝑛‘ℂ) = ℕ₀)
9	4, 8	eleqtrd 2864	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑁 ∈ ℕ₀)
10		elcpn 26168	. . . . . 6 ⊢ ((ℂ ⊆ ℂ ∧ 𝑁 ∈ ℕ₀) → (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) ↔ (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))))
11	2, 9, 10	sylancr 599	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁) ↔ (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))))
12	1, 11	mpbid 235	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ∈ (ℂ ↑_pm ℂ) ∧ ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ)))
13	12	simpld 500	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝐹 ∈ (ℂ ↑_pm ℂ))
14		pmresg 8881	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm ℂ)) → (𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆))
15	13, 14	syldan 603	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆))
16		simpl 488	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → 𝑆 ∈ {ℝ, ℂ})
17	12	simprd 501	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ))
18		cncff 25127	. . . . . 6 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ) → ((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ)
19	17, 18	syl 18	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ)
20	19	fdmd 6717	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → dom ((ℂ D^𝑛 𝐹)‘𝑁) = dom 𝐹)
21		dvnres 26165	. . . 4 ⊢ (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑_pm ℂ) ∧ 𝑁 ∈ ℕ₀) ∧ dom ((ℂ D^𝑛 𝐹)‘𝑁) = dom 𝐹) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
22	16, 13, 9, 20, 21	syl31anc 1400	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
23		resres 5989	. . . . . . 7 ⊢ ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ↾ dom 𝐹) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹))
24		rescom 5999	. . . . . . 7 ⊢ ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ↾ dom 𝐹) = ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆)
25	23, 24	eqtr3i 2787	. . . . . 6 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) = ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆)
26		ffn 6706	. . . . . . . 8 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁):dom 𝐹⟶ℂ → ((ℂ D^𝑛 𝐹)‘𝑁) Fn dom 𝐹)
27		fnresdm 6655	. . . . . . . 8 ⊢ (((ℂ D^𝑛 𝐹)‘𝑁) Fn dom 𝐹 → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) = ((ℂ D^𝑛 𝐹)‘𝑁))
28	19, 26, 27	3syl 19	. . . . . . 7 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) = ((ℂ D^𝑛 𝐹)‘𝑁))
29	28	reseq1d 5975	. . . . . 6 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((((ℂ D^𝑛 𝐹)‘𝑁) ↾ dom 𝐹) ↾ 𝑆) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
30	25, 29	eqtrid 2809	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) = (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆))
31		inss2 4186	. . . . . 6 ⊢ (𝑆 ∩ dom 𝐹) ⊆ dom 𝐹
32		rescncf 25131	. . . . . 6 ⊢ ((𝑆 ∩ dom 𝐹) ⊆ dom 𝐹 → (((ℂ D^𝑛 𝐹)‘𝑁) ∈ (dom 𝐹–cn→ℂ) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ)))
33	31, 17, 32	mpsyl 69	. . . . 5 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ (𝑆 ∩ dom 𝐹)) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ))
34	30, 33	eqeltrrd 2863	. . . 4 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ∈ ((𝑆 ∩ dom 𝐹)–cn→ℂ))
35		dmres 6009	. . . . 5 ⊢ dom (𝐹 ↾ 𝑆) = (𝑆 ∩ dom 𝐹)
36	35	oveq1i 7427	. . . 4 ⊢ (dom (𝐹 ↾ 𝑆)–cn→ℂ) = ((𝑆 ∩ dom 𝐹)–cn→ℂ)
37	34, 36	eleqtrrdi 2873	. . 3 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (((ℂ D^𝑛 𝐹)‘𝑁) ↾ 𝑆) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))
38	22, 37	eqeltrd 2862	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))
39		recnprss 26138	. . 3 ⊢ (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
40		elcpn 26168	. . 3 ⊢ ((𝑆 ⊆ ℂ ∧ 𝑁 ∈ ℕ₀) → ((𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁) ↔ ((𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))))
41	39, 9, 40	syl2an2r 698	. 2 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → ((𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁) ↔ ((𝐹 ↾ 𝑆) ∈ (ℂ ↑_pm 𝑆) ∧ ((𝑆 D^𝑛 (𝐹 ↾ 𝑆))‘𝑁) ∈ (dom (𝐹 ↾ 𝑆)–cn→ℂ))))
42	15, 38, 41	mpbir2and 726	1 ⊢ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ ((𝓑C^𝑛‘ℂ)‘𝑁)) → (𝐹 ↾ 𝑆) ∈ ((𝓑C^𝑛‘𝑆)‘𝑁))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∩ cin 3901 ⊆ wss 3902 {cpr 4589 dom cdm 5659 ↾ cres 5661 Fn wfn 6532 ⟶wf 6533 ‘cfv 6537 (class class class)co 7417 ↑_pm cpm 8831 ℂcc 11126 ℝcr 11127 ℕ₀cn0 12532 –cn→ccncf 25110 D^𝑛 cdvn 26098 𝓑C^𝑛ccpn 26099

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 2215 ax-ext 2734 ax-rep 5236 ax-sep 5255 ax-nul 5267 ax-pow 5334 ax-pr 5402 ax-un 7740 ax-inf2 9624 ax-cnex 11184 ax-resscn 11185 ax-1cn 11186 ax-icn 11187 ax-addcl 11188 ax-addrcl 11189 ax-mulcl 11190 ax-mulrcl 11191 ax-mulcom 11192 ax-addass 11193 ax-mulass 11194 ax-distr 11195 ax-i2m1 11196 ax-1ne0 11197 ax-1rid 11198 ax-rnegex 11199 ax-rrecex 11200 ax-cnre 11201 ax-pre-lttri 11202 ax-pre-lttrn 11203 ax-pre-ltadd 11204 ax-pre-mulgt0 11205 ax-pre-sup 11206

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-nel 3064 df-ral 3079 df-rex 3089 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4283 df-if 4486 df-pw 4562 df-sn 4588 df-pr 4590 df-tp 4592 df-op 4594 df-uni 4871 df-int 4911 df-iun 4956 df-iin 4957 df-br 5108 df-opab 5172 df-mpt 5191 df-tr 5217 df-id 5554 df-eprel 5559 df-po 5567 df-so 5568 df-fr 5612 df-we 5614 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7374 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7867 df-1st 7990 df-2nd 7991 df-frecs 8284 df-wrecs 8315 df-recs 8364 df-rdg 8403 df-1o 8459 df-er 8700 df-map 8832 df-pm 8833 df-en 8957 df-dom 8958 df-sdom 8959 df-fin 8960 df-fi 9385 df-sup 9416 df-inf 9417 df-pnf 11273 df-mnf 11274 df-xr 11275 df-ltxr 11276 df-le 11277 df-sub 11471 df-neg 11472 df-div 11900 df-nn 12262 df-2 12331 df-3 12332 df-4 12333 df-5 12334 df-6 12335 df-7 12336 df-8 12337 df-9 12338 df-n0 12533 df-z 12620 df-dec 12741 df-uz 12892 df-q 13002 df-rp 13047 df-xneg 13167 df-xadd 13168 df-xmul 13169 df-icc 13409 df-fz 13566 df-seq 14070 df-exp 14130 df-cj 15190 df-re 15191 df-im 15192 df-sqrt 15326 df-abs 15327 df-struct 17245 df-slot 17280 df-ndx 17292 df-base 17308 df-plusg 17361 df-mulr 17362 df-starv 17363 df-tset 17367 df-ple 17368 df-ds 17370 df-unif 17371 df-rest 17513 df-topn 17514 df-topgen 17534 df-psmet 21583 df-xmet 21584 df-met 21585 df-bl 21586 df-mopn 21587 df-fbas 21588 df-fg 21589 df-cnfld 21592 df-top 23125 df-topon 23142 df-topsp 23164 df-bases 23177 df-cld 23250 df-ntr 23251 df-cls 23252 df-nei 23329 df-lp 23367 df-perf 23368 df-cnp 23459 df-haus 23546 df-fil 24078 df-fm 24170 df-flim 24171 df-flf 24172 df-xms 24552 df-ms 24553 df-cncf 25112 df-limc 26100 df-dv 26101 df-dvn 26102 df-cpn 26103

This theorem is used by: aalioulem3 26577

W3C validator