Require Export lemmas.
Require Export tacdef.
Theorem div_goal1 :
(np : nat)
(sp : nat)
(nn : nat)
(c : Z)
(h : nat)
(l : nat)
(m : (array bound modZ))
(q : Z)
(rb : bool)
(rz : Z)
(Pre_1 : (lt (1) nn)
/\l=(div2' nn)
/\h=(minus nn (div2' nn))
/\(`q = 0`\/`q = 1`)
/\`np+2*nn <= bound`
/\`sp+nn <= bound`
/\(`np+2*nn <= sp`\/`sp+nn <= np`)
/\(`q = 1`
->`(I m (plus np (mult (S (S O)) l)) h)
< (I m (plus sp l) h)`)
/\`(pow beta h) <= 2*(I m (plus sp l) h)`)
(resultb : bool)
(Test_2 : `q <> 0`)
`(plus np (mult (S (S O)) l))+h <= bound`
/\`(plus sp l)+h <= bound`
/\`(plus np (mult (S (S O)) l))+h <= bound`
/\(no_overlap (plus np (mult (2) l)) (plus np (mult (2) l)) h h)
/\(no_overlap (plus np (mult (2) l)) (plus sp l) h h)
/\(no_overlap (plus np (mult (2) l)) (plus sp l) h h)
.