[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 mod-add1-posneg-pos
⊦ i % j = 0 ∧ 0 ≤ i + i0 ∧ 0 ≤ i ∧ i0 < 0 ∧ i0 % j ≠ 0 ∧ 0 < j → (i + i0) % j = i0 % j + j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
modmod-add2-negpos-pos-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
div-elim-pospos
,
div-elim-negpos
,
Used spec theorems:
int-mult
/
modeqp-copied
int-mult
/
numls-13
Used simplifier rules:
int-basic2
/
ls-02
int-abs
/
forward-le-04
int-abs
/
forward-le-02
int-abs
/
neg-13
int-abs
/
abs-08
int-basic2
/
add-less
int-mult
/
ls-pos
int-basic2
/
ls-01
int-mult
/
zero-gr
int-mult
/
zero-ge
int-mult
/
dist-rmerge
int-mult
/
zero-ge-add
int-basic2
/
add-in
int-abs
/
forward-lsle
int-abs
/
forward-lele
int-abs
/
forward-le-01
int-basic2
/
eq
int-abs
/
zero-gels-01
int-abs
/
zero-gels-04
int-abs
/
lenls
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
lels-02
int-abs
/
zero-gels
int-abs
/
sub-sub
int-abs
/
forward-lels
int-abs
/
lels
int-abs
/
lels-01
int-mult
/
add-mult-two
int-abs
/
sub-ls
int-abs
/
sub-le-01
int-mult
/
eq-succ-01
int-mult
/
succ-rmerge
int-abs
/
sub-eq
int-abs
/
sub-add-01
int-abs
/
minus-ass
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-basic1
/
ls-01