[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 bytes2int-100x-01
⊦ bytes2int(i2b(1) ' + mklist(i2b(0), n)) = 2 ^ (8 * n→i(n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2int-size-val-03
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 9
Used lemmas:
bytes2int-rec
,
bytes2int-one
,
Used spec theorems:
list-last
/bytelist/
mk-last-02
int-pot
/
pot-dist-pos
Used simplifier rules:
intnat
/
nat2int
int-mult
/
zero-ge
int-mult
/
commutativity
int-mult
/
succ-rmerge
int-mult
/
associativity
list
/bytelist/
e-01
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
intops
/
band-commutativity
intops
/
band-associativity
intops
/
band-255-pos
byte
/
byte
list
/bytelist/
app-02-ant
list
/bytelist/
e
nat-basic2
/
pred
nat-basic2
/
oz
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
nat-basic2
/
succ
list-last
/bytelist/
mk-zero
list
/bytelist/
app
list
/bytelist/
a
byte
/
num-ibbi