[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 bits2int-zero-ls
⊦ bytes ≠ [] → (bits2int(bytes2bits(bytes)) < 0 ↔ b2i(bytes.first) < 0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-rec-pos-any
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
byte2bits-first
,
byte2bits-empty
,
byte2bits-value
,
bytes2bits-empty
,
bytes2bits-rec
,
Used spec theorems:
int2bits
/
bits2int-lez
list
/bitlista/
first-01
Used simplifier rules:
list
/bitlista/
app-02-ant
int-abs
/
lels-03
int-abs
/
lels-04
list
/bitlista/
a
list
/bitlista/
app
int-abs
/
lels-01
list
/bytelist/
c-08
list
/bytelist/
a
list
/bytelist/
e-01
list
/bytelist/
c
int-abs
/
lels