[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-inj
⊦ # bits % 8 = 0 ∧ bits ≠ [] → bytes2bits(bits2bytes(bits)) = bits
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bits2int-pos
,
int2bytes-rec-neg-02
,
int2bytes-rec-neg-05
,
int2bytes-rec-pos-any
,
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:
byte2bits8
,
bytes2bits-one
,
bytes2bits-append
,
bits2bytes-rec
,
bits2bytes-base
,
Used spec theorems:
list-del
/bitlista/
lastn-length-01
nat-div
/
modex
nat-mult
/
dist-sub-01
list-del
/bitlista/
firstN-lastN
Used simplifier rules:
nat
/
lels-02
nat-div
/
mod-eq
nat
/
zero-01
list-del
/bitlista/
firstN-empty
nat-div
/
mod-mult-01
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
zero-01
nat-basic1
/
lf-01
nat-basic1
/
lf-02
list-del
/bitlista/
first-length
nat
/
ls-01
nat
/
lels
nat
/
lep-01
nat-basic2
/
a
nat-basic2
/
c
nat-basic1
/
ls-02
list
/bytelist/
a
list
/bytelist/
Last
list-data
/bitlista/
l
nat-basic1
/
f
nat
/
lels-01