PrintForm
Definitions
finite
sets
Sections
AutomataTheory
Doc
At:
rect
enumer
1
3
1
2
1
1
1
2
1
1
1
1
1.
n:
2.
m:
3.
b:
4.
0
b
5.
(b
m)
m+(b rem m) < n
m
6.
b = (b
m)
m+(b rem m)
(b
m) < n
By:
Inst
Thm*
a:
, n:
. 0
(a rem n) & (a rem n) < n [b;m]
Generated subgoal:
1
7.
0
(b rem m) & (b rem m) < m
(b
m) < n
About:
(b rem m) & (b rem m) < m
(b 
m) < n
b m)
m+(b rem m) < nm m)m+(b rem m) (b m) < n
a:, n:. 0(a rem n) & (a rem n) < n
[b;m](b rem m) & (b rem m) < m (b m) < n
