PrintForm Definitions finite sets Sections AutomataTheory Doc

At: prod fin is fin 1 2 6 2

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

Surj((nn); TT; x. < f(x n),f(x rem n) > )

By:
Unfold `surject` 6
THEN
Analyze 0


Generated subgoal:

16. b:T. a:n. f(a) = b
7. n > 0
8. b: TT
a:(nn). (x. < f(x n),f(x rem n) > )(a) = b


About:
natural_numbermultiplyproductlambdapairapply
divideremainderuniversefunctionexistsequal