[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 setShort-theorem
⊦ ¬(by0 = i2b(s2i(sho)) ∧ by = i2b(s2i(sho) i>> 8)) → fillsgn(2, int2bytes(s2i(sho))) ≠ by ' + by0 '
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
setShort-theorem-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 16
Used lemmas:
fillsgn-pos
,
bytes2int-one
,
fillsgn-neg
,
int2bytes-byte-01
,
fillsgn-longer
,
int2bytes-len-one
,
int2bytes-len-one-01
,
int2bytes-empty
,
int2bytes-fillsgn-rec
,
Used spec theorems:
intops
/
intshiftright-def-unbounded
Used simplifier rules:
byte
/
byte-equal-01
nat-basic1
/
one-01
list
/bytelist/
Last
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
zero-gels-04
int-abs
/
forward-le-01
byte
/
shiftright-byte-8-pos
int-abs
/
lels
list-last
/bytelist/
mklist-one
list
/bytelist/
app-06
list
/bytelist/
c-04
byte
/
shiftright-byte-8-neg
byte
/
ibi
nat-basic1
/
ls-02
nat
/
ge
nat
/
lels-03
list
/bytelist/
len
list
/bytelist/
len-02
nat-basic1
/
f
nat
/
lels-01
list-data
/bytelist/
l
nat-basic1
/
one
intops
/
band-commutativity
intops
/
band-associativity
intops
/
band-31-pos
list
/bytelist/
in-17
list
/bytelist/
in-append
list
/bytelist/
in-14
list
/bytelist/
a
list
/bytelist/
in-15