Thms
finite
sets
Sections
AutomataTheory
Doc
eq_int
Def
i=
j == if i=j
true
; false
fi
Thm*
i,j:
. i=
j
int_seg
Def
{i..j
} == {k:
| i
k < j }
Thm*
m,n:
. {m..n
}
Type
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: