[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 modeq-neg
i0 * j + j0 < 0, 0 < j, j0 < 0 ⊦ (i0 * j + j0) % j = j0 % j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
mod-add-neg
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 6
Used lemmas:
div-elim2
,
Used spec theorems:
int-mult
/
modeqp-01
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
zero-gels-01
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
associativity
int-mult
/
dist-rmerge
int-abs
/
forward-le-04
int-abs
/
forward-lels
int-abs
/
forward-le-02
int-mult
/
commutativity