(13steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc

At: mod bounds 2 1 2 2 1
1. a:
2. n:
3. a < 0
4. ((-a) rem n) = 0

0 < ((-a) rem n)
By: Assert (0((-a) rem n))
Generated subgoals:

1 0((-a) rem n)
25. 0((-a) rem n)
0 < ((-a) rem n)

About:
intnatural_numberminusremainderless_thanequal

(13steps) PrintForm Definitions Lemmas int 2 Sections StandardLIB Doc