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


By: Unab [`rep_list`] THEN Simp THEN StrongAuto THEN BifCase THEN Simp
THEN
StrongAuto


Generated subgoal:

1 8. n-1<||t||
  cons(ht)[n] = t[(n-1)]  'a

1 step

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