IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At:
swap adjacent decomp1 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