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

Theorem dvnres 25968
Description: Multiple derivative version of dvres3a 25950. (Contributed by Mario Carneiro, 11-Feb-2015.)
Assertion
Ref Expression
dvnres (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑁 ∈ ℕ0) ∧ dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹) → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))

Proof of Theorem dvnres
Dummy variables 𝑛 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6905 . . . . . . . . 9 (𝑥 = 0 → ((ℂ D𝑛 𝐹)‘𝑥) = ((ℂ D𝑛 𝐹)‘0))
21dmeqd 5915 . . . . . . . 8 (𝑥 = 0 → dom ((ℂ D𝑛 𝐹)‘𝑥) = dom ((ℂ D𝑛 𝐹)‘0))
32eqeq1d 2738 . . . . . . 7 (𝑥 = 0 → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 ↔ dom ((ℂ D𝑛 𝐹)‘0) = dom 𝐹))
4 fveq2 6905 . . . . . . . 8 (𝑥 = 0 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = ((𝑆 D𝑛 (𝐹𝑆))‘0))
51reseq1d 5995 . . . . . . . 8 (𝑥 = 0 → (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆))
64, 5eqeq12d 2752 . . . . . . 7 (𝑥 = 0 → (((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) ↔ ((𝑆 D𝑛 (𝐹𝑆))‘0) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆)))
73, 6imbi12d 344 . . . . . 6 (𝑥 = 0 → ((dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆)) ↔ (dom ((ℂ D𝑛 𝐹)‘0) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆))))
87imbi2d 340 . . . . 5 (𝑥 = 0 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆))) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘0) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆)))))
9 fveq2 6905 . . . . . . . . 9 (𝑥 = 𝑛 → ((ℂ D𝑛 𝐹)‘𝑥) = ((ℂ D𝑛 𝐹)‘𝑛))
109dmeqd 5915 . . . . . . . 8 (𝑥 = 𝑛 → dom ((ℂ D𝑛 𝐹)‘𝑥) = dom ((ℂ D𝑛 𝐹)‘𝑛))
1110eqeq1d 2738 . . . . . . 7 (𝑥 = 𝑛 → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 ↔ dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹))
12 fveq2 6905 . . . . . . . 8 (𝑥 = 𝑛 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = ((𝑆 D𝑛 (𝐹𝑆))‘𝑛))
139reseq1d 5995 . . . . . . . 8 (𝑥 = 𝑛 → (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆))
1412, 13eqeq12d 2752 . . . . . . 7 (𝑥 = 𝑛 → (((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) ↔ ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)))
1511, 14imbi12d 344 . . . . . 6 (𝑥 = 𝑛 → ((dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆)) ↔ (dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆))))
1615imbi2d 340 . . . . 5 (𝑥 = 𝑛 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆))) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)))))
17 fveq2 6905 . . . . . . . . 9 (𝑥 = (𝑛 + 1) → ((ℂ D𝑛 𝐹)‘𝑥) = ((ℂ D𝑛 𝐹)‘(𝑛 + 1)))
1817dmeqd 5915 . . . . . . . 8 (𝑥 = (𝑛 + 1) → dom ((ℂ D𝑛 𝐹)‘𝑥) = dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)))
1918eqeq1d 2738 . . . . . . 7 (𝑥 = (𝑛 + 1) → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 ↔ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹))
20 fveq2 6905 . . . . . . . 8 (𝑥 = (𝑛 + 1) → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)))
2117reseq1d 5995 . . . . . . . 8 (𝑥 = (𝑛 + 1) → (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆))
2220, 21eqeq12d 2752 . . . . . . 7 (𝑥 = (𝑛 + 1) → (((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) ↔ ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆)))
2319, 22imbi12d 344 . . . . . 6 (𝑥 = (𝑛 + 1) → ((dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆)) ↔ (dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆))))
2423imbi2d 340 . . . . 5 (𝑥 = (𝑛 + 1) → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆))) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆)))))
25 fveq2 6905 . . . . . . . . 9 (𝑥 = 𝑁 → ((ℂ D𝑛 𝐹)‘𝑥) = ((ℂ D𝑛 𝐹)‘𝑁))
2625dmeqd 5915 . . . . . . . 8 (𝑥 = 𝑁 → dom ((ℂ D𝑛 𝐹)‘𝑥) = dom ((ℂ D𝑛 𝐹)‘𝑁))
2726eqeq1d 2738 . . . . . . 7 (𝑥 = 𝑁 → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 ↔ dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹))
28 fveq2 6905 . . . . . . . 8 (𝑥 = 𝑁 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = ((𝑆 D𝑛 (𝐹𝑆))‘𝑁))
2925reseq1d 5995 . . . . . . . 8 (𝑥 = 𝑁 → (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))
3028, 29eqeq12d 2752 . . . . . . 7 (𝑥 = 𝑁 → (((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆) ↔ ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆)))
3127, 30imbi12d 344 . . . . . 6 (𝑥 = 𝑁 → ((dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆)) ↔ (dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))))
3231imbi2d 340 . . . . 5 (𝑥 = 𝑁 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑥) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑥) = (((ℂ D𝑛 𝐹)‘𝑥) ↾ 𝑆))) ↔ ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆)))))
33 recnprss 25940 . . . . . . . . 9 (𝑆 ∈ {ℝ, ℂ} → 𝑆 ⊆ ℂ)
3433adantr 480 . . . . . . . 8 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → 𝑆 ⊆ ℂ)
35 pmresg 8911 . . . . . . . 8 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (𝐹𝑆) ∈ (ℂ ↑pm 𝑆))
36 dvn0 25961 . . . . . . . 8 ((𝑆 ⊆ ℂ ∧ (𝐹𝑆) ∈ (ℂ ↑pm 𝑆)) → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (𝐹𝑆))
3734, 35, 36syl2anc 584 . . . . . . 7 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (𝐹𝑆))
38 ssidd 4006 . . . . . . . . 9 (𝑆 ∈ {ℝ, ℂ} → ℂ ⊆ ℂ)
39 dvn0 25961 . . . . . . . . 9 ((ℂ ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → ((ℂ D𝑛 𝐹)‘0) = 𝐹)
4038, 39sylan 580 . . . . . . . 8 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → ((ℂ D𝑛 𝐹)‘0) = 𝐹)
4140reseq1d 5995 . . . . . . 7 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆) = (𝐹𝑆))
4237, 41eqtr4d 2779 . . . . . 6 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆))
4342a1d 25 . . . . 5 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘0) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘0) = (((ℂ D𝑛 𝐹)‘0) ↾ 𝑆)))
44 cnelprrecn 11249 . . . . . . . . . 10 ℂ ∈ {ℝ, ℂ}
45 simplr 768 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → 𝐹 ∈ (ℂ ↑pm ℂ))
46 simprl 770 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → 𝑛 ∈ ℕ0)
47 dvnbss 25965 . . . . . . . . . 10 ((ℂ ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑛 ∈ ℕ0) → dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ dom 𝐹)
4844, 45, 46, 47mp3an2i 1467 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ dom 𝐹)
49 simprr 772 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)
50 ssidd 4006 . . . . . . . . . . . . 13 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ℂ ⊆ ℂ)
51 dvnp1 25962 . . . . . . . . . . . . 13 ((ℂ ⊆ ℂ ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑛 ∈ ℕ0) → ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)))
5250, 45, 46, 51syl3anc 1372 . . . . . . . . . . . 12 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)))
5352dmeqd 5915 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)))
5449, 53eqtr3d 2778 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom 𝐹 = dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)))
55 dvnf 25964 . . . . . . . . . . . 12 ((ℂ ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑛 ∈ ℕ0) → ((ℂ D𝑛 𝐹)‘𝑛):dom ((ℂ D𝑛 𝐹)‘𝑛)⟶ℂ)
5644, 45, 46, 55mp3an2i 1467 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ((ℂ D𝑛 𝐹)‘𝑛):dom ((ℂ D𝑛 𝐹)‘𝑛)⟶ℂ)
57 cnex 11237 . . . . . . . . . . . . . . 15 ℂ ∈ V
5857, 57elpm2 8915 . . . . . . . . . . . . . 14 (𝐹 ∈ (ℂ ↑pm ℂ) ↔ (𝐹:dom 𝐹⟶ℂ ∧ dom 𝐹 ⊆ ℂ))
5958simprbi 496 . . . . . . . . . . . . 13 (𝐹 ∈ (ℂ ↑pm ℂ) → dom 𝐹 ⊆ ℂ)
6045, 59syl 17 . . . . . . . . . . . 12 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom 𝐹 ⊆ ℂ)
6148, 60sstrd 3993 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ ℂ)
6250, 56, 61dvbss 25937 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) ⊆ dom ((ℂ D𝑛 𝐹)‘𝑛))
6354, 62eqsstrd 4017 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom 𝐹 ⊆ dom ((ℂ D𝑛 𝐹)‘𝑛))
6448, 63eqssd 4000 . . . . . . . 8 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹)
6564expr 456 . . . . . . 7 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ 𝑛 ∈ ℕ0) → (dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹 → dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹))
6665imim1d 82 . . . . . 6 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ 𝑛 ∈ ℕ0) → ((dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)) → (dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆))))
67 oveq2 7440 . . . . . . 7 (((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆) → (𝑆 D ((𝑆 D𝑛 (𝐹𝑆))‘𝑛)) = (𝑆 D (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)))
6834adantr 480 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → 𝑆 ⊆ ℂ)
6935adantr 480 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (𝐹𝑆) ∈ (ℂ ↑pm 𝑆))
70 dvnp1 25962 . . . . . . . . 9 ((𝑆 ⊆ ℂ ∧ (𝐹𝑆) ∈ (ℂ ↑pm 𝑆) ∧ 𝑛 ∈ ℕ0) → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (𝑆 D ((𝑆 D𝑛 (𝐹𝑆))‘𝑛)))
7168, 69, 46, 70syl3anc 1372 . . . . . . . 8 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (𝑆 D ((𝑆 D𝑛 (𝐹𝑆))‘𝑛)))
7252reseq1d 5995 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆) = ((ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) ↾ 𝑆))
73 simpll 766 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → 𝑆 ∈ {ℝ, ℂ})
74 eqid 2736 . . . . . . . . . . . . . 14 (TopOpen‘ℂfld) = (TopOpen‘ℂfld)
7574cnfldtop 24805 . . . . . . . . . . . . 13 (TopOpen‘ℂfld) ∈ Top
76 unicntop 24807 . . . . . . . . . . . . . 14 ℂ = (TopOpen‘ℂfld)
7776ntrss2 23066 . . . . . . . . . . . . 13 (((TopOpen‘ℂfld) ∈ Top ∧ dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ ℂ) → ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)) ⊆ dom ((ℂ D𝑛 𝐹)‘𝑛))
7875, 61, 77sylancr 587 . . . . . . . . . . . 12 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)) ⊆ dom ((ℂ D𝑛 𝐹)‘𝑛))
7974cnfldtopon 24804 . . . . . . . . . . . . . . . 16 (TopOpen‘ℂfld) ∈ (TopOn‘ℂ)
8079toponrestid 22928 . . . . . . . . . . . . . . 15 (TopOpen‘ℂfld) = ((TopOpen‘ℂfld) ↾t ℂ)
8150, 56, 61, 80, 74dvbssntr 25936 . . . . . . . . . . . . . 14 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) ⊆ ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)))
8254, 81eqsstrd 4017 . . . . . . . . . . . . 13 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom 𝐹 ⊆ ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)))
8348, 82sstrd 3993 . . . . . . . . . . . 12 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)))
8478, 83eqssd 4000 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)) = dom ((ℂ D𝑛 𝐹)‘𝑛))
8576isopn3 23075 . . . . . . . . . . . 12 (((TopOpen‘ℂfld) ∈ Top ∧ dom ((ℂ D𝑛 𝐹)‘𝑛) ⊆ ℂ) → (dom ((ℂ D𝑛 𝐹)‘𝑛) ∈ (TopOpen‘ℂfld) ↔ ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)) = dom ((ℂ D𝑛 𝐹)‘𝑛)))
8675, 61, 85sylancr 587 . . . . . . . . . . 11 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (dom ((ℂ D𝑛 𝐹)‘𝑛) ∈ (TopOpen‘ℂfld) ↔ ((int‘(TopOpen‘ℂfld))‘dom ((ℂ D𝑛 𝐹)‘𝑛)) = dom ((ℂ D𝑛 𝐹)‘𝑛)))
8784, 86mpbird 257 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom ((ℂ D𝑛 𝐹)‘𝑛) ∈ (TopOpen‘ℂfld))
8864, 54eqtr2d 2777 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) = dom ((ℂ D𝑛 𝐹)‘𝑛))
8974dvres3a 25950 . . . . . . . . . 10 (((𝑆 ∈ {ℝ, ℂ} ∧ ((ℂ D𝑛 𝐹)‘𝑛):dom ((ℂ D𝑛 𝐹)‘𝑛)⟶ℂ) ∧ (dom ((ℂ D𝑛 𝐹)‘𝑛) ∈ (TopOpen‘ℂfld) ∧ dom (ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) = dom ((ℂ D𝑛 𝐹)‘𝑛))) → (𝑆 D (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)) = ((ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) ↾ 𝑆))
9073, 56, 87, 88, 89syl22anc 838 . . . . . . . . 9 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (𝑆 D (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)) = ((ℂ D ((ℂ D𝑛 𝐹)‘𝑛)) ↾ 𝑆))
9172, 90eqtr4d 2779 . . . . . . . 8 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆) = (𝑆 D (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆)))
9271, 91eqeq12d 2752 . . . . . . 7 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆) ↔ (𝑆 D ((𝑆 D𝑛 (𝐹𝑆))‘𝑛)) = (𝑆 D (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆))))
9367, 92imbitrrid 246 . . . . . 6 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) ∧ (𝑛 ∈ ℕ0 ∧ dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹)) → (((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆) → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆)))
9466, 93animpimp2impd 846 . . . . 5 (𝑛 ∈ ℕ0 → (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑛) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑛) = (((ℂ D𝑛 𝐹)‘𝑛) ↾ 𝑆))) → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘(𝑛 + 1)) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘(𝑛 + 1)) = (((ℂ D𝑛 𝐹)‘(𝑛 + 1)) ↾ 𝑆)))))
958, 16, 24, 32, 43, 94nn0ind 12715 . . . 4 (𝑁 ∈ ℕ0 → ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))))
9695com12 32 . . 3 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ)) → (𝑁 ∈ ℕ0 → (dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))))
97963impia 1117 . 2 ((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑁 ∈ ℕ0) → (dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹 → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆)))
9897imp 406 1 (((𝑆 ∈ {ℝ, ℂ} ∧ 𝐹 ∈ (ℂ ↑pm ℂ) ∧ 𝑁 ∈ ℕ0) ∧ dom ((ℂ D𝑛 𝐹)‘𝑁) = dom 𝐹) → ((𝑆 D𝑛 (𝐹𝑆))‘𝑁) = (((ℂ D𝑛 𝐹)‘𝑁) ↾ 𝑆))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1539  wcel 2107  wss 3950  {cpr 4627  dom cdm 5684  cres 5686  wf 6556  cfv 6560  (class class class)co 7432  pm cpm 8868  cc 11154  cr 11155  0cc0 11156  1c1 11157   + caddc 11159  0cn0 12528  TopOpenctopn 17467  fldccnfld 21365  Topctop 22900  intcnt 23026   D cdv 25899   D𝑛 cdvn 25900
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pow 5364  ax-pr 5431  ax-un 7756  ax-inf2 9682  ax-cnex 11212  ax-resscn 11213  ax-1cn 11214  ax-icn 11215  ax-addcl 11216  ax-addrcl 11217  ax-mulcl 11218  ax-mulrcl 11219  ax-mulcom 11220  ax-addass 11221  ax-mulass 11222  ax-distr 11223  ax-i2m1 11224  ax-1ne0 11225  ax-1rid 11226  ax-rnegex 11227  ax-rrecex 11228  ax-cnre 11229  ax-pre-lttri 11230  ax-pre-lttrn 11231  ax-pre-ltadd 11232  ax-pre-mulgt0 11233  ax-pre-sup 11234
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-nel 3046  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-tp 4630  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-iin 4993  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-riota 7389  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-1st 8015  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-1o 8507  df-er 8746  df-map 8869  df-pm 8870  df-en 8987  df-dom 8988  df-sdom 8989  df-fin 8990  df-fi 9452  df-sup 9483  df-inf 9484  df-pnf 11298  df-mnf 11299  df-xr 11300  df-ltxr 11301  df-le 11302  df-sub 11495  df-neg 11496  df-div 11922  df-nn 12268  df-2 12330  df-3 12331  df-4 12332  df-5 12333  df-6 12334  df-7 12335  df-8 12336  df-9 12337  df-n0 12529  df-z 12616  df-dec 12736  df-uz 12880  df-q 12992  df-rp 13036  df-xneg 13155  df-xadd 13156  df-xmul 13157  df-icc 13395  df-fz 13549  df-seq 14044  df-exp 14104  df-cj 15139  df-re 15140  df-im 15141  df-sqrt 15275  df-abs 15276  df-struct 17185  df-slot 17220  df-ndx 17232  df-base 17249  df-plusg 17311  df-mulr 17312  df-starv 17313  df-tset 17317  df-ple 17318  df-ds 17320  df-unif 17321  df-rest 17468  df-topn 17469  df-topgen 17489  df-psmet 21357  df-xmet 21358  df-met 21359  df-bl 21360  df-mopn 21361  df-fbas 21362  df-fg 21363  df-cnfld 21366  df-top 22901  df-topon 22918  df-topsp 22940  df-bases 22954  df-cld 23028  df-ntr 23029  df-cls 23030  df-nei 23107  df-lp 23145  df-perf 23146  df-cnp 23237  df-haus 23324  df-fil 23855  df-fm 23947  df-flim 23948  df-flf 23949  df-xms 24331  df-ms 24332  df-limc 25902  df-dv 25903  df-dvn 25904
This theorem is referenced by:  cpnres  25974
  Copyright terms: Public domain W3C validator