[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-truein-01
⊦ true ∈ int2bits(j).rest ↔ j ≠ 0 ∧ ¬(∃ i. 0 ≤ i ∧ j = ~(2 ^ i))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
uint2bits-add-high
,
uint2bits-truein
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
uint2bits-onein
,
uint2bits-expos0
,
int2bits-first
,
int2int-inj
,
bits2int-2pot
,
int2bits-truein
,
int2bits-not-empty
,
int2bits-pos
,
int2bits-2pot-01
,
int2bits-zero
,
Used spec theorems:
Used simplifier rules:
list
/bitlista/
in-append
list
/bitlista/
in-17
list
/bitlista/
in-06
list
/bitlista/
in-13
int-abs
/
lels-02
intnat
/
nat2int-08
int-basic2
/
succ-01
int-basic2
/
ls
int-basic1
/
trans
int-basic1
/
lf-01
int-basic1
/
lf-03
int-basic2
/
ls-02
int-basic1
/
lf-02
list
/bitlista/
in-14
list
/bitlista/
c
list-data
/bitlista/
elim-list
int-abs
/
lels-01
int-abs
/
neg-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
neg-10
int-pot
/
two-zero
list
/bitlista/
c-07
list
/bitlista/
a
bitlista
/
inmklist
list
/bitlista/
in-empty
list
/bitlista/
rest
int-abs
/
negeq