mb list 2 Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
RankTheoremName
4Thm* n:f:(n), p:(nn).
Thm* Bij(nnp sum(f(p(x)) | x < n) = sum(f(x) | x < n)
[permute_sum]
cites the following:
3Thm* k:p:(kk). Bij(kkp (L:(k-1) List. p = compose_flips(L))[permute_by_flips]
0Thm* n:f,g:(n).
Thm* (i:nf(i) = g(i))  sum(f(x) | x < n) = sum(g(x) | x < n)
[sum_functionality]
1Thm* n:f:(n), i:(n-1). sum(f((ii+1)(x)) | x < n) = sum(f(x) | x < n)[sum_switch]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
mb list 2 Sections MarkB generic Doc