[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-03
⊦ i < ~1 → (# int2bits(i) < m ↔ 0 ≤ i + 2 ^ (n→i(m) - 2))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
intops
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
int2bits-lslen
,
int2bits-len-neg-01
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-04
int-abs
/
lels-03
int-abs
/
mone-06
int-abs
/
numls-02
int-abs
/
neg-13
int-abs
/
neg
int-abs
/
numls-03
int-abs
/
lels
int-abs
/
mone-08
int-basic2
/
add-a
int-basic2
/
add-c
int-basic1
/
lf-03
int-basic1
/
lf-02
int-abs
/
forward-lsle
nat-basic1
/
f
int-abs
/
subsub
nat
/
lels
int-basic1
/
numlsf
int-abs
/
lels-01