Who Cites decidable?
decidable	Def Dec(P) == P P
	Thm* A:Prop. Dec(A) Prop
equivalence	Def {T} == {f:(TT)| (x:T. (f(x,x))) & (x,y:T. (f(x,y)) (f(y,x))) & (x,y,z:T. (f(x,y)) (f(y,z)) (f(x,z))) }
	Thm* T:Type{i}. {T} Type{i'}
list_iso	Def L1(~eq)L2 == L1(eq)L2 & L2(eq)L1
	Thm* T:Type, eq:{T}, L1,L2:T List. L1(~eq)L2 Type
sublist	Def L1(eq)L2 == xL1.x(eq) L2
	Thm* T:Type, eq:(TT), L1,L2:T List. L1(eq)L2 Type
	Thm* T:Type, eq:{T=}, L1,L2:T List. L1(eq)L2 Type
	Thm* T:Type, eq:{T}, L1,L2:T List. L1(eq)L2 Type
not	Def A == A False
	Thm* A:Prop. (A) Prop
assert	Def b == if b True else False fi
	Thm* b:. b Prop
iff	Def P Q == (P Q) & (P Q)
	Thm* A,B:Prop. (A B) Prop
is_member	Def x(eq) L == (letrec is_member x eq L = (Case of L; nil false ; h.t if eq(x,h) true else is_member(x,eq,t) fi) ) (x,eq,L)
	Thm* T:Type, eq:(TT), u:T. u(eq) nil
	Thm* T:Type, eq:(TT), x:T, L:T List. x(eq) L
list_all	Def xL.P(x) == (letrec list_all L = (Case of L; nil True ; h.t P(h) & list_all(t)) ) (L)
	Thm* T:Type, P:(TProp), L:T List. xL.P(x) Type
	Thm* T:Type, P:(TType). xnil.P(x) Type
rev_implies	Def P Q == Q P
	Thm* A,B:Prop. (A B) Prop
letrec_body	Def = b == b
letrec_arg	Def x b(x) (x) == b(x)
letrec	Def (letrec f b(f)) == b((letrec f b(f)) ) (recursive)

About: