[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-size-val
⊦ ∃ by, bytes. b2i(by) < 0 ∧ bytes2int(i2b(0) ' + by ' + bytes) = 2 ^ ((n→i(# bytes) + 1) * 8) - 1
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: 3
Proof steps: 6
Used lemmas:
bytes2int-011x
,
Used spec theorems:
list-last
/bytelist/
mk-rec
Used simplifier rules:
nat-basic2
/
oz
nat
/
add-01
nat-basic2
/
z
list
/bytelist/
c
int-basic2
/
add-c
int-mult
/
commutativity
list
/bytelist/
app-01
list
/bytelist/
a
list
/bytelist/
in-14
intnat
/
n2i-add
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
Sub-def
int-basic2
/
add-a
list-last
/bytelist/
mk-len
byte
/
num-ibbi
int-abs
/
sub-eq
int-abs
/
lels