[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-eq-neg-01
⊦ int2bytes(i).first = i2b(~1) → (# int2bytes(i) = n ↔ ~(2 ^ (8 * n→i(n) - 1)) ≤ i ∧ i < ~(2 ^ (8 * (n→i(n) - 1) - 1)) ∧ n ≠ 0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
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: 6
Used lemmas:
int2bytes-empty
,
int2bytes-len-le-neg-03
,
int2bytes-len-le-neg-01
,
Used spec theorems:
Used simplifier rules:
nat-basic1
/
ls-03
nat-basic1
/
ref-1
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-03
nat
/
lels
nat
/
ler
int-abs
/
lels-04
int-mult
/
commutativity
list-data
/bytelist/
l
nat
/
lels-01
int-abs
/
lels
int-abs
/
neg-07
int-abs
/
lels-01
int-abs
/
negle-13