[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-len-one-01
⊦ 0 ≤ bytes2int(bytes) ∧ # bytes ≠ 1 ∧ bytes ≠ [] ∧ bytes.first ≠ i2b(0) → ¬ bytes2int(bytes) < 128
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 24
Used lemmas:
byte2bits
,
bytes2bits-rec
,
bytes2bits-empty-01
,
bytes2int
,
bytes2int-rec
,
Used spec theorems:
int2bits
/
bits2int-zero-02
byte
/
byte-011x-pos
bitopsaux
/
fill-fill
int-mult
/
modzero-03
int-abs
/
ple-02
Used simplifier rules:
int-basic2
/
num-between
int-div
/
nummult-le
int-basic1
/
ls-01
intops
/
band-max-04
int-abs
/
lels-04
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-abs
/
lels-02
byte
/
byte-len
nat
/
lels-01
int2bits
/
int2bits-not-empty
int2bits
/
int2bits-first-02
int-abs
/
lels
int2bits
/
int2bits-truein
byte
/
byte-equal-01
list
/bitlista/
a
list
/bitlista/
in-append
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list-c
intops
/
band-255-neg
byte
/
byte-mod-100x-01
int-abs
/
numle-02
int-abs
/
numls-03
byte
/
byte-nls
int-abs
/
zero-gels-04
int-basic2
/
add-a
int-basic2
/
add-zero
int-basic2
/
add-c
int-abs
/
forward-lele
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
lsone
int-div
/
nummult-ls
int-abs
/
lels-01
intops
/
band-notneg
intops
/
band-associativity
intops
/
band-commutativity
list
/bytelist/
first-01
nat-basic2
/
c
nat-basic2
/
a
list-data
/bytelist/
l
nat-basic2
/
one
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
e-02
list
/bytelist/
app-01
list-last
/bytelist/
last-elim
int-abs
/
forward-le-01
int-abs
/
forward-lels
list
/bytelist/
Last
list-last
/bytelist/
butlast-last
list
/bytelist/
a