[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 bytes2bytes-first-neg
⊦ b2i(int2bytes(bytes2int(by ' + bytes)).first) < 0 ↔ b2i(by) < 0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bytes2bytes-first-pos
,
bytes2bytes-fix
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 27
Used lemmas:
bytes2int-mone
,
bytes2bytes-mone
,
bytes2int-zero-04
,
bytes2bytes-zero
,
bytes2bytes-other
,
int2bytes-byte-01
,
bytes2int-one
,
Used spec theorems:
byte
/
i2b-noteq
Used simplifier rules:
int-abs
/
zero-gels-04
byte
/
num-ibbi
nat-basic2
/
s
nat-basic1
/
ref-1
byte
/
byte
byte
/
ibi
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
nat-basic2
/
one-03
list
/bytelist/
len
list
/bytelist/
len-02
nat-basic1
/
one
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
one
list-data
/bytelist/
l
list
/bytelist/
c-07
int-abs
/
forward-le-05
int-abs
/
forward-le-02
list
/bytelist/
e
list
/bytelist/
app-02-ant
list
/bytelist/
c-08
list
/bytelist/
app
list
/bytelist/
a
list
/bytelist/
first
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
lels-03
int-abs
/
lels