PrintForm
Definitions
exponent
Sections
AutomataTheory
Doc
At:
fun
enumer
1
2
1
1
1
2
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
Surj(
m
n;
(n
m);
z.z(0))
By:
Unfold `surject` 0
Generated subgoal:
1
b:
(n
m).
a:(
m
n). (
z.z(0))(a) = b
About:
b:
(n
m). 
a:(m
n). (
z.z(0))(a) = b
(m-1)n)(nm-1)(m-1)n; (nm-1); f) Surj(mn; (nm); z.z(0)) b:(nm). a:(mn). (z.z(0))(a) = b
