[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 modmod-add2-negpos-neg
⊦ i + i0 < 0 ∧ i < 0 ∧ 0 ≤ i0 ∧ 0 < j → (i + i0 % j) % j = (i + i0) % j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
modmod-add-case
,
modmod-add-if
,
modmod-add-if3
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 6
Used lemmas:
mod-mult-pos-02
,
mod-mult-04
,
mod-add1-posneg-neg
,
div-elim-pospos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-basic2
/
ls
int-basic2
/
lst-03
int-basic2
/
succ-01
int-abs
/
forward-le-01
int-abs
/
forward-le-02
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-lsle
int-mult
/
zero-ge-add
int-mult
/
zero-left
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-zero-rev
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
zero-gels-01
int-mult
/
zero-ge
int-abs
/
zero-gels-04
int-abs
/
lels