[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
⊦ i < 0 ∧ int2bytes(i).first ≠ i2b(~1) → (n < # int2bytes(i) ↔ i < ~(2 ^ (8 * n→i(n))))
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: 3
Used lemmas:
int2bytes-len-le-neg-02
,
Used spec theorems:
nat
/
lels
Used simplifier rules:
nat
/
lels-01
int-abs
/
negle-13
int-abs
/
lels-01
int-mult
/
commutativity
int-basic2
/
add-c
int-abs
/
lels-04
int-abs
/
lels-03
int-abs
/
forward-le-02
int-abs
/
lels
int-abs
/
neg-07