Metamath Proof Explorer


Theorem cpnres

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

Ref Expression
Assertion cpnres ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ↾ S ∈ C n ⁡ S ⁡ N

Proof

Step Hyp Ref Expression
1 simpr ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ∈ C n ⁡ ℂ ⁡ N
2 ssid ⊢ ℂ ⊆ ℂ
3 elfvdm ⊢ F ∈ C n ⁡ ℂ ⁡ N → N ∈ dom ⁡ C n ⁡ ℂ
4 3 adantl ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → N ∈ dom ⁡ C n ⁡ ℂ
5 fncpn ⊢ ℂ ⊆ ℂ → C n ⁡ ℂ Fn ℕ 0
6 2 5 ax-mp ⊢ C n ⁡ ℂ Fn ℕ 0
7 fndm ⊢ C n ⁡ ℂ Fn ℕ 0 → dom ⁡ C n ⁡ ℂ = ℕ 0
8 6 7 mp1i ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → dom ⁡ C n ⁡ ℂ = ℕ 0
9 4 8 eleqtrd ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → N ∈ ℕ 0
10 elcpn ⊢ ℂ ⊆ ℂ ∧ N ∈ ℕ 0 → F ∈ C n ⁡ ℂ ⁡ N ↔ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ
11 2 9 10 sylancr ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ∈ C n ⁡ ℂ ⁡ N ↔ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ
12 1 11 mpbid ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ
13 12 simpld ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ∈ ℂ ↑ 𝑝𝑚 ℂ
14 pmresg ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 ℂ → F ↾ S ∈ ℂ ↑ 𝑝𝑚 S
15 13 14 syldan ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ↾ S ∈ ℂ ↑ 𝑝𝑚 S
16 simpl ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → S ∈ ℝ ℂ
17 12 simprd ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ
18 cncff ⊢ ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ → ℂ D n F ⁡ N : dom ⁡ F ⟶ ℂ
19 17 18 syl ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N : dom ⁡ F ⟶ ℂ
20 19 fdmd ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → dom ⁡ ℂ D n F ⁡ N = dom ⁡ F
21 dvnres ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ N ∈ ℕ 0 ∧ dom ⁡ ℂ D n F ⁡ N = dom ⁡ F → S D n F ↾ S ⁡ N = ℂ D n F ⁡ N ↾ S
22 16 13 9 20 21 syl31anc ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → S D n F ↾ S ⁡ N = ℂ D n F ⁡ N ↾ S
23 resres ⊢ ℂ D n F ⁡ N ↾ S ↾ dom ⁡ F = ℂ D n F ⁡ N ↾ S ∩ dom ⁡ F
24 rescom ⊢ ℂ D n F ⁡ N ↾ S ↾ dom ⁡ F = ℂ D n F ⁡ N ↾ dom ⁡ F ↾ S
25 23 24 eqtr3i ⊢ ℂ D n F ⁡ N ↾ S ∩ dom ⁡ F = ℂ D n F ⁡ N ↾ dom ⁡ F ↾ S
26 ffn ⊢ ℂ D n F ⁡ N : dom ⁡ F ⟶ ℂ → ℂ D n F ⁡ N Fn dom ⁡ F
27 fnresdm ⊢ ℂ D n F ⁡ N Fn dom ⁡ F → ℂ D n F ⁡ N ↾ dom ⁡ F = ℂ D n F ⁡ N
28 19 26 27 3syl ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ dom ⁡ F = ℂ D n F ⁡ N
29 28 reseq1d ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ dom ⁡ F ↾ S = ℂ D n F ⁡ N ↾ S
30 25 29 eqtrid ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ S ∩ dom ⁡ F = ℂ D n F ⁡ N ↾ S
31 inss2 ⊢ S ∩ dom ⁡ F ⊆ dom ⁡ F
32 rescncf ⊢ S ∩ dom ⁡ F ⊆ dom ⁡ F → ℂ D n F ⁡ N : dom ⁡ F ⟶cn ℂ → ℂ D n F ⁡ N ↾ S ∩ dom ⁡ F : S ∩ dom ⁡ F ⟶cn ℂ
33 31 17 32 mpsyl ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ S ∩ dom ⁡ F : S ∩ dom ⁡ F ⟶cn ℂ
34 30 33 eqeltrrd ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ S : S ∩ dom ⁡ F ⟶cn ℂ
35 dmres ⊢ dom ⁡ F ↾ S = S ∩ dom ⁡ F
36 35 oveq1i ⊢ dom ⁡ F ↾ S ⟶cn ℂ = S ∩ dom ⁡ F ⟶cn ℂ
37 34 36 eleqtrrdi ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → ℂ D n F ⁡ N ↾ S : dom ⁡ F ↾ S ⟶cn ℂ
38 22 37 eqeltrd ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → S D n F ↾ S ⁡ N : dom ⁡ F ↾ S ⟶cn ℂ
39 recnprss ⊢ S ∈ ℝ ℂ → S ⊆ ℂ
40 elcpn ⊢ S ⊆ ℂ ∧ N ∈ ℕ 0 → F ↾ S ∈ C n ⁡ S ⁡ N ↔ F ↾ S ∈ ℂ ↑ 𝑝𝑚 S ∧ S D n F ↾ S ⁡ N : dom ⁡ F ↾ S ⟶cn ℂ
41 39 9 40 syl2an2r ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ↾ S ∈ C n ⁡ S ⁡ N ↔ F ↾ S ∈ ℂ ↑ 𝑝𝑚 S ∧ S D n F ↾ S ⁡ N : dom ⁡ F ↾ S ⟶cn ℂ
42 15 38 41 mpbir2and ⊢ S ∈ ℝ ℂ ∧ F ∈ C n ⁡ ℂ ⁡ N → F ↾ S ∈ C n ⁡ S ⁡ N