[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Theorem div-add1-negpos-neg-02
⊦ i % j = 0 ∧ i + i0 < 0 ∧ i < 0 ∧ 0 ≤ i0 ∧ 0 < j → (i + i0) / j = i / j + (i0 + (j - 1)) / j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 7
Used lemmas:
div-add1-negpos-neg-01
,
div-add1-negpos-neg
,
mod-one
,
mod-zero-04
,
one
,
one-01
,
div-add-succ
,
div-add-nosucc
,
Used spec theorems:
Used simplifier rules:
int-basic2
/
add-in
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-04
int-abs
/
zero-gels-01
int-basic2
/
ls
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
sub-add-01
int-abs
/
elim-sub
int-abs
/
lels
int-abs
/
bet
int-basic2
/
eq
int-basic2
/
add-zero
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
numadd-01
int-abs
/
anti