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