Nuprl - Proof: rem mul 1 3

(5steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc

At: rem mul 1 3

1. x:
2. y:
3. n:
4. x = (x n)n+(x rem n)
5. |x rem n| < |n|
6. (x rem n) < 0 x < 0
7. (x rem n) > 0 x > 0
8. y = (y n)n+(y rem n)
9. |y rem n| < |n|
10. (y rem n) < 0 y < 0
11. (y rem n) > 0 y > 0
12. (x rem n)(y rem n) = (((x rem n)(y rem n)) n)n+(((x rem n)(y rem n)) rem n)
13. |((x rem n)(y rem n)) rem n| < |n|
14. (((x rem n)(y rem n)) rem n) < 0 (x rem n)(y rem n) < 0
15. (((x rem n)(y rem n)) rem n) > 0 (x rem n)(y rem n) > 0
16. (((x rem n)(y rem n)) rem n) > 0

xy > 0

By: ThinTrivial THEN RWO Thm* a,b:. ab > 0 a > 0 & b > 0 a < 0 & b < 0 0 THEN RWO Thm* a,b:. ab > 0 a > 0 & b > 0 a < 0 & b < 0 -1 THEN ParallelOp -1 THEN ParallelOp -1 THEN EasyHyp

Generated subgoals:

None

About:

(5steps total) PrintForm Definitions Lemmas graph 1 1 Sections Graphs Doc