[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-byte-8-neg-01
⊦ b2i(by) < 0 ∧ 8 ≤ j → b2i(by) >> j = ~1
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: 3
Proof steps: 7
Used lemmas:
byte-nle-02
,
byte-mod-100x
,
Used spec theorems:
intops
/
shiftright-rec-8-neg
int-div
/
div-minus255-256
int-div
/
div-zero-02
Used simplifier rules:
intops
/
shiftright-minus-one
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-02
int-basic1
/
ls-01
int-abs
/
forward-le-05
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-02
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
lels-01
int-abs
/
lels-04