Metamath Proof Explorer


Theorem arisum

Description: Arithmetic series sum of the first N positive integers. This is Metamath 100 proof #68. (Contributed by FL, 16-Nov-2006) (Proof shortened by Mario Carneiro, 22-May-2014)

Ref Expression
Assertion arisum ⊢ N ∈ ℕ 0 → ∑ k = 1 N k = N 2 + N 2

Proof

Step Hyp Ref Expression
1 elnn0 ⊢ N ∈ ℕ 0 ↔ N ∈ ℕ ∨ N = 0
2 1zzd ⊢ N ∈ ℕ → 1 ∈ ℤ
3 nnz ⊢ N ∈ ℕ → N ∈ ℤ
4 elfzelz ⊢ k ∈ 1 … N → k ∈ ℤ
5 4 zcnd ⊢ k ∈ 1 … N → k ∈ ℂ
6 5 adantl ⊢ N ∈ ℕ ∧ k ∈ 1 … N → k ∈ ℂ
7 id ⊢ k = j + 1 → k = j + 1
8 2 2 3 6 7 fsumshftm ⊢ N ∈ ℕ → ∑ k = 1 N k = ∑ j = 1 − 1 N − 1 j + 1
9 1m1e0 ⊢ 1 − 1 = 0
10 9 oveq1i ⊢ 1 − 1 … N − 1 = 0 … N − 1
11 10 sumeq1i ⊢ ∑ j = 1 − 1 N − 1 j + 1 = ∑ j = 0 N − 1 j + 1
12 8 11 eqtrdi ⊢ N ∈ ℕ → ∑ k = 1 N k = ∑ j = 0 N − 1 j + 1
13 elfznn0 ⊢ j ∈ 0 … N − 1 → j ∈ ℕ 0
14 13 adantl ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → j ∈ ℕ 0
15 bcnp1n ⊢ j ∈ ℕ 0 → ( j + 1 j) = j + 1
16 14 15 syl ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → ( j + 1 j) = j + 1
17 14 nn0cnd ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → j ∈ ℂ
18 ax-1cn ⊢ 1 ∈ ℂ
19 addcom ⊢ j ∈ ℂ ∧ 1 ∈ ℂ → j + 1 = 1 + j
20 17 18 19 sylancl ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → j + 1 = 1 + j
21 20 oveq1d ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → ( j + 1 j) = ( 1 + j j)
22 16 21 eqtr3d ⊢ N ∈ ℕ ∧ j ∈ 0 … N − 1 → j + 1 = ( 1 + j j)
23 22 sumeq2dv ⊢ N ∈ ℕ → ∑ j = 0 N − 1 j + 1 = ∑ j = 0 N − 1 ( 1 + j j)
24 1nn0 ⊢ 1 ∈ ℕ 0
25 nnm1nn0 ⊢ N ∈ ℕ → N − 1 ∈ ℕ 0
26 bcxmas ⊢ 1 ∈ ℕ 0 ∧ N − 1 ∈ ℕ 0 → ( 1 + 1 + N − 1 N − 1 ) = ∑ j = 0 N − 1 ( 1 + j j)
27 24 25 26 sylancr ⊢ N ∈ ℕ → ( 1 + 1 + N − 1 N − 1 ) = ∑ j = 0 N − 1 ( 1 + j j)
28 23 27 eqtr4d ⊢ N ∈ ℕ → ∑ j = 0 N − 1 j + 1 = ( 1 + 1 + N − 1 N − 1 )
29 1cnd ⊢ N ∈ ℕ → 1 ∈ ℂ
30 nncn ⊢ N ∈ ℕ → N ∈ ℂ
31 29 29 30 ppncand ⊢ N ∈ ℕ → 1 + 1 + N − 1 = 1 + N
32 29 30 31 comraddd ⊢ N ∈ ℕ → 1 + 1 + N − 1 = N + 1
33 32 oveq1d ⊢ N ∈ ℕ → ( 1 + 1 + N − 1 N − 1 ) = ( N + 1 N − 1 )
34 nnnn0 ⊢ N ∈ ℕ → N ∈ ℕ 0
35 bcp1m1 ⊢ N ∈ ℕ 0 → ( N + 1 N − 1 ) = N + 1 ⋅ N 2
36 34 35 syl ⊢ N ∈ ℕ → ( N + 1 N − 1 ) = N + 1 ⋅ N 2
37 sqval ⊢ N ∈ ℂ → N 2 = N ⋅ N
38 37 eqcomd ⊢ N ∈ ℂ → N ⋅ N = N 2
39 mullid ⊢ N ∈ ℂ → 1 ⋅ N = N
40 38 39 oveq12d ⊢ N ∈ ℂ → N ⋅ N + 1 ⋅ N = N 2 + N
41 30 40 syl ⊢ N ∈ ℕ → N ⋅ N + 1 ⋅ N = N 2 + N
42 30 30 29 41 joinlmuladdmuld ⊢ N ∈ ℕ → N + 1 ⋅ N = N 2 + N
43 42 oveq1d ⊢ N ∈ ℕ → N + 1 ⋅ N 2 = N 2 + N 2
44 33 36 43 3eqtrd ⊢ N ∈ ℕ → ( 1 + 1 + N − 1 N − 1 ) = N 2 + N 2
45 12 28 44 3eqtrd ⊢ N ∈ ℕ → ∑ k = 1 N k = N 2 + N 2
46 oveq2 ⊢ N = 0 → 1 … N = 1 … 0
47 fz10 ⊢ 1 … 0 = ∅
48 46 47 eqtrdi ⊢ N = 0 → 1 … N = ∅
49 48 sumeq1d ⊢ N = 0 → ∑ k = 1 N k = ∑ k ∈ ∅ k
50 sum0 ⊢ ∑ k ∈ ∅ k = 0
51 49 50 eqtrdi ⊢ N = 0 → ∑ k = 1 N k = 0
52 sq0i ⊢ N = 0 → N 2 = 0
53 id ⊢ N = 0 → N = 0
54 52 53 oveq12d ⊢ N = 0 → N 2 + N = 0 + 0
55 00id ⊢ 0 + 0 = 0
56 54 55 eqtrdi ⊢ N = 0 → N 2 + N = 0
57 56 oveq1d ⊢ N = 0 → N 2 + N 2 = 0 2
58 2cn ⊢ 2 ∈ ℂ
59 2ne0 ⊢ 2 ≠ 0
60 58 59 div0i ⊢ 0 2 = 0
61 57 60 eqtrdi ⊢ N = 0 → N 2 + N 2 = 0
62 51 61 eqtr4d ⊢ N = 0 → ∑ k = 1 N k = N 2 + N 2
63 45 62 jaoi ⊢ N ∈ ℕ ∨ N = 0 → ∑ k = 1 N k = N 2 + N 2
64 1 63 sylbi ⊢ N ∈ ℕ 0 → ∑ k = 1 N k = N 2 + N 2