[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
⊦ 0 ≤ b2i(by) → b2i(by) >> 8 = 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
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: 4
Used lemmas:
byte-le-256
,
Used spec theorems:
intops
/
shiftright-rec-8
int-div
/
div-zero-02
Used simplifier rules:
int-abs
/
absle
int-abs
/
lels
intops
/
rightshift-zero
int-abs
/
forward-le-01
int-abs
/
lels-01
int-abs
/
lels-04