[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-neg-04
j < ~(2 ^ (i * 8 - 1)), 0 < i, j % 2 ^ (i * 8) = 0 ⊦ int2bytes(j) = int2bytes(j / 2 ^ (i * 8)) + fix(i→n(i + 1), int2bytes(j % 2 ^ (i * 8))).rest
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bytes-rec-neg-06
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
bytes2int-zero
,
fix-pos
,
bits2bytes-mklist
,
bits2bytes-app
,
int2bytes
,
int2bytes-byte
,
Used spec theorems:
int-div
/
modex
int-pot
/
two-zero
int2bits
/
int2bits-2pot-04
intnat
/
i2np
Used simplifier rules:
nat-basic2
/
one-03
nat-basic2
/
oz
nat-basic1
/
one
list
/bytelist/
len-02
nat
/
add-01
nat-basic2
/
z
nat-basic2
/
a
nat-basic2
/
c
list-last
/bytelist/
mk-last
list
/bytelist/
c-07
list-last
/bytelist/
mk-inj-01
int-abs
/
lels-02
nat-div
/
mult-01
list
/bytelist/
a
list
/bytelist/
app-01
int-mult
/
zero-eq
int-basic1
/
ls-01
int-abs
/
lels-01
nat-div
/
mod-mult-01
nat-mult
/
mult-a
nat-mult
/
mult-c
int-mult
/
zero-neq-01
intnat
/
abs-zero
list-last
/bitlista/
mk-empty
int2bits
/
int2bits-not-empty
list-last
/bitlista/
mk-len
int-pot
/
two-zero
int-mult
/
Mult-zero
int2bits
/
int2bits-zero
int-basic2
/
add-zero
int-pot
/
two-lsz
int-div
/
div-mult-03
int-mult
/
zero-ge
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
forward-le-05
int-abs
/
forward-le-02
int-abs
/
neg-07
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
abs-succ-03