PrintForm
Definitions
exponent
Sections
AutomataTheory
Doc
At:
fun
enumer
1
2
1
2
2
1
2
1
1
2
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.
f1:
n
(n
m-1)
(n
m)
8.
Bij(
n
(n
m-1);
(n
(n
m-1)); f1)
9.
b:
(n
m)
a:(
m
n). (
z.f1( < z(m-1),f(z) > ))(a) = b
By:
Reduce 0
Generated subgoal:
1
a:(
m
n). f1( < a(m-1),f(a) > ) = b
About:
a:(
m
n). f1( < a(m-1),f(a) > ) = b
(m-1)n)(n
m-1)(m-1)n; (nm-1); f)
n = 0n
(nm-1)(nm)n(nm-1); (n
(nm-1)); f1)(nm) a:(mn). (
z.f1( < z(m-1),f(z) > ))(a) = b a:(mn). f1( < a(m-1),f(a) > ) = b
