(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

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


By: BackThru
Thm* n:f,g:(n).
Thm* (i:nf(i) = g(i))  sum(f(x) | x < n) = sum(g(x) | x < n)


Generated subgoal:

1 5. i1 : i
  f((ii+1)(i1)) = f(i1)

1 step

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