[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-03
⊦ boolvar ∧ bits.first ∧ false ∈ bits → bits2int(bits + boolvar ') = bits2int(bits) * 2 + 1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
bits2int-rec-04
,
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
bits2uint-one-03
,
bits2uint-succ
,
bits2uint-base
,
bits2uint-ones
,
bits2uint-2pot
,
bits2uint-zeros-03
,
bits2uint-one
,
bits2int-neg
,
bits2int-one
,
Used spec theorems:
bitopsaux
/
succ-zero-02
Used simplifier rules:
bitopsaux
/
succ-empty
list-data
/bitlista/
size-01
bitopsaux
/
invert-base
bitopsaux
/
inv-in-01
bitopsaux
/
inv-len
int-abs
/
Sub-def
bitopsaux
/
inv-empty
bitopsaux
/
succ-one
bitopsaux
/
succ-zeros
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
e-01
int-basic2
/
add-zero
int-abs
/
sub-eq
int-mult
/
dist-sub-merge
int-abs
/
sub-add-01
int-abs
/
negeq
int-abs
/
neg-15
int-mult
/
minus-left
list
/bitlista/
Last
bitopsaux
/
succ-zero
bitopsaux
/
inv-one-01
bitopsaux
/
inv-append
bitopsaux
/
invert-one
list
/bitlista/
c
list
/bitlista/
Nil
list
/bitlista/
a
int-basic2
/
mone-02
int-mult
/
succ-rmerge
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
two-zero
int-abs
/
numadd-01
list
/bitlista/
in-empty
list-data
/bitlista/
elim-list