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

At: div rec case 1 2 1 1

1. a:
2. n:
3. an
4. p:
5. Div(a;n;p)
6. q:
7. Div(a-n;n;q)

p = q+1

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

Generated subgoal:

1 Div(a;n;q+1)


About:
intnatural_numberaddsubtractequal

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