(16steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: sum switch 1 2 2 1 2

1. n : 
2. f : n
3. i : (n-1)
4. (ii+1)  nn
  sum(f((ii+1)(x+i)) | x < 2)+sum(f((ii+1)(x+2+i)) | x < n-i-2)
  =
  sum(f(x+i) | x < n-i)


By: Subst' (sum(f((ii+1)(x+i)) | x < 2) = sum(f(x+i) | x < 2)) 0


Generated subgoals:

1   sum(f((ii+1)(x+i)) | x < 2) = sum(f(x+i) | x < 2)
1 step
2   sum(f(x+i) | x < 2)+sum(f((ii+1)(x+2+i)) | x < n-i-2)
  =
  sum(f(x+i) | x < n-i)

4 steps

About:
intnatural_numberaddsubtractapplyfunctionequalmember
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(16steps total) PrintForm Definitions Lemmas mb nat Sections MarkB generic Doc