(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
1. A : Type
2. L : A List
3. 1<||L||
  L = [L[0]; L[1] / tl(tl(L))]
By: AssertBY (||tl(tl(L))|| = ||L||-2)
(Repeat (RWW Thm* l:A List. ||l||1  ||tl(l)|| = ||l||-1   0))
THEN
BackThru
Thm* a,b:T List. ||a|| = ||b||    (i:. i<||a||  a[i] = b[i])  a = b

Generated subgoals:

1 4. ||tl(tl(L))|| = ||L||-2  
  ||L|| = ||[L[0]; L[1] / tl(tl(L))]||  
1 step
2 4. ||tl(tl(L))|| = ||L||-2  
  i:. i<||L||  L[i] = [L[0]; L[1] / tl(tl(L))][i]
7 steps

About:
listconsconsintnatural_numbersubtractless_thanuniverseequalimpliesall
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