PrintForm Definitions exponent Sections AutomataTheory Doc

At: fun enumer 1 2 1 2 2

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. f:(n(nm-1)(n(nm-1))). Bij(n(nm-1); (n(nm-1)); f)

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

By: Analyze 7

Generated subgoal:

17. f1: n(nm-1)(n(nm-1))
8. Bij(n(nm-1); (n(nm-1)); f1)
f:((mn)(nm)). Bij(mn; (nm); f)


About:
existsfunctionnatural_numberintless_than
subtractequalproductmultiply