(14steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: permute sum

  n:f:(n), p:(nn).
  Bij(nnp sum(f(p(x)) | x < n) = sum(f(x) | x < n)


By: Auto
THEN
FwdThru
Thm* k:p:(kk). Bij(kkp (L:(k-1) List. p = compose_flips(L))
[-1]
THEN
ExRepD
THEN
HypSubst -1 0
THEN
AllHyps Thin


Generated subgoal:

1 1. n : 
2. f : n
3. L : (n-1) List
  sum(f(compose_flips(L)(x)) | x < n) = sum(f(x) | x < n)

13 steps

About:
listintnatural_numbersubtractapplyfunctionequalimpliesallexists
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html

(14steps total) PrintForm Definitions Lemmas mb list 2 Sections MarkB generic Doc