[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 rightshift-8-02
⊦ i >> 8 = bytes2int(fillsgn(2, int2bytes(i)).butlast)
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: 22
Proof steps: 43
Used lemmas:
fillsgn-longer
,
int2bytes-byte
,
int2bytes-byte-neg
,
int2bytes-minus-256
,
int2bytes-rec-neg-256
,
int2bytes-rec-neg-256-01
,
bytes2int-one
,
int2bytes-last-01
,
int2bytes-rec-pos
,
bytes2int-zero
,
fillsgn-pos
,
int2int
,
fillsgn-neg
,
int2bytes-empty
,
rightshift-8
,
Used spec theorems:
intops
/
shiftright-pos-div
intops
/
shiftright-neg-mone
list-last
/bytelist/
bc
list-data
/bytelist/
lf-01
intops
/
shiftright-neg-div-01
intops
/
shiftright-neg-div-02
int-div
/
div-zero-02
Used simplifier rules:
nat
/
ge
nat
/
lels-01
nat-basic1
/
lstwo
int-basic1
/
numlslsdel
list
/bytelist/
len-02
list-last
/bytelist/
butlast-def
int-abs
/
numlelsdel-01
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-abs
/
anti
int-basic2
/
add-a
int-basic2
/
add-c
list
/bytelist/
e
int-abs
/
sub-eq
int-abs
/
forward-lels
int-abs
/
numlelsdel
byte
/
num-ibbi
int-abs
/
lels-03
int-abs
/
forward-le-02
list
/bytelist/
c-05
int-abs
/
forward-lele
int-abs
/
numleledel-01
int-div
/
div-eq-zero
int-abs
/
forward-le
int-abs
/
absle
list
/bytelist/
in-17
list-last
/bytelist/
b
list
/bytelist/
c-03
list
/bytelist/
in-14
list-data
/bytelist/
elim-list
list
/bytelist/
a
list
/bytelist/
app
list
/bytelist/
c
list-last
/bytelist/
mklist-one
nat-basic1
/
f
nat-basic1
/
lf-02
int-abs
/
zero-gels-04
int-abs
/
lels-01
int-abs
/
lels-04
nat
/
not-zero
int-abs
/
forward-le-01
int-abs
/
lels
nat
/
lels
list-data
/bytelist/
l
nat-basic1
/
one