[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-06
⊦ ∃ by, bytes. b2i(by) < 0 ∧ b2i(by) ≠ ~1 ∧ bytes2int(by ' + bytes) = ~(2 ^ (8 * n→i(# bytes)) + 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: 2
Proof steps: 3
Used lemmas:
bytes2int-011x-02
,
Used spec theorems:
Used simplifier rules:
int-mult
/
commutativity
int-abs
/
neg-15
int-abs
/
sub-add-09
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
numadd-01
int-abs
/
negeq
list-last
/bytelist/
mk-len
byte
/
num-ibbi