(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

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


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


Generated subgoals:

1   sum(f((ii+1)(x)) | x < i) = sum(f(x) | x < i)
2 steps
2   sum(f(x) | x < i)+sum(f((ii+1)(x+i)) | x < n-i) = sum(f(x) | x < n)
10 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