[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-rec255-neg
⊦ i < ~ 128 → int2bytes(i) = int2bytes((i - 255) / 256) + int2bytes(i % 256).last '
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-first-neg
,
int2bytes-first-neg-01
,
int2bytes-zero
,
no-leading-zero-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 18
Proof steps: 34
Used lemmas:
int2bytes-empty
,
int2bytes-len-neg256
,
fix-two
,
int2bytes-byte
,
int2int
,
fix-neg
,
fix-longer
,
int2bytes-rec-neg-06
,
Used spec theorems:
list-del
/bytelist/
lastN-all
int-abs
/
sub-ls-01
Used simplifier rules:
nat-basic2
/
one-03
list
/bytelist/
e-02
list
/bytelist/
c-05
list-last
/bytelist/
last-elim
list-last
/bytelist/
l-02
list-data
/bytelist/
size-01
list
/bytelist/
in-17
list
/bytelist/
in-append
nat-basic2
/
c
nat-basic2
/
a
nat
/
add-num-04
list
/bytelist/
len
list
/bytelist/
in-14
list
/bytelist/
c
list-data
/bytelist/
elim-list
int-abs
/
forward-le-01
int-abs
/
forward-le
int-div
/
mod-grz
nat
/
lels-02
list-data
/bytelist/
l
nat
/
not-zero
int-basic1
/
numlslsdel
int-abs
/
numleledel-01
list
/bytelist/
len-02
list-last
/bytelist/
mklist-one
int-abs
/
forward-lels
int-abs
/
forward-lsle
int-div
/
mod-lsz
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels-01
list-last
/bytelist/
mk-zero
list
/bytelist/
Nil
int-abs
/
forward-le-02
nat
/
lels
nat
/
ls-le-simp
int-div
/
mod-ngez
list
/bytelist/
c-07
list-last
/bytelist/
l
list
/bytelist/
c-04
nat-basic1
/
f
nat
/
lels-01
nat
/
ge
int-abs
/
numlelsdel
list
/bytelist/
a
list
/bytelist/
app-01
int-basic1
/
numlsf
int-abs
/
lels
int-abs
/
lels-03