(46steps total) PrintForm Definitions hol num Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: num iso 4 1 2 1

1. x : 
2. x':x = ncompose(suc_rep;x';zero_rep)
3. m : 
4. 0<m
5. is_num_rep(ncompose(suc_rep;m-1;zero_rep))
  is_num_rep(suc_rep(ncompose(suc_rep;m-1;zero_rep)))


By: Unab [`his_num_rep`] THEN Simp THEN StrongAuto


Generated subgoal:

1 5. P:(). 
5. P(zero_rep) & (n:P(n P(suc_rep(n)))
5. 
5. P(ncompose(suc_rep;m-1;zero_rep))
6. P : 
7. P(zero_rep)
8. n:P(n P(suc_rep(n))
  P(suc_rep(ncompose(suc_rep;m-1;zero_rep)))

3 steps

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

(46steps total) PrintForm Definitions hol num Sections HOLlib Doc