Thms
grammar
1
Sections
AutomataTheory
Doc
lelt
Def
i
j < k == i
j & j < k
le
Def
A
B ==
B < A
Thm*
i,j:
. i
j
Prop
not
Def
A == A
False
Thm*
A:Prop. (
A)
Prop
About:
j < k == ij & j < k
B == 
B < A
i,j:
. ij 
PropA == A 
False
A:Prop. (A) Prop j < k == ij & j < k
B == B < A
A == A False
