Metamath Proof Explorer


Theorem taylfvallem1

Description: Lemma for taylfval . (Contributed by Mario Carneiro, 30-Dec-2016)

Ref Expression
Hypotheses taylfval.s ⊢ φ → S ∈ ℝ ℂ
taylfval.f ⊢ φ → F : A ⟶ ℂ
taylfval.a ⊢ φ → A ⊆ S
taylfval.n ⊢ φ → N ∈ ℕ 0 ∨ N = +∞
taylfval.b ⊢ φ ∧ k ∈ 0 N ∩ ℤ → B ∈ dom ⁡ S D n F ⁡ k
Assertion taylfvallem1 ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k ⁡ B k ! ⁢ X − B k ∈ ℂ

Proof

Step Hyp Ref Expression
1 taylfval.s ⊢ φ → S ∈ ℝ ℂ
2 taylfval.f ⊢ φ → F : A ⟶ ℂ
3 taylfval.a ⊢ φ → A ⊆ S
4 taylfval.n ⊢ φ → N ∈ ℕ 0 ∨ N = +∞
5 taylfval.b ⊢ φ ∧ k ∈ 0 N ∩ ℤ → B ∈ dom ⁡ S D n F ⁡ k
6 1 ad2antrr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S ∈ ℝ ℂ
7 cnex ⊢ ℂ ∈ V
8 7 a1i ⊢ φ → ℂ ∈ V
9 elpm2r ⊢ ℂ ∈ V ∧ S ∈ ℝ ℂ ∧ F : A ⟶ ℂ ∧ A ⊆ S → F ∈ ℂ ↑ 𝑝𝑚 S
10 8 1 2 3 9 syl22anc ⊢ φ → F ∈ ℂ ↑ 𝑝𝑚 S
11 10 ad2antrr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → F ∈ ℂ ↑ 𝑝𝑚 S
12 simpr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ 0 N ∩ ℤ
13 12 elin2d ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ ℤ
14 12 elin1d ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ 0 N
15 0xr ⊢ 0 ∈ ℝ *
16 nn0re ⊢ N ∈ ℕ 0 → N ∈ ℝ
17 16 rexrd ⊢ N ∈ ℕ 0 → N ∈ ℝ *
18 id ⊢ N = +∞ → N = +∞
19 pnfxr ⊢ +∞ ∈ ℝ *
20 18 19 eqeltrdi ⊢ N = +∞ → N ∈ ℝ *
21 17 20 jaoi ⊢ N ∈ ℕ 0 ∨ N = +∞ → N ∈ ℝ *
22 4 21 syl ⊢ φ → N ∈ ℝ *
23 22 ad2antrr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → N ∈ ℝ *
24 elicc1 ⊢ 0 ∈ ℝ * ∧ N ∈ ℝ * → k ∈ 0 N ↔ k ∈ ℝ * ∧ 0 ≤ k ∧ k ≤ N
25 15 23 24 sylancr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ 0 N ↔ k ∈ ℝ * ∧ 0 ≤ k ∧ k ≤ N
26 14 25 mpbid ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ ℝ * ∧ 0 ≤ k ∧ k ≤ N
27 26 simp2d ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → 0 ≤ k
28 elnn0z ⊢ k ∈ ℕ 0 ↔ k ∈ ℤ ∧ 0 ≤ k
29 13 27 28 sylanbrc ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ∈ ℕ 0
30 dvnf ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → S D n F ⁡ k : dom ⁡ S D n F ⁡ k ⟶ ℂ
31 6 11 29 30 syl3anc ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k : dom ⁡ S D n F ⁡ k ⟶ ℂ
32 5 adantlr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → B ∈ dom ⁡ S D n F ⁡ k
33 31 32 ffvelcdmd ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k ⁡ B ∈ ℂ
34 29 faccld ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ! ∈ ℕ
35 34 nncnd ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ! ∈ ℂ
36 34 nnne0d ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → k ! ≠ 0
37 33 35 36 divcld ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k ⁡ B k ! ∈ ℂ
38 simplr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → X ∈ ℂ
39 2 ad2antrr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → F : A ⟶ ℂ
40 dvnbss ⊢ S ∈ ℝ ℂ ∧ F ∈ ℂ ↑ 𝑝𝑚 S ∧ k ∈ ℕ 0 → dom ⁡ S D n F ⁡ k ⊆ dom ⁡ F
41 6 11 29 40 syl3anc ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → dom ⁡ S D n F ⁡ k ⊆ dom ⁡ F
42 39 41 fssdmd ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → dom ⁡ S D n F ⁡ k ⊆ A
43 recnprss ⊢ S ∈ ℝ ℂ → S ⊆ ℂ
44 1 43 syl ⊢ φ → S ⊆ ℂ
45 3 44 sstrd ⊢ φ → A ⊆ ℂ
46 45 ad2antrr ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → A ⊆ ℂ
47 42 46 sstrd ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → dom ⁡ S D n F ⁡ k ⊆ ℂ
48 47 32 sseldd ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → B ∈ ℂ
49 38 48 subcld ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → X − B ∈ ℂ
50 49 29 expcld ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → X − B k ∈ ℂ
51 37 50 mulcld ⊢ φ ∧ X ∈ ℂ ∧ k ∈ 0 N ∩ ℤ → S D n F ⁡ k ⁡ B k ! ⁢ X − B k ∈ ℂ