Some definitions of interest.
is_leaf	Def is_leaf(t) == Case(t) Case tree_leaf(l) => true Default => false
	Thm* E:Type, t:Tree(E). is_leaf(t)
leaf_value	Def leaf_value(t) == Case(t) Case tree_leaf(l) => l Default => True
	Thm* E:Type, t:Tree(E). is_leaf(t)  leaf_value(t)  E
tree	Def Tree(E) == rec(T.tree_con(E;T))
	Thm* E:Type. Tree(E)  Type
tree_leaf	Def tree_leaf(x) == inl(x)
	Thm* E,T:Type, x:E. tree_leaf(x)  tree_con(E;T)
	Thm* E:Type, x:E. tree_leaf(x)  Tree(E)

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