[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
⊦ 1 < # int2bytes(i) → i >> 8 = bytes2int(int2bytes(i).butlast)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
intrightshift-8
,
rightshift-8-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 33
Used lemmas:
bytes2int-one
,
int2bytes-byte
,
int2int
,
bytes2int-zero
,
int2bytes-last-01
,
int2bytes-rec-case
,
int2bytes-empty
,
Used spec theorems:
intops
/
shiftright-rec-8-neg
intops
/
shiftright-rec-8
int-div
/
div-minus255-256
int-div
/
div-minus255-256-01
int-div
/
modex
int-div
/
div-zero-02
Used simplifier rules:
int-abs
/
Sub-def
int-abs
/
abs-08
int-abs
/
neg-13
int-abs
/
numls-02
int-abs
/
numlelsdel-01
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-eq
int-abs
/
zero-gels-03
int-abs
/
forward-le-04
int-abs
/
numlsledel
int-abs
/
numleledel
int-div
/
div-mult-num
int-mult
/
one
int-mult
/
associativity
int-mult
/
commutativity
int-div
/
nummult-ls-01
int-mult
/
zero-ls
int-div
/
nummult-ls-03
int-abs
/
mone-06
byte
/
num-ibbi
list-last
/bytelist/
b
list-last
/bytelist/
l
int-abs
/
anti
int-abs
/
numlelsdel
int-abs
/
zero-gels-01
int-basic1
/
numlslsdel
int-abs
/
lels-03
int-abs
/
forward-le-02
int-div
/
div-eq-zero
list
/bytelist/
len
list
/bytelist/
a
nat-basic2
/
one
nat-basic2
/
a
nat-basic2
/
c
list-last
/bytelist/
butlast-def
int-abs
/
forward-le
list
/bytelist/
len-02
int-abs
/
numlsledel-01
int-abs
/
numleledel-01
intops
/
rightshift-zero
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
forward-le-01
int-abs
/
lels
list-data
/bytelist/
l
nat-basic1
/
one