[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 shiftright-neg-div-01
⊦ i % 2 ^ abs(j) = 0 ∧ i < ~(2 ^ (abs(j) - 1)) ∧ j ≠ 0 → i >> j = i / 2 ^ abs(j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
shiftright-neg-div
,
Used spec theorems:
int-div
/
div-minus-onediff-01
Used simplifier rules:
int-abs
/
sub-sub-04
int-abs
/
zero-gels-01
int-pot
/
pot2-pos
int-abs
/
abs-03
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-basic2
/
ls
int-pot
/
two-lsz
int-abs
/
forward-le-02
int-abs
/
neg-07
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
lels-03