PrintForm Definitions exponent Sections AutomataTheory Doc

At: fun enumer 1 2 1 2 2 1 2 1 1 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)

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

By:
Unfold `inject` 0
THEN
Reduce 0
THEN
UnivCD


Generated subgoal:

19. a1: mn
10. a2: mn
11. f1( < a1(m-1),f(a1) > ) = f1( < a2(m-1),f(a2) > )
a1 = a2


About:
functionnatural_numberlambdaapplypairsubtract
intless_thanequalproductmultiply