[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 short-2bytes-03
⊦ ¬ 32768 < bytes2int(by ' + by0 ')
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
short-2bytes-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 7
Used lemmas:
bytes2int-one
,
bytes2int-rec
,
Used spec theorems:
int-basic2
/
add-c
int-basic2
/
lst-02
Used simplifier rules:
int-abs
/
numlelsdel-01
int-div
/
nummult-ls-02
byte
/
byte-gr-127
int-div
/
nummult-le
byte
/
byte-le
int-mult
/
associativity
int-abs
/
numls-02
intops
/
band-max-02
intops
/
band-associativity
intops
/
band-commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
list
/bytelist/
e