[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-mone
⊦ b2i(by) < 0 → bytes2int(i2b(~1) ' + by ' + bytes) = bytes2int(by ' + bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2bytes-first-neg
,
bytes2bytes-fix
,
bytes2bytes-identity
,
bytes2bytes-length
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 13
Used lemmas:
byte2bits-first
,
byte2bits-empty
,
byte2bits-mone
,
bytes2bits-rec
,
bytes2int
,
Used spec theorems:
int2bits
/
bits2int-sgn-intro
bitopsaux
/
sgn-rec-01
list
/bitlista/
first-01
Used simplifier rules:
int-abs
/
lels
int-abs
/
lels-03
list
/bitlista/
app-02-ant
int2bits
/
bits2int-inj
int2bits
/
bits2int-sgn
bitopsaux
/
sgn-rec
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num-01
list
/bytelist/
a
int-abs
/
forward-le-02