(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 1

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


By: BackThru
Thm* n:f:(n), m:(n+1).
Thm* sum(f(x) | x < n) = sum(f(x) | x < m)+sum(f(x+m) | x < n-m)
THEN
Try (Complete Auto)


Generated subgoals:

None

About:
intnatural_numberaddsubtractapplyfunctionequalmemberall
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