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

At: div base case 1

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

(a n) = 0

By: Using [`a',a;`n',n] (BackThru Thm* a:, n:, p,q:. Div(a;n;p) Div(a;n;q) p = q)

Generated subgoals:

1 Div(a;n;a n)
2 Div(a;n;0)


About:
intnatural_numberdivideless_thanequal

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