Some definitions of interest.
gt	Def i>j == j<i
	Thm* i,j:. (i>j)  Prop
int_lower	Def {...i} == {j:| ji }
	Thm* i:. {...i}  Type
int_upper	Def {i...} == {j:| ij }
	Thm* n:. {n...}  Type
wellfounded	Def WellFnd{i}(A;x,y.R(x;y)) Def == P:(AProp). (j:A. (k:A. R(k;j)  P(k))  P(j))  {n:A. P(n)}
	Thm* A:Type{i}, r:(AAProp{i}). WellFnd{i}(A;x,y.r(x,y))  Prop{i'}

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