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