[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 bytes2bytes-other
bytes ≠ [], b2i(bytes.first) ≠ 0, b2i(bytes.first) ≠ ~1 ⊦ int2bytes(bytes2int(bytes)) = bytes
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bytes2bytes-first-neg
,
bytes2bytes-fix
,
bytes2bytes-identity
,
bytes2bytes-length
,
no-leading-zero-02
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 33
Used lemmas:
byte2bits-empty
,
byte2bits-value
,
byte2bits-length
,
bits2bytes-rec
,
bits2bytes-base
,
byte2bits
,
bytes2bits-empty
,
bytes2bits-one
,
bytes2bits-append
,
bytes2bits-empty-01
,
int2bytes
,
bytes2int
,
Used spec theorems:
int2bits
/
bits2bits-def
list
/bytelist/
lastdiv-rew
bitopsaux
/
sgn-append-01
list
/bytelist/
first-01
bitopsaux
/
sgn-fill
bitopsaux
/
fill-in
int2bits
/
int2bits-ones
list-del
/bitlista/
lastN-append
Used simplifier rules:
list
/bytelist/
c-08
list
/bytelist/
e
list
/bytelist/
app-02-ant
list
/bitlista/
app-02-ant
list
/bytelist/
len
list
/bytelist/
len-02
nat-basic2
/
l
list
/bytelist/
app-03
list
/bytelist/
first-01
nat-basic2
/
l-01
list
/bytelist/
Last
list-del
/bitlista/
firstN-len
nat-basic2
/
z
nat
/
add-01
list
/bitlista/
len
nat
/
lels
nat
/
lep-01
list-data
/bitlista/
l
bitopsaux
/
sgn-empty-01
nat-basic2
/
a
nat-basic2
/
c
bitopsaux
/
sgn-empty
int2bits
/
int2bits-truein
list
/bitlista/
in-append
list
/bytelist/
e-01
list
/bytelist/
c
list-data
/bytelist/
elim-list-c
byte
/
byte-len
nat
/
lels-01
int2bits
/
int2int-inj
byte
/
ibi
list
/bytelist/
c-04
int2bits
/
int2bits-sgn
int2bits
/
int2bits-not-empty
list
/bitlista/
in-empty
list
/bytelist/
first
list
/bytelist/
Nil
list
/bitlista/
a
list
/bitlista/
Nil
list
/bytelist/
a