IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
sum split21111 1. n : 2. 0<n 3. f:((n-1)), m:(n-1+1).
3. sum(f(x) | x < n-1) = sum(f(x) | x < m)+sum(f(x+m) | x < n-1-m)
4. f : n 5. m:(n-1+1). sum(f(x) | x < n-1) = sum(f(x) | x < m)+sum(f(x+m) | x < n-1-m)
6. m : (n+1)
7. m = n-1
8. n = 0
sum(f(x+n-1) | x < 1) = f(n-1)
By:
Unfold `sum` 0 THEN Reduce 0
Generated subgoals:
None
About:
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html