PrintForm Definitions finite sets Sections AutomataTheory Doc

At: prod fin is fin 1 2

1. T: Type
2. t: T
3. n:
4. f: nT
5. Bij(n; T; f)
6. n > 0

n:, f:(nTT). Bij(n; TT; f)

By: InstConcl [nn;x. < f(x n),f(x rem n) > ]

Generated subgoals:

1 0nn
27. x: (nn)
0(x n)
37. x: (nn)
(x n) < n
47. x: (nn)
0(x rem n)
57. x: (nn)
(x rem n) < n
6 Bij((nn); TT; x. < f(x n),f(x rem n) > )


About:
existsfunctionnatural_numberproductmultiplylambda
pairapplydivideremainderuniverseless_than