[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-03
⊦ ¬ true ∈ bits ∧ 0 ≤ i → (uint2bits(i) = false ' + true ' + bits ↔ i = 2 ^ n→i(# bits))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-len-neg
,
int2int-inj
,
int2uint-neg
,
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:
uint2uint-pos
,
bits2uint-2pot-01
,
uint2bits-firstpos
,
uint2bits-2pot
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
in-13
list
/bitlista/
in-14
list
/bitlista/
a
list
/bitlista/
app-01
bitlista
/
mklist
intnat
/
n2n
intnat
/
nat2int