PrintForm Definitions exponent Sections AutomataTheory Doc

At: fun enumer 1 2 1 2 2 1 2 1

1. n:
2. m:
3. 0 < m
4. f: ((m-1)n)(nm-1)
5. Bij((m-1)n; (nm-1); f)
6. n = 0
7. f1: n(nm-1)(nm)
8. Bij(n(nm-1); (n(nm-1)); f1)

f:((mn)(nm)). Bij(mn; (nm); f)

By: Witness z.f1( < z(m-1),f(z) > )

Generated subgoal:

1 Bij(mn; (nm); z.f1( < z(m-1),f(z) > ))


About:
existsfunctionnatural_numberlambdaapplypair
subtractintless_thanequalproductmultiply