[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-pos-01
⊦ 0 ≤ b2i(by) ∧ 8 ≤ j → b2i(by) >> j = 0
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: 5
Proof steps: 9
Used lemmas:
byte-nge
,
Used spec theorems:
intops
/
shiftright-pos-div
int-div
/
div-zero-02
int-pot
/
two-le
Used simplifier rules:
int-basic1
/
numlslsdel
int-abs
/
forward-lels
int-abs
/
forward-lele
int-abs
/
ge-def
int-abs
/
lels
int-pot
/
abs-2pot
int-abs
/
absle
int-abs
/
forward-le
int-abs
/
forward-le-01
int-abs
/
lels-01
int-abs
/
lels-04
int-basic1
/
ls-01