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

At: div rem properties 1

1. a:
2. n:
3. a = (a n)n+(a rem n)
|a rem n| < |n| & ((a rem n) < 0 a < 0) & ((a rem n) > 0 a > 0)

By: Assert ((0 n) = 0)

Generated subgoals:

1 (0 n) = 04 steps
 
24. (0 n) = 0
|a rem n| < |n| & ((a rem n) < 0 a < 0) & ((a rem n) > 0 a > 0)
1 step

About:
intnatural_numberaddmultiplydivideremainderless_thanequalimpliesand

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