[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 bits2bits-in
⊦ bits ≠ [] → (boolvar ∈ bytes2bits(bits2bytes(bits)) ↔ boolvar ∈ bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bits2bits-sgn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 16
Used lemmas:
bytes2bits-append
,
byte2bits
,
bytes2bits-one
,
bits2bytes-base
,
bits2bytes-rec
,
Used spec theorems:
byte
/
num-ibbi
int2bits
/
bits2bits-def
bitopsaux
/
fill-in
bitopsaux
/
sgn-in-01
Used simplifier rules:
list-del
/bitlista/
lastN-in
list-del
/bitlista/
firstN-lastN-in-01
bitopsaux
/
sgn-empty-01
list-del
/bitlista/
lastN-empty
int2bits
/
bits2int8-02
int2bits
/
bits2int8-03
list-del
/bitlista/
firstN-in-03
nat
/
zero-01
list-del
/bitlista/
firstN-empty
list-del
/bitlista/
first-length
nat-basic1
/
ls-02
nat
/
lels-01
nat
/
ls-01
nat
/
lep-01
nat-basic2
/
a
nat-basic2
/
c
list-data
/bitlista/
l
nat-basic1
/
f
list
/bytelist/
a
list
/bytelist/
Last
int2bits
/
bits2int-le8-01
int2bits
/
bits2int-le8
int-abs
/
lels-01
int2bits
/
bits2bits-def
bitopsaux
/
fill-sgn-01
bitopsaux
/
fill-fill
list
/bitlista/
in-append
list
/bitlista/
a
list
/bitlista/
in-12
list-last
/bitlista/
mk-elem
int-abs
/
forward-lele
list-last
/bitlista/
mk-in
nat
/
zero-02
nat
/
lels-02
list
/bitlista/
in-08
nat
/
lels