PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
rect
enumer
1
3
1
2
1
1
1
1.
n:
2.
m:
3.
b:
(n
m)
a:(
n
m). 1of(a)
m+2of(a) = b
(n
m)
By:
Witness < b
m,b rem m >
Generated subgoals:
1
0
(b
m)
2
(b
m) < n
3
0
(b rem m)
4
(b rem m) < m
5
1of( < b
m,b rem m > )
m+2of( < b
m,b rem m > ) = b
(n
m)
6
4.
a:
n
m
0
1of(a)
m+2of(a)
7
4.
a:
n
m
1of(a)
m+2of(a) < n
m
About: