(12steps total) PrintForm Definitions Lemmas mb list 1 Sections MarkB generic Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: nth tl decomp 4 2 2 1

1. T : Type
2. m : 
3. 0<m
4. L:T List. m-1<||L||  (nth_tl(m-1;L) ~ [L[(m-1)] / nth_tl(1+m-1;L)])
5. L : T List
6. m<||L||
7. 0<m
8. 0<1+m
9. nth_tl(m-1;tl(L)) ~ [tl(L)[(m-1)] / nth_tl(1+m-1;tl(L))]
  tl(L)[(m-1)] ~ hd(nth_tl(m;L))


By: Unfold `select` 0 THEN Analyze


Generated subgoal:

1   nth_tl(m-1;tl(L)) ~ nth_tl(m;L)
1 step

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

(12steps total) PrintForm Definitions Lemmas mb list 1 Sections MarkB generic Doc