[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-rec-01
⊦ # bits % 8 ≠ 0 ∧ 8 < # bits → bits2bytes(bits) = bits2bytes(firstn(# bits % 8, bits)) + bits2bytes(restn(# bits % 8, bits))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bytes-fill
,
bits2bytes-mklist-03
,
bits2int-pos
,
int2bytes-byte-neg
,
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: 8
Proof steps: 11
Used lemmas:
bits2bytes-empty
,
bits2bytes-app
,
Used spec theorems:
list-del
/bitlista/
restn-empty
list-del
/bitlista/
firstn-restn-eq
Used simplifier rules:
nat-basic2
/
eq
nat
/
lels-01
nat-basic1
/
lf-02
nat
/
l-num-05
nat-basic2
/
l-02
list
/bytelist/
a
list
/bytelist/
app-04
list
/bitlista/
a
list
/bitlista/
app
nat-div
/
mod-mult-01
nat
/
eq-01
nat-basic2
/
l-01
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-mult
/
zero-01
nat-basic1
/
one
nat-basic2
/
l
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
trans
nat-basic1
/
lf-01
nat-div
/
div-elim
list-del
/bitlista/
firstN-empty
list-del
/bitlista/
rest-len
nat-div
/
mod-le
list-data
/bitlista/
l
nat-basic1
/
f