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