[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-ones-02
⊦ ¬ false ∈ bits ∧ bits ≠ [] → bits2int(bits + bits0) = bits2int(true ' + bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 13
Used lemmas:
bits2uint-zeros-03
,
bits2uint-zeros-02
,
bits2uint-2pot
,
bits2int-pos
,
bits2int-neg-03
,
bits2int-neg
,
Used spec theorems:
bitopsaux
/
succ-zero-01
bitopsaux
/
succ-zero-03
list
/bitlista/
a
Used simplifier rules:
bitopsaux
/
succ-zero-01
list-last
/bitlista/
bin-01
bitopsaux
/
inv-in-02
list
/bitlista/
Last
bitopsaux
/
inv-empty
bitopsaux
/
inv-last-01
bitopsaux
/
inv-in-01
bitopsaux
/
inv-inv
bitopsaux
/
succ-one
bitopsaux
/
succ-zeros-01
int-basic2
/
add-zero
int-abs
/
sub-eq
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
neg-15
bitopsaux
/
inv-append
list
/bitlista/
e-01
list
/bitlista/
in-06
list-data
/bitlista/
elim-list
list
/bitlista/
app-02-ant
list
/bitlista/
first-01
int-abs
/
negeq
list
/bitlista/
a
bitopsaux
/
invert-one
list
/bitlista/
c