[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-rec-pos-04
256 ≤ i ⊦ int2bytes(i) = int2bytes(i / 256) + fix(i→n(2), int2bytes(i % 256)).rest
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: 6
Proof steps: 12
Used lemmas:
bytes2int-one
,
fix-pos
,
int2bytes-le127
,
fix-two-01
,
int2bytes-le255
,
int2bytes-rec-pos-03
,
int2bytes-rec-pos-02
,
Used spec theorems:
byte
/
num-ibbi
Used simplifier rules:
int-abs
/
numleledel
int-basic1
/
numlsf
int-div
/
mod-zero-01
int-abs
/
zero-gels-01
int-abs
/
forward-le-02
list
/bytelist/
len-02
list-last
/bytelist/
mklist-one
int-abs
/
numlsledel
int-basic2
/
num-between
int-div
/
mod256
int-abs
/
numlsledel-01
list
/bytelist/
c-07
list
/bytelist/
c-04
list
/bytelist/
a
list
/bytelist/
app-01
int-abs
/
numlelsdel-01
int-abs
/
numleledel-01
int-div
/
mod-zero
int-basic1
/
numlslsdel-01
int-basic1
/
forward-pos
int-abs
/
lels-01
int-abs
/
forward-lsle
int-abs
/
forward-lele
int-abs
/
lels
int-abs
/
forward-le
int-abs
/
forward-le-01