Def		i>j	[gt]	core
Def		True	[true]	core
Def		P  Q	[iff]	core
Def		Prop	[prop]	core
Def		hbool	[hbool]	hol min
Def		S	[stype]	hol
Def		simp_rec_fun	[hsimp_rec_fun]
Def		not	[hnot]	hol bool
Def		suc	[hsuc]	hol num
Def		implies	[himplies]	hol min
Def		and	[hand]	hol bool
Def		exists	[hexists]	hol bool
Def		lt	[hlt]
Def		equal	[hequal]	hol min
Def		all	[hall]	hol bool
Def		select	[hselect]	hol min
Def		exists_unique	[hexists_unique]	hol bool
Def		@x:'a. p(x)	[bchoose]	hol min
Def		b_exists_unique('a;x.p(x))	[b_exists_unique]	hol bool
Def		x:T. P(x)	[bexists]	hol
Def		x:T. P(x)	[ball]	hol
Def		b	[assert]	bool 1
Def		cond	[hcond]	hol bool
Def		pre	[hpre]
Def		prim_rec	[hprim_rec]
Def		or	[hor]	hol bool
Def		simp_rec_rel	[hsimp_rec_rel]
Def		prim_rec_fun	[hprim_rec_fun]
Def		hnum	[hnum]	hol num
Def		simp_rec	[hsimp_rec]
Def			[nat]	int 1
Def		AB	[le]	core
Def		A	[not]	core
Def		P  Q	[or]	core
Def		x:A. B(x)	[exists]	core
Def		ncompose(f;n;x)	[ncompose]	hol num
Def		pre(n)	[pre]
Def		i=j	[eq_int]	bool 1
Def		bif(b; bx.x(bx); by.y(by))	[bif]	hol
Def		i<j	[lt_int]	bool 1
Def		x:T. b(x)	[tlambda]	fun 1
Def		P  Q	[implies]	core
Def		x:A. B(x)	[all]	core
Def		P & Q	[and]	core
Def		x = y	[bequal]	hol
Def		P	[prop_to_bool]	hol
Def		'a  'b	[hfun]	hol min
Def		P  Q	[rev_implies]	core
Def		pq	[bimplies]	bool 1
Def		b	[bnot]	bool 1
Def		pq	[band]	bool 1
Def		p  q	[bor]	bool 1
Def		@x:T. P(x)	[choose]	hol
Def		arb(T)	[arb]	hol

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