(27steps 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: swap adjacent decomp 1

1. A : Type
  L:A List. 
  0+1<||L||
  
  (X,Y:A List.
  (L = (X @ [L[0]; L[(0+1)]] @ Y) & swap(L;0;0+1) = (X @ [L[(0+1)]; L[0]] @ Y))


By: Reduce 0 THEN InstConcl [nil;tl(tl(L))] THEN Reduce 0


Generated subgoals:

1 2. L : A List
3. 1<||L||
  L = [L[0]; L[1] / tl(tl(L))]

9 steps
2 2. L : A List
3. 1<||L||
  swap(L;0;1) = [L[1]; L[0] / tl(tl(L))]

9 steps

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

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