Some definitions of interest.
hanoi_PEG	Def  Peg == {1...3}
	Thm*  Peg  Type
hanoi_general_exists_lemma2PROG	Def  HanoiHelper(n; s1; f; s2; g) Def  == <s1(?) {to n-1}  f {to n},s2(?) {to n-1}  g {to n}>
	Thm*  n:, a:, z:{a...}, m:{a...z-1}, f,g:({1...n}Peg), Thm*  s1:({a...m}{1...n-1}Peg), s2:({m+1...z}{1...n-1}Peg). Thm*  HanoiHelper(n; s1; f; s2; g) Thm*   ({a...m}{1...n}Peg)({m+1...z}{1...n}Peg)
int_iseg	Def  {i...j} == {k:| ik & kj }
	Thm*  i,j:. {i...j}  Type
int_upper	Def  {i...} == {j:| ij }
	Thm*  n:. {n...}  Type
nat_plus	Def   == {i:| 0<i }
	Thm*    Type

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