Def exp(m;n) == if n=0 then 1 else mexp(m;n-1) fi   (recursive)

is mentioned by

Thm* x,q,n,m:. nexp(q+1;x) = mexp(q+1;x)    n = m	[mult_exp_mono]
Thm* x,q,n:. exp(n;x+q) = exp(n;x)exp(n;q)	[exp_add]

In prior sections: hol arithmetic 1

Try larger context: HOLlib IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html