[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-01
⊦ ¬ 65536 ≤ bytes2int(by ' + by0 ') + s2i(sho)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
short-2bytes
,
Used spec theorems:
byte
/
short-add2
byte
/
short-ngr
Used simplifier rules:
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
forward-le
int-abs
/
forward-le-01