[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 ubyte-neg
⊦ b2i(by) < 0 → ub2i(by) = 256 + b2i(by)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
band-ff
,
getsetShort-theorem
,
ubyte-inj
,
ubyte-max
,
ubyte-max-02
,
ubyte-pos-01
,
ubyte-pos-03
,
ubyte-zero-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
byte-len
,
unsigned-byte
,
Used spec theorems:
int2bits
/
ubits2bits
int2bits
/
bits2int-fill
bitopsaux
/
fill-length
Used simplifier rules:
nat
/
lels-01
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-in
int2bits
/
int2int-inj
bitopsaux
/
fill-empty
int2bits
/
int2bits-not-empty
int2bits
/
int2bits-fillfirst
int2bits
/
int2bits-first-01
list
/bitlista/
a
int2bits
/
bits2int-pos
int-abs
/
forward-le-02