[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-lasteq
⊦ bits ≠ [] ∧ bits0 ≠ [] → (bits2int(bits + boolvar ') = bits2int(bits0 + boolvar ') ↔ bits2int(bits) = bits2int(bits0))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 38
Used lemmas:
bits2uint-one
,
bits2uint-succ
,
bits2int-pos
,
bits2uint-zeros-03
,
bits2int-pos-02
,
bits2uint-zero
,
bits2int-pos-01
,
bits2int-rec-01
,
bits2int-neg
,
bits2int-rec
,
Used spec theorems:
Used simplifier rules:
bitopsaux
/
succ-zero
bitopsaux
/
inv-one-01
int-basic2
/
add-in
int-abs
/
mone-01
int-basic2
/
mone-02
int-mult
/
succ-rmerge
bitopsaux
/
inv-empty
int-abs
/
numadd-01
int-mult
/
eq-pos
list
/bitlista/
c-07
list
/bitlista/
e-02
int-mult
/
dist-rmerge
int-abs
/
neg-15
int-mult
/
dist-sub-merge
int-mult
/
associativity
int-mult
/
commutativity
int-basic2
/
add-a
int-basic2
/
add-c
int-mult
/
two-zero
int-abs
/
sub-eq
int-basic2
/
add-zero
int-abs
/
sub-eq-01
list
/bitlista/
first-01
list
/bitlista/
Last
bitopsaux
/
succ-rec
bitopsaux
/
inv-false
list
/bitlista/
e
list
/bitlista/
app-02-ant
list
/bitlista/
c-08
int-abs
/
negeq
bitopsaux
/
inv-one
bitopsaux
/
inv-append
bitopsaux
/
invert-one
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
list-data
/bitlista/
elim-list-c