[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 int2bits-2pot-03
0 ≤ j, ¬ false ∈ int2bits(j).rest ⊦ j = 2 ^ n→i(# int2bits(j).rest) - 1
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: 4
Proof steps: 7
Used lemmas:
uint2bits-2pot-02
,
uint2bits-2pot-04
,
uint2bits-empty
,
uint2bits-first
,
uint2bits-firstpos
,
uint2bits-zero
,
uint2bits-expos0
,
int2bits-pos
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
in-06
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
nat2int
int-abs
/
mone-06
int-abs
/
numls-02
intnat
/
nat2int-09
list-last
/bitlista/
mk-plus
bitlista
/
mklist-01
list-last
/bitlista/
mklist-one
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
c-07
list
/bitlista/
len
list
/bitlista/
len-02
intnat
/
n2i-add
int-abs
/
Sub-def
int-abs
/
lels-01
int-abs
/
lels-04
list
/bitlista/
in-09
list
/bitlista/
in-13
list
/bitlista/
in-14
list
/bitlista/
a
int-abs
/
lels
int-abs
/
anti
list
/bitlista/
rest
list-data
/bitlista/
size-01
int-abs
/
sub-eq