PrintForm Definitions finite sets Sections AutomataTheory Doc

At: div bounds 2 1

1. n:
2. x: (nn)

(x n) < n

By:
Inst Thm* a:, n:. a = (a n)n+(a rem n) [x;n]
THEN
Inst Thm* a:, n:. 0(a rem n) & (a rem n) < n [x;n]
THEN
Inst Thm* i,j:. ij -i-j [x rem n;0]
THEN
Inst Thm* i1,i2,j1,j2:. i1 < j1 i2j2 i1+i2 < j1+j2 [(x n)n+(x rem n);-(x rem n);nn;0]
THEN
Inst Thm* a,b:, n:. na < nb a < b [x n;n;n]


Generated subgoals:

None


About:
less_thandivideremaindernatural_numberaddmultiplyminus