[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 abs-shift-01
⊦ j ≠ 0 → abs(i % j) = abs(i) % j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
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-grz-01
,
mod-neg-01
,
mod-zero-06
,
Used spec theorems:
int-abs
/
Abs-neg
int-abs
/
Abs-pos
Used simplifier rules:
int-abs
/
forward-le-02
int-abs
/
neg-06
int-abs
/
neg-03
int-abs
/
Abs-pos
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
abs-08
int-abs
/
negeq
int-mult
/
add-mult-two
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
zero-neq-01
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
lels-02