finite
sets
Sections
AutomataTheory
Doc
Def
Bij(A; B; f) == Inj(A; B; f) & Surj(A; B; f)
Thm*
n,m:
.
f:(
n
m
(n
m)). Bij(
n
m;
(n
m); f) rect_enumer
In prior sections:
fun
1
n,m:
. 
f:(n
m
(n
m)). Bij(nm; (nm); f) rect_enumer
n,m:. f:(nm(nm)). Bij(nm; (nm); f) rect_enumer