Who Cites ma-is-empty?
ma-is-empty	Def ma-is-empty(M) Def == fpf-is-empty(1of(M))fpf-is-empty(1of(2of(M))) Def == fpf-is-empty(1of(2of(2of(M))))fpf-is-empty(1of(2of(2of(2of(M))))) Def == fpf-is-empty(1of(2of(2of(2of(2of(M)))))) Def == fpf-is-empty(1of(2of(2of(2of(2of(2of(M))))))) Def == fpf-is-empty(1of(2of(2of(2of(2of(2of(2of(M)))))))) Def == fpf-is-empty(1of(2of(2of(2of(2of(2of(2of(2of(M)))))))))
pi2	Def 2of(t) == t.2
	Thm* A:Type, B:(AType), p:(a:AB(a)). 2of(p)  B(1of(p))
fpf-is-empty	Def fpf-is-empty(f) == ||1of(f)||=0
pi1	Def 1of(t) == t.1
	Thm* A:Type, B:(AType), p:(a:AB(a)). 1of(p)  A
band	Def pq == if p q else false fi
	Thm* p,q:. (pq)
length	Def ||as|| == Case of as; nil  0 ; a.as'  ||as'||+1  (recursive)
	Thm* A:Type, l:A List. ||l||
	Thm* ||nil||
eq_int	Def i=j == if i=j true ; false fi
	Thm* i,j:. (i=j)

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