[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-len-ls-neg-01
⦠int2bytes(i).first = i2b(~1) ā (n < # int2bytes(i) ā i < ~(2 ^ (8 * nāi(n) - 1)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
fillsgn-len-short
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 2
Used lemmas:
int2bytes-len-le-neg-03
,
Used spec theorems:
nat
/
lels
Used simplifier rules:
int-abs
/
negle-13
int-abs
/
lels-01
int-abs
/
neg-07
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
commutativity
int-abs
/
lels
int-abs
/
lels-03