[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-01
⊦ 0 < i ∧ 0 ≤ j → (i < 2 ^ j ↔ # int2bits(i) ≤ i→n(j) + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-lelen-06
,
int2bits-leneq-pos
,
int2bits-lslen-06
,
Used by units in proved state:
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 1
Used lemmas:
int2bits-lelen
,
Used spec theorems:
Used simplifier rules:
intnat
/
n2i-add
intnat
/
i2i-pos-01
nat-basic2
/
a
nat-basic2
/
c
int-abs
/
numsub
int-basic2
/
add-zero
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
lels
int-abs
/
lels-03