(7steps total) PrintForm Definitions Lemmas list 1 Sections StandardLIB Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: select nth tl 2 1

1. T : Type
2. T List
3. u : T
4. v : T List
5. n:{0...||v||}, i:(||v||-n). nth_tl(n;v)[i] = v[(i+n)]
6. n : {0...||v||+1}
7. i : (||v||+1-n)
8. n0
  (u.v)[i] = (u.v)[(i+n)]


By: Assert (n = 0)


Generated subgoal:

1 9. n = 0
  (u.v)[i] = (u.v)[(i+n)]

1 step

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

(7steps total) PrintForm Definitions Lemmas list 1 Sections StandardLIB Doc