hol
prim
rec
Sections
HOLlib
Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
Theorem
Name
Thm*
n
:
. 0<
n
+1
[less_0]
cites the following:
Thm*
all(
n
:hnum. lt(0,suc(
n
)))
[hless_0]
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
hol
prim
rec
Sections
HOLlib
Doc
n:
. 0<n+1
n:hnum. lt(0,suc(n)))n:. 0<n+1n:hnum. lt(0,suc(n)))