[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-posneg-pos
⊦ 0 ≤ i + i0 ∧ 0 ≤ i ∧ i0 < 0 ∧ 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
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
mod-mult-04
,
mod-add1-negpos-pos
,
div-elim-negpos
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-05
int-abs
/
zero-gels-01
int-basic2
/
lst-03
int-abs
/
forward-le-04
int-abs
/
forward-lels
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-04
int-mult
/
zero-ls
int-abs
/
lels-01
int-basic1
/
lf-01
int-basic1
/
trans
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-basic2
/
succ-01
int-basic2
/
ls
int-abs
/
numls-03
int-basic2
/
ls-01
int-basic2
/
ls-02
int-mult
/
zero-gr
int-abs
/
lenls
int-abs
/
lels
int-abs
/
anti
int-abs
/
forward-le-01
int-abs
/
forward-lele
int-basic1
/
lf-02