PrintForm Definitions finite sets Sections AutomataTheory Doc

At: prod fin is fin 1 2 6 2 1 1 1 3
1. T: Type
2. t: T
3. n:
4. f: nT
5. Inj(n; T; f)
6. b:T. a:n. f(a) = b
7. n > 0
8. b1: T
9. b2: T
10. a: n
11. f(a) = b1
12. a1: n
13. f(a1) = b2

(x. < f(x n),f(x rem n) > )(an+a1) = < b1,b2 >
By:
Reduce 0
THEN
Analyze
Generated subgoals:

1 f((an+a1) n) = b1
2 f((an+a1) rem n) = b2

About:
equalproductapplylambdapairdivideremainder
addmultiplyuniversefunctionnatural_numberallexists