[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 band-65535-neg
⊦ bytes2int(bytes) < 0 ∧ # bytes ≤ 2 ∧ bytes ≠ [] → band(bytes2int(bytes), 65535) = (bytes2int(bytes) + 1) + 65535
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: 7
Proof steps: 11
Used lemmas:
bytes2int-range
,
Used spec theorems:
intops
/
band-65535-neg
int-div
/
mod-zero-05
nat-mult
/
mult-c
int-pot
/
lemon2pot-02
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
numlsledel
nat-mult
/
mult-c
int-abs
/
lels-04
nat
/
lels-01
nat
/
le-ls-simp
list-data
/bytelist/
l
int-abs
/
numle-02
int-abs
/
forward-lels
int-abs
/
forward-lele
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
negle-13
int-abs
/
zero-gels-03
int-abs
/
forward-le-04
int-abs
/
lels
int-abs
/
numls-02
int-abs
/
neg-13
int-abs
/
subsub
int-abs
/
abs-08
int-abs
/
abs-05
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
numadd
int-abs
/
forward-le-02