[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-05
⊦ ¬ false ∈ bits ∧ 0 ≤ i → (uint2bits(i) = boolvar ' + bits ↔ ¬ boolvar ∧ i = 2 ^ n→i(# bits) - 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-falsein-01
,
uint2bits-restsgn
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 12
Used lemmas:
uint2bits-zero
,
uint2bits-2pot-02
,
uint2bits-2pot-04
,
uint2bits-zero-01
,
uint2bits-firstpos
,
uint2bits-first-01
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
app-01
bitlista
/
mklist-01
intnat
/
n2n
intnat
/
num-n2i-ls-02
nat-basic1
/
z
list-data
/bitlista/
l
list
/bitlista/
c-04
int-abs
/
leone
int-abs
/
sub-le-01
int-abs
/
Sub-def
list
/bitlista/
c
list
/bitlista/
len
list
/bitlista/
len-02
nat
/
add-01
nat-basic2
/
z
nat-basic2
/
a
nat-basic2
/
c
list
/bitlista/
e-01
intnat
/
n2i-add
list
/bitlista/
in-06
list-data
/bitlista/
elim-list
nat
/
pred-03
list-data
/bitlista/
length-rest
int-abs
/
lels-04
int-abs
/
lels-01
list
/bitlista/
in-07
list
/bitlista/
app
list
/bitlista/
in-empty
int-abs
/
lels-02
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
numadd-01
list-data
/bitlista/
size-01
int-abs
/
one-03
list
/bitlista/
in-14
int-abs
/
sub-eq
list
/bitlista/
a