(31steps 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 by flips 2 1

1. k : 
2. 0<k
3. p:((k-1)(k-1)). 
3. Bij((k-1); (k-1); p (L:(k-1-1) List. p = compose_flips(L))
4. p : kk
5. Bij(kkp)
  x:kp(x) = k-1


By: Unfold `biject` -1 THEN Unfold `surject` -1


Generated subgoal:

1 5. Inj(kkp)
6. b:ka:kp(a) = b
  x:kp(x) = k-1

2 steps

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

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