I don't know about proofing, but you can derive the formula from known statements and a cute thing where you add the series to the reverse order of itself to produce n terms that are all the same and then divide by 2. Notice that each successive term is d more than the previous, and the nth term would have (n - 1) of the d amount since the first term has zero d, the second has one d, the third has two d, etc., so that each term has one less d than its order number in the list.
Sn = a + (a + d) + (a + 2d) + ... + (a + (n-2)d) + (a + (n-1)d)
Sn = (a + (n-1)d) + (a + (n-2)d)+ ... + (a + 2d) + (a + d) + a