[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 int2bytes-index-rightshift
⊦ 0 ≤ j ∧ j < n→i(# int2bytes(i)) → int2bytes(i)[i→n(j)] = i2b(i >> 8 * (n→i(# int2bytes(i)) - j + 1))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-index-rightshift-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 20
Used lemmas:
bytes2int-i2b
,
rightshift-8-01
,
int2bytes-empty
,
Used spec theorems:
list-del
/bytelist/
firstn-last
intnat
/
sub
nat
/
sub-same
intnat
/
num-n2i-ls-02
Used simplifier rules:
int-basic1
/
ls-01
int-abs
/
lels-01
nat-basic1
/
one
int-basic1
/
forward-pos
int-abs
/
lels-02
intnat
/
abs-zero
nat
/
add-01
nat-basic2
/
z
nat
/
lep
nat
/
lels-03
nat
/
pred-03
nat-basic1
/
ls-02
nat
/
lels-01
nat
/
ls-03
list-del
/bytelist/
firstN-empty
nat
/
zero-01
intnat
/
n2i-add
intnat
/
i2i-pos-01
int-abs
/
sub-add-05
int-abs
/
numsub
int-basic2
/
add-zero
int-abs
/
succ-02
int-abs
/
lep
intnat
/
nat2int
nat
/
le-add
nat-basic2
/
oz
nat-basic2
/
l-02
nat-basic2
/
s
nat-basic1
/
f
nat-basic1
/
lf-01
nat
/
fle
nat
/
le-ls-simp
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat
/
elim-sub
intnat
/
rax-04
intnat
/
n2n
int-abs
/
succ-01
int-abs
/
lels
int-abs
/
lels-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
numle-02
int-abs
/
numleledel-01
nat
/
lels
list-data
/bytelist/
l
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05