[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
⊦ 8 < # bits → bits2bytes(bits) = bits2bytes(firstn(# bits - 8, bits)) + i2b(bits2int(lastn(8, bits)))
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2bits-in
,
bits2bits-inj
,
bits2bits-sgn
,
bits2bytes-2pot
,
bits2bytes-app
,
bits2bytes-empty
,
bits2bytes-len
,
bits2bytes-mklist
,
bits2bytes-mklist-02
,
bits2bytes-rec-02
,
bytes2bytes-mone
,
bytes2bytes-other
,
bytes2bytes-zero
,
int2bytes-byte
,
int2bytes-empty
,
int2bytes-le255
,
int2bytes-minus-256
,
int2bytes-minus-one
,
int2bytes-rec-pos
,
Used by units in proved state:
Proof exists?: No