[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 bits2uint-ones
⊦ ¬ false ∈ bits ∧ bits ≠ [] → bits2uint(bits) = 2 ^ n→i(# bits) - 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bits2int-011x
,
bits2int-rec-03
,
bits2int-split-01
,
uint2bits-2pot-04
,
Used by units in proved state:
intops
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 8
Used lemmas:
bits2uint-base
,
bits2uint-one
,
Used spec theorems:
list
/bitlista/
lastdiv-rew
int-pot
/
succ
Used simplifier rules:
list-data
/bitlista/
size-01
nat-basic2
/
s
nat-basic1
/
ref-1
int-mult
/
eq-pos
intnat
/
nat2int
int-basic2
/
add-c
int-basic2
/
add-a
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
succ-rmerge
list
/bitlista/
in-17
list
/bitlista/
in-append
nat-basic2
/
c
nat-basic2
/
a
intnat
/
n2i-add
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
int-abs
/
sub-eq