[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-rec-01
⊦ boolvar ∧ bits.first ∧ bits ≠ [] → bits2int(bits + boolvar ') = ~(bits2uint(bitsinvert(bits.rest)) * 2 + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2int-lasteq
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
bits2uint-one
,
bits2uint-zeros-03
,
bits2int-neg
,
Used spec theorems:
Used simplifier rules:
int-abs
/
numadd-01
int-abs
/
negeq
int-mult
/
commutativity
list
/bitlista/
c
list
/bitlista/
e-01
list
/bitlista/
a
bitopsaux
/
invert-one
bitopsaux
/
inv-append
bitopsaux
/
inv-one-01
bitopsaux
/
succ-zero
list
/bitlista/
Last
int-abs
/
neg-15
int-abs
/
sub-add-09
int-basic2
/
add-a
int-basic2
/
add-c
list-data
/bitlista/
elim-list-c