mb nat Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
RankTheoremName
3Thm* n,k:c:(nk).
Thm* p:(k( List)). 
Thm* sum(||p(j)|| | j < k) = n
Thm* & (j:kx,y:||p(j)||. x<y  (p(j))[x]>(p(j))[y])
Thm* & (j:kx:||p(j)||. (p(j))[x]<n & c((p(j))[x]) = j)
[finite-partition]
cites the following:
0Thm* n:a:. sum(a | x < n) = an[sum_constant]
0Thm* n:f,g:(n).
Thm* (i:nf(i) = g(i))  sum(f(x) | x < n) = sum(g(x) | x < n)
[sum_functionality]
0Thm* k:f,g:(k), p:(k).
Thm* sum(if p(i) f(i)+g(i) else f(i) fi | i < k)
Thm* =
Thm* sum(f(i) | i < k)+sum(if p(i) g(i) else 0 fi | i < k)
[sum-ite]
2Thm* n:f:(n), m:n.
Thm* (x:nx = m  f(x) = 0)  sum(f(x) | x < n) = f(m)
[singleton_support_sum]
0Thm* a:Tas:T List, i:. 0<i  i||as||  [a / as][i] = as[(i-1)][select_cons_tl]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
mb nat Sections MarkB generic Doc