[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-rec-first-zero
⊦ bytes ≠ [] → bytes2int(i2b(0) ' + by ' + bytes) = band(b2i(by), 255) * 256 ^ n→i(# bytes) + bytes2int(i2b(0) ' + bytes)
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: 9
Proof steps: 16
Used lemmas:
bytes2int-zero
,
bytes2int-rec
,
bytes2int-rec-01
,
Used spec theorems:
int-pot
/
succ
Used simplifier rules:
intnat
/
nat2int
int-mult
/
eq-dist
int-mult
/
dist-rmerge
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
eq-pos
int-basic2
/
add-zero
list-data
/bytelist/
size-01
list
/bytelist/
app
nat-basic2
/
s
nat-basic1
/
ref-1
list
/bytelist/
e-01
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-in
intops
/
band-commutativity
list
/bytelist/
app-02-ant
list
/bytelist/
e
intnat
/
n2i-add
list
/bytelist/
e-02
list-last
/bytelist/
last-elim
list-data
/bytelist/
l
nat-basic2
/
one
list-last
/bytelist/
bapp
list-last
/bytelist/
l-02
list-last
/bytelist/
l-05
list
/bytelist/
len
list
/bytelist/
len-02
list
/bytelist/
a
nat-basic1
/
one
nat-basic2
/
z-01
nat-basic2
/
a
nat-basic2
/
c
nat
/
add-num-03