NOTE:

This operator coercing a to a Prop is normally invisible since it is pretty obvious when it is needed.

	Who Cites assert?
assert	Def b == if b True else False fi
	Thm* b:. b Prop
bnot	Def b == if b false else true fi
	Thm* b:. b
decidable	Def Dec(P) == P P
	Thm* A:Prop. Dec(A) 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
not	Def A == A False
	Thm* A:Prop. (A) 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: