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

At: rem base case 1

1. a:
2. n:
3. a < n

(a rem n) = a

By: Rewrite (HigherC (LemmaC Thm* a:, n:. (a rem n) = a-(a n)n)) 0

Generated subgoal:

1 a-(a n)n = a


About:
intsubtractmultiplydivideremainderless_thanequal

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