(5steps total) PrintForm Definitions hol arithmetic 2 Sections HOLlib Doc
IF YOU CAN SEE THIS go to /sfa/Nuprl/Shared/Xindentation_hack_doc.html
At: hgreater or eq 1

1. m : 
2. n : 
  (nm) = (n<m  (m = n))


By: Simpsetp [`bequal`] THEN StrongAuto THEN Try (Complete (Unfold `label` 0))


Generated subgoals:

1 3. nm
  n<m  m = n

2 steps
2 3. n<m  m = n
  nm

1 step

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

(5steps total) PrintForm Definitions hol arithmetic 2 Sections HOLlib Doc