Metamath Proof Explorer


Theorem bpolycl

Description: Closure law for Bernoulli polynomials. (Contributed by Scott Fenton, 16-May-2014) (Proof shortened by Mario Carneiro, 22-May-2014)

Ref Expression
Assertion bpolycl ⊢ N ∈ ℕ 0 ∧ X ∈ ℂ → N BernPoly X ∈ ℂ

Proof

Step Hyp Ref Expression
1 oveq1 ⊢ n = k → n BernPoly X = k BernPoly X
2 1 eleq1d ⊢ n = k → n BernPoly X ∈ ℂ ↔ k BernPoly X ∈ ℂ
3 2 imbi2d ⊢ n = k → X ∈ ℂ → n BernPoly X ∈ ℂ ↔ X ∈ ℂ → k BernPoly X ∈ ℂ
4 oveq1 ⊢ n = N → n BernPoly X = N BernPoly X
5 4 eleq1d ⊢ n = N → n BernPoly X ∈ ℂ ↔ N BernPoly X ∈ ℂ
6 5 imbi2d ⊢ n = N → X ∈ ℂ → n BernPoly X ∈ ℂ ↔ X ∈ ℂ → N BernPoly X ∈ ℂ
7 r19.21v ⊢ ∀ k ∈ 0 … n − 1 X ∈ ℂ → k BernPoly X ∈ ℂ ↔ X ∈ ℂ → ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ
8 bpolyval ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ → n BernPoly X = X n − ∑ m = 0 n − 1 ( n m) ⁢ m BernPoly X n - m + 1
9 8 3adant3 ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n BernPoly X = X n − ∑ m = 0 n − 1 ( n m) ⁢ m BernPoly X n - m + 1
10 simp2 ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → X ∈ ℂ
11 simp1 ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n ∈ ℕ 0
12 10 11 expcld ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → X n ∈ ℂ
13 fzfid ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → 0 … n − 1 ∈ Fin
14 elfzelz ⊢ m ∈ 0 … n − 1 → m ∈ ℤ
15 bccl ⊢ n ∈ ℕ 0 ∧ m ∈ ℤ → ( n m) ∈ ℕ 0
16 11 14 15 syl2an ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → ( n m) ∈ ℕ 0
17 16 nn0cnd ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → ( n m) ∈ ℂ
18 oveq1 ⊢ k = m → k BernPoly X = m BernPoly X
19 18 eleq1d ⊢ k = m → k BernPoly X ∈ ℂ ↔ m BernPoly X ∈ ℂ
20 19 rspccva ⊢ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → m BernPoly X ∈ ℂ
21 20 3ad2antl3 ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → m BernPoly X ∈ ℂ
22 fzssp1 ⊢ 0 … n − 1 ⊆ 0 … n - 1 + 1
23 11 nn0cnd ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n ∈ ℂ
24 ax-1cn ⊢ 1 ∈ ℂ
25 npcan ⊢ n ∈ ℂ ∧ 1 ∈ ℂ → n - 1 + 1 = n
26 23 24 25 sylancl ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n - 1 + 1 = n
27 26 oveq2d ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → 0 … n - 1 + 1 = 0 … n
28 22 27 sseqtrid ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → 0 … n − 1 ⊆ 0 … n
29 28 sselda ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → m ∈ 0 … n
30 fznn0sub ⊢ m ∈ 0 … n → n − m ∈ ℕ 0
31 nn0p1nn ⊢ n − m ∈ ℕ 0 → n - m + 1 ∈ ℕ
32 29 30 31 3syl ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → n - m + 1 ∈ ℕ
33 32 nncnd ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → n - m + 1 ∈ ℂ
34 32 nnne0d ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → n - m + 1 ≠ 0
35 21 33 34 divcld ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → m BernPoly X n - m + 1 ∈ ℂ
36 17 35 mulcld ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ ∧ m ∈ 0 … n − 1 → ( n m) ⁢ m BernPoly X n - m + 1 ∈ ℂ
37 13 36 fsumcl ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → ∑ m = 0 n − 1 ( n m) ⁢ m BernPoly X n - m + 1 ∈ ℂ
38 12 37 subcld ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → X n − ∑ m = 0 n − 1 ( n m) ⁢ m BernPoly X n - m + 1 ∈ ℂ
39 9 38 eqeltrd ⊢ n ∈ ℕ 0 ∧ X ∈ ℂ ∧ ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n BernPoly X ∈ ℂ
40 39 3exp ⊢ n ∈ ℕ 0 → X ∈ ℂ → ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → n BernPoly X ∈ ℂ
41 40 a2d ⊢ n ∈ ℕ 0 → X ∈ ℂ → ∀ k ∈ 0 … n − 1 k BernPoly X ∈ ℂ → X ∈ ℂ → n BernPoly X ∈ ℂ
42 7 41 biimtrid ⊢ n ∈ ℕ 0 → ∀ k ∈ 0 … n − 1 X ∈ ℂ → k BernPoly X ∈ ℂ → X ∈ ℂ → n BernPoly X ∈ ℂ
43 3 6 42 nn0sinds ⊢ N ∈ ℕ 0 → X ∈ ℂ → N BernPoly X ∈ ℂ
44 43 imp ⊢ N ∈ ℕ 0 ∧ X ∈ ℂ → N BernPoly X ∈ ℂ