Metamath Proof Explorer


Theorem dvnff

Description: The iterated derivative is a function. (Contributed by Mario Carneiro, 11-Feb-2015)

Ref Expression
Assertion dvnff ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → S D n F : ℕ 0 ⟶ ℂ ↑ 𝑝𝑚 dom ⁡ F

Proof

Step Hyp Ref Expression
1 nn0uz ⊢ ℕ 0 = ℤ ≥ 0
2 0zd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → 0 ∈ ℤ
3 fvconst2g ⊢ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → ℕ 0 × F ⁡ k = F
4 3 adantll ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → ℕ 0 × F ⁡ k = F
5 dmexg ⊢ F ∈ ℂ ↑ 𝑝𝑚 S → dom ⁡ F ∈ V
6 5 ad2antlr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → dom ⁡ F ∈ V
7 cnex ⊢ ℂ ∈ V
8 7 a1i ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → ℂ ∈ V
9 elpm2g ⊢ ℂ ∈ V ∧ S ∈ ℝ ℂ → F ∈ ℂ ↑ 𝑝𝑚 S ↔ F : dom ⁡ F ⟶ ℂ ∧ dom ⁡ F ⊆ S
10 7 9 mpan ⊢ S ∈ ℝ ℂ → F ∈ ℂ ↑ 𝑝𝑚 S ↔ F : dom ⁡ F ⟶ ℂ ∧ dom ⁡ F ⊆ S
11 10 biimpa ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → F : dom ⁡ F ⟶ ℂ ∧ dom ⁡ F ⊆ S
12 11 simpld ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → F : dom ⁡ F ⟶ ℂ
13 12 adantr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → F : dom ⁡ F ⟶ ℂ
14 fpmg ⊢ dom ⁡ F ∈ V ∧ ℂ ∈ V ∧ F : dom ⁡ F ⟶ ℂ → F ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
15 6 8 13 14 syl3anc ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → F ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
16 4 15 eqeltrd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → ℕ 0 × F ⁡ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
17 vex ⊢ k ∈ V
18 vex ⊢ n ∈ V
19 17 18 opco1i ⊢ k x ∈ V ⟼ S D x ∘ 1 st n = x ∈ V ⟼ S D x ⁡ k
20 oveq2 ⊢ x = k → S D x = S D k
21 eqid ⊢ x ∈ V ⟼ S D x = x ∈ V ⟼ S D x
22 ovex ⊢ S D k ∈ V
23 20 21 22 fvmpt ⊢ k ∈ V → x ∈ V ⟼ S D x ⁡ k = S D k
24 23 elv ⊢ x ∈ V ⟼ S D x ⁡ k = S D k
25 19 24 eqtri ⊢ k x ∈ V ⟼ S D x ∘ 1 st n = S D k
26 7 a1i ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → ℂ ∈ V
27 5 ad2antlr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ F ∈ V
28 dvfg ⊢ S ∈ ℝ ℂ → k S ′ : dom ⁡ k S ′ ⟶ ℂ
29 28 ad2antrr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k S ′ : dom ⁡ k S ′ ⟶ ℂ
30 recnprss ⊢ S ∈ ℝ ℂ → S ⊆ ℂ
31 30 ad2antrr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → S ⊆ ℂ
32 simprl ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
33 elpm2g ⊢ ℂ ∈ V ∧ dom ⁡ F ∈ V → k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ↔ k : dom ⁡ k ⟶ ℂ ∧ dom ⁡ k ⊆ dom ⁡ F
34 7 27 33 sylancr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ↔ k : dom ⁡ k ⟶ ℂ ∧ dom ⁡ k ⊆ dom ⁡ F
35 32 34 mpbid ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k : dom ⁡ k ⟶ ℂ ∧ dom ⁡ k ⊆ dom ⁡ F
36 35 simpld ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k : dom ⁡ k ⟶ ℂ
37 35 simprd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ k ⊆ dom ⁡ F
38 11 simprd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → dom ⁡ F ⊆ S
39 38 adantr ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ F ⊆ S
40 37 39 sstrd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ k ⊆ S
41 31 36 40 dvbss ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ k S ′ ⊆ dom ⁡ k
42 41 37 sstrd ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → dom ⁡ k S ′ ⊆ dom ⁡ F
43 elpm2r ⊢ ℂ ∈ V ∧ dom ⁡ F ∈ V ∧ k S ′ : dom ⁡ k S ′ ⟶ ℂ ∧ dom ⁡ k S ′ ⊆ dom ⁡ F → S D k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
44 26 27 29 42 43 syl22anc ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → S D k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
45 25 44 eqeltrid ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F ∧ n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F → k x ∈ V ⟼ S D x ∘ 1 st n ∈ ℂ ↑ 𝑝𝑚 dom ⁡ F
46 1 2 16 45 seqf ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → seq 0 x ∈ V ⟼ S D x ∘ 1 st ℕ 0 × F : ℕ 0 ⟶ ℂ ↑ 𝑝𝑚 dom ⁡ F
47 21 dvnfval ⊢ S ⊆ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → S D n F = seq 0 x ∈ V ⟼ S D x ∘ 1 st ℕ 0 × F
48 30 47 sylan ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → S D n F = seq 0 x ∈ V ⟼ S D x ∘ 1 st ℕ 0 × F
49 48 feq1d ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → S D n F : ℕ 0 ⟶ ℂ ↑ 𝑝𝑚 dom ⁡ F ↔ seq 0 x ∈ V ⟼ S D x ∘ 1 st ℕ 0 × F : ℕ 0 ⟶ ℂ ↑ 𝑝𝑚 dom ⁡ F
50 46 49 mpbird ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S → S D n F : ℕ 0 ⟶ ℂ ↑ 𝑝𝑚 dom ⁡ F