[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-neg
⊦ bytes ≠ [] → (bytes2int(bytes) < 0 ↔ b2i(bytes.first) < 0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2int-first-neq
,
bytes2int-ge-zero
,
bytes2int-le-zero
,
bytes2int-neg-01
,
fillsgn-butlast
,
fillsgn-rec
,
fix-rec-pos
,
int2bytes-fillsgn-rec
,
no-leading-zero
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 9
Proof steps: 17
Used lemmas:
bytes2int-one
,
bytes2int-rec-01
,
Used spec theorems:
int-abs
/
zero-gs
int-basic2
/
add-c
int-mult
/
commutativity
int-mult
/
modzero-03
Used simplifier rules:
intops
/
band-max-04
intops
/
band-notneg
intops
/
band-associativity
intops
/
band-commutativity
int-mult
/
zero-ge
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
zero-gels-01
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
list
/bytelist/
c-08
list
/bytelist/
e
list
/bytelist/
app-02-ant
nat-basic2
/
l
list
/bytelist/
e-02
list-last
/bytelist/
last-elim
list-last
/bytelist/
bapp
list-last
/bytelist/
l-02
nat-basic2
/
one
list
/bytelist/
len
list
/bytelist/
len-02
nat-basic1
/
one
nat-basic2
/
oz
nat-basic2
/
a
nat-basic2
/
c
nat-basic2
/
one-03
list-data
/bytelist/
l
list
/bytelist/
app
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
lels-03
list
/bytelist/
a
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list-c
int-abs
/
lels