Metamath Proof Explorer


Theorem dvnply2

Description: Polynomials have polynomials as derivatives of all orders. (Contributed by Mario Carneiro, 1-Jan-2017)

Ref Expression
Assertion dvnply2 ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ N ∈ ℕ 0 → ℂ D n F ⁡ N ∈ Poly ⁡ S

Proof

Step Hyp Ref Expression
1 fveq2 ⊢ x = 0 → ℂ D n F ⁡ x = ℂ D n F ⁡ 0
2 1 eleq1d ⊢ x = 0 → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ ℂ D n F ⁡ 0 ∈ Poly ⁡ S
3 2 imbi2d ⊢ x = 0 → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ 0 ∈ Poly ⁡ S
4 fveq2 ⊢ x = n → ℂ D n F ⁡ x = ℂ D n F ⁡ n
5 4 eleq1d ⊢ x = n → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ ℂ D n F ⁡ n ∈ Poly ⁡ S
6 5 imbi2d ⊢ x = n → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ n ∈ Poly ⁡ S
7 fveq2 ⊢ x = n + 1 → ℂ D n F ⁡ x = ℂ D n F ⁡ n + 1
8 7 eleq1d ⊢ x = n + 1 → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S
9 8 imbi2d ⊢ x = n + 1 → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S
10 fveq2 ⊢ x = N → ℂ D n F ⁡ x = ℂ D n F ⁡ N
11 10 eleq1d ⊢ x = N → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ ℂ D n F ⁡ N ∈ Poly ⁡ S
12 11 imbi2d ⊢ x = N → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ x ∈ Poly ⁡ S ↔ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ N ∈ Poly ⁡ S
13 ssid ⊢ ℂ ⊆ ℂ
14 cnex ⊢ ℂ ∈ V
15 plyf ⊢ F ∈ Poly ⁡ S → F : ℂ ⟶ ℂ
16 15 adantl ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → F : ℂ ⟶ ℂ
17 fpmg ⊢ ℂ ∈ V ∧ ℂ ∈ V ∧ F : ℂ ⟶ ℂ → F ∈ ℂ ↑ 𝑝𝑚 ℂ
18 14 14 16 17 mp3an12i ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → F ∈ ℂ ↑ 𝑝𝑚 ℂ
19 dvn0 ⊢ ℂ ⊆ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 ℂ → ℂ D n F ⁡ 0 = F
20 13 18 19 sylancr ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ 0 = F
21 simpr ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → F ∈ Poly ⁡ S
22 20 21 eqeltrd ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ 0 ∈ Poly ⁡ S
23 dvply2g ⊢ S ∈ SubRing ⁡ ℂ fld ∧ ℂ D n F ⁡ n ∈ Poly ⁡ S → ℂ D ℂ D n F ⁡ n ∈ Poly ⁡ S
24 23 ex ⊢ S ∈ SubRing ⁡ ℂ fld → ℂ D n F ⁡ n ∈ Poly ⁡ S → ℂ D ℂ D n F ⁡ n ∈ Poly ⁡ S
25 24 ad2antrr ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n ∈ Poly ⁡ S → ℂ D ℂ D n F ⁡ n ∈ Poly ⁡ S
26 dvnp1 ⊢ ℂ ⊆ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n + 1 = ℂ D ℂ D n F ⁡ n
27 13 26 mp3an1 ⊢ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n + 1 = ℂ D ℂ D n F ⁡ n
28 18 27 sylan ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n + 1 = ℂ D ℂ D n F ⁡ n
29 28 eleq1d ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S ↔ ℂ D ℂ D n F ⁡ n ∈ Poly ⁡ S
30 25 29 sylibrd ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n ∈ Poly ⁡ S → ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S
31 30 expcom ⊢ n ∈ ℕ 0 → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ n ∈ Poly ⁡ S → ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S
32 31 a2d ⊢ n ∈ ℕ 0 → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ n ∈ Poly ⁡ S → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ n + 1 ∈ Poly ⁡ S
33 3 6 9 12 22 32 nn0ind ⊢ N ∈ ℕ 0 → S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S → ℂ D n F ⁡ N ∈ Poly ⁡ S
34 33 impcom ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ N ∈ ℕ 0 → ℂ D n F ⁡ N ∈ Poly ⁡ S
35 34 3impa ⊢ S ∈ SubRing ⁡ ℂ fld ∧ F ∈ Poly ⁡ S ∧ N ∈ ℕ 0 → ℂ D n F ⁡ N ∈ Poly ⁡ S