[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 fix-rec-neg
⊦ b2i(bytes.first) < 0 ∧ # bytes < n ∧ bytes ≠ [] → fix(n, bytes) = i2b(~1) ' + fix(n -1, bytes)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2bytes-fix
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 14
Used lemmas:
fix-neg-le
,
bytes2int-ge-zero
,
fix-neg
,
Used spec theorems:
list-last
/bytelist/
mk-rec
Used simplifier rules:
list
/bytelist/
app-01
nat-basic2
/
l-01
nat
/
lels-03
nat-basic1
/
ls-02
nat
/
elim-sub
nat-basic2
/
l
nat-basic2
/
oz
nat
/
cancel-01
list
/bytelist/
app-05
list
/bytelist/
e
nat
/
l-num-06
nat
/
elim-pred-c
list
/bytelist/
app-03
nat
/
succ-01
nat-basic1
/
one-01
nat
/
lels-01
nat
/
ls
nat-basic2
/
a
int-abs
/
lels-03
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
lels
nat
/
ls-le-simp
nat-basic2
/
c
nat
/
lels
list
/bytelist/
len-02
list
/bytelist/
len
list
/bytelist/
a
list
/bytelist/
e-01
list
/bytelist/
c
int-abs
/
forward-le-02
nat-basic1
/
f
nat
/
pred-03
list-data
/bytelist/
elim-list