PrintForm
Definitions
exponent
Sections
AutomataTheory
Doc
At:
fun
enumer
1
2
1
1
1
2
1
1
1
1
1
1.
n:
2.
m:
3.
0 < m
4.
f:
(
(m-1)
n)
(n
m-1)
5.
Bij(
(m-1)
n;
(n
m-1); f)
6.
n = 0
7.
b:
8.
0
b < (n
m)
(0
m) = 0
By:
RWH (LemmaC
Thm*
m:
. (0
m) = 0) 0
Generated subgoals:
None
About:
(m-1)
n)(n
m-1)(m-1)n; (nm-1); f)
b < (nm)
(0m) = 0
m:
. (0m) = 0)
0
