[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-split
⊦ # bits0 ≠ 0 ∧ # bits ≠ 0 ∧ ¬ bits.first → bits2int(bits + bits0) = bits2uint(bits) * 2 ^ n→i(# bits0) + bits2uint(bits0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2int-lastn-posneg
,
int2int-lastn-pospos
,
Used by units in proved state:
intops
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
bits2uint-split
,
bits2uint-zeros-03
,
bits2int-pos-02
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
app-02-ant
list
/bitlista/
first-01
list-data
/bitlista/
elim-list-c
list
/bitlista/
a
list
/bitlista/
e-01
list
/bitlista/
c
int-mult
/
commutativity
int-basic2
/
add-c
list-data
/bitlista/
l