[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 bits2bytes-app
⊦ # bits0 % 8 = 0 ∧ bits ≠ [] ∧ bits0 ≠ [] → bits2bytes(bits + bits0) = bits2bytes(bits) + bits2bytes(bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bytes-mklist-01
,
bits2bytes-rec-01
,
fix-bits2bytes
,
fix-bits2bytes-01
,
int2bytes-rec-neg-01
,
int2bytes-rec-neg-02
,
int2bytes-rec-neg-04
,
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: 15
Proof steps: 28
Used lemmas:
bits2bytes-base
,
bits2bytes-rec
,
Used spec theorems:
nat
/
le-num-06
nat-mult
/
leone
nat
/
add-03
list-del
/bitlista/
firstn-app
nat-div
/
modex
nat-mult
/
dist-sub-01
Used simplifier rules:
nat-div
/
mod-mult-01
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
zero-01
nat
/
zero-01
list-del
/bitlista/
firstN-empty
list-del
/bitlista/
first-length
nat-basic2
/
l
nat
/
ls-01
nat
/
lels-03
list
/bytelist/
app-03
nat-basic1
/
lf-01
nat-basic1
/
ls-02
nat-basic2
/
l-01
list
/bytelist/
a
list
/bytelist/
app-01
list-del
/bitlista/
firstN-len
nat-basic2
/
z
nat
/
add-num-03
nat-basic1
/
lf-02
list-del
/bitlista/
lastN-all
nat
/
anti
nat
/
not-zero
list-del
/bitlista/
lastN-append-01
nat-div
/
mod-eq
list
/bytelist/
Last
nat-basic1
/
one-01
nat
/
lels-02
nat
/
lep-01
nat-basic1
/
f
nat
/
fle-01
list-data
/bitlista/
l
nat-basic2
/
l-02
nat-basic2
/
a
nat
/
lels-01
nat-basic2
/
c
nat
/
le-ls-simp
nat
/
lels
list
/bitlista/
a
list
/bitlista/
len