[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-lslen-12
⊦ 0 < i ∧ 0 ≤ j → (2 ^ j < i ↔ i→n(j) + 2 ≤ # int2bits(i) ∧ i ≠ 2 ^ j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
int2bits-lelen-06
,
int2bits-lslen
,
Used spec theorems:
Used simplifier rules:
intnat
/
i2i-pos
int-abs
/
lels
int-abs
/
lels-03
int-pot
/
pot2-pos-01
int-basic1
/
forward-pos
nat
/
lels
int-basic1
/
lst-01
intnat
/
n2i-add
intnat
/
i2i-pos-01
int-abs
/
numsub
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-basic1
/
ls-01
nat-basic2
/
c
nat-basic2
/
a
nat
/
add-num-03
nat-basic1
/
f
int-basic1
/
irref
int-pot
/
ls-pos-2pot
int-abs
/
zero-gels-04
int-pot
/
pot2-pos
int-abs
/
forward-le-05
int-abs
/
forward-le-01
nat
/
lels-01