(17steps total) PrintForm Definitions Lemmas hol list 2 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: hcons def 1 2 1 1 1 2 2 1

1. 'a : S
2. h : 'a
3. t : hlist('a)
4. n : 
5. n<||t||+1
6. n = 0
7. n>0
8. n-1<||t||
  cons(ht)[n] = t[(n-1)]  'a


By: Thm* a:Tas:T List, i:. 0<i  i||as||  cons(aas)[i] = as[(i-1)]
THEN
StrongAuto
THEN
Try (Complete (Unfold `label` 0))


Generated subgoals:

None

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

(17steps total) PrintForm Definitions Lemmas hol list 2 Sections HOLlib Doc