Thms
action
sets
Sections
AutomataTheory
Doc
factorial
Def
(n)! == if n=
0
1 else n
(n-1)! fi (recursive)
Thm*
n:
. (n)!
nat
Def
== {i:
| 0
i }
Thm*
Type
eq_int
Def
i=
j == if i=j
true
; false
fi
Thm*
i,j:
. i=
j
le
Def
A
B ==
B < A
Thm*
i,j:
. i
j
Prop
not
Def
A == A
False
Thm*
A:Prop. (
A)
Prop
About: