PrintForm Definitions exponent Sections AutomataTheory Doc

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

b:(nm). a:(mn). (z.z(0))(a) = b

By: Analyze 0

Generated subgoal:

17. b: (nm)
a:(mn). (z.z(0))(a) = b


About:
allnatural_numberexistsfunctionequal
applylambdaintless_thansubtract