[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-byte-neg
⊦ ~256 < i ∧ i < ~128 → int2bytes(i) = i2b(~1) ' + i2b(i) '
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2int-int2bytes-len-eq
,
int2bytes-last-01
,
int2bytes-rec-case
,
no-leading-zero-04
,
rightshift-8-01
,
rightshift-8-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 22
Used lemmas:
bits2bytes-base
,
bits2bytes-true
,
bits2bytes-rec-01
,
int2bytes
,
Used spec theorems:
list-del
/bitlista/
firstn-one-01
int2bits
/
int2bits-lslen-05
list-del
/bitlista/
rest-rec
int2bits
/
int2int-rest-01
int2bits
/
int2bits-lslen-03
int2bits
/
int2bits-leneq-neg
Used simplifier rules:
int-abs
/
lels-03
nat
/
lels-02
byte
/
byte-add-256
int-abs
/
lels
int-abs
/
mone-08
list-del
/bitlista/
restN-zero
list
/bytelist/
c-04
int-basic1
/
numlslsdel
int-abs
/
numle-02
int-abs
/
lels-01
int-basic1
/
ls-01
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic1
/
f
nat
/
ls-03
list-del
/bitlista/
rest-len
nat
/
lels-01
nat-basic1
/
one-01
list-data
/bitlista/
l
list
/bytelist/
a
list
/bytelist/
app-01
int2bits
/
int2bits-first-01
int2bits
/
int2bits-not-empty
int-basic1
/
numlsf