[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 uint2bits-2pot-04
⊦ ¬ false ∈ bits ∧ 0 ≤ i → (uint2bits(i) = false ' + true ' + bits ↔ i = 2 ^ (n→i(# bits) + 1) - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-2pot-03
,
uint2bits-2pot-05
,
uint2bits-restsgn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 8
Used lemmas:
uint2bits-2pot-02
,
bits2uint-ones
,
bits2uint-zeros-03
,
uint2uint-pos
,
uint2bits-firstpos
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
e
list
/bitlista/
app-02-ant
int-basic2
/
add-c
list
/bitlista/
len
list
/bitlista/
len-02
intnat
/
n2i-add
nat-basic2
/
a
nat-basic2
/
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
list
/bitlista/
app-01
bitlista
/
notfalse
int-abs
/
Sub-def
list
/bitlista/
e-01
list
/bitlista/
in-10
list
/bitlista/
in-17
list
/bitlista/
in-append
list
/bitlista/
in-13
list
/bitlista/
in-14
list
/bitlista/
a
int-abs
/
sub-eq