[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 int2bytes-shortval
⊦ 0 ≤ s2i(sho) → ¬ 2 < # int2bytes(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: 5
Proof steps: 10
Used lemmas:
Used spec theorems:
bytes
/
int2bytes-len-pos
bytes
/
int2bytes-len-pos-01
Used simplifier rules:
int-abs
/
numleledel-01
int-abs
/
lels-04
int-abs
/
numlelsdel
int-abs
/
lels-03
int-basic1
/
forward-pos
int-abs
/
forward-le-05
byte
/
short-max-01
int-abs
/
lels-01
int-abs
/
forward-le
int-abs
/
forward-le-04
bytes
/
int2bytes-byte
list
/bytelist/
len-02
int-abs
/
anti
int-abs
/
lels
bytes
/
int2bytes-empty
list-data
/bytelist/
l
nat-basic1
/
f
int-abs
/
forward-le-01
int-abs
/
leone