[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 bits2int-mklist-01
⊦ bits2int(boolvar ' + mklist(boolvar, n) + bits) = bits2int(boolvar ' + bits)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bits2int-mklist-05
,
Used by units in proved state:
intops
,
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 4
Used lemmas:
bits2int-neg
,
bits2int-sign
,
Used spec theorems:
list-last
/bitlista/
mk-last
list
/bitlista/
a
Used simplifier rules:
list-last
/bitlista/
mk-last
list
/bitlista/
a
list
/bitlista/
app-02-ant
list
/bitlista/
e
list
/bitlista/
c-08
list-last
/bitlista/
mk-elem
list
/bitlista/
c
bitopsaux
/
invert-one
bitopsaux
/
inv-append
bitopsaux
/
inv-mklist
int-abs
/
neg-12
bitlista
/
inmklist-01