[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-2pot
⊦ ¬ true ∈ bits → bytes2int(bits2bytes(true ' + bits)) = ~(2 ^ n→i(# bits))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 4
Used lemmas:
bits2bits-sgn
,
bytes2int
,
Used spec theorems:
int2bits
/
bits2int-sgn
Used simplifier rules:
list
/bitlista/
e
list
/bitlista/
app-02-ant
bitopsaux
/
sgn-base-04
list
/bitlista/
a
int2bits
/
bits2int-2pot
int-abs
/
neg-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
negeq