[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-2pot
⊦ # bits2bytes(true ' + mklist(false, 7 + 8 * n)) = n + 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 13
Proof steps: 25
Used lemmas:
bits2bytes-rec
,
bits2bytes-base
,
Used spec theorems:
list-last
/bitlista/
mklist-split-intro
list-del
/bitlista/
firstn-butlast-intro
list-del
/bitlista/
first-all-01
Used simplifier rules:
nat-basic2
/
eq-01
list-last
/bitlista/
butlast-def
list-last
/bitlista/
bin
nat-basic2
/
l
nat
/
add-num-01
list
/bytelist/
a
list
/bytelist/
len
list
/bytelist/
Last
int2bits
/
bits2uint-one-02
int2bits
/
bits2uint-zero
int2bits
/
bits2int-pos
list-last
/bitlista/
last-01
list-del
/bitlista/
lastn-one
list-del
/bitlista/
num-lastN
list-last
/bitlista/
mk-len
nat
/
l-num-03
nat
/
add-01
nat
/
le-num-03
nat-mult
/
mult-c
nat-mult
/
mult-a
nat-basic2
/
c
nat-basic2
/
a
nat-mult
/
rsucc-02
nat-basic2
/
succ
list
/bytelist/
len-02
list
/bitlista/
len
list
/bitlista/
len-02
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num