[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
⦠0 < i ā (# int2bits(i) < m ā i < 2 ^ (nāi(m) - 2))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-lslen-03
,
int2bits-lslen-12
,
Used by units in proved state:
intops
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 8
Used lemmas:
int2bits-not-empty
,
int2bits-lelen
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-04
nat
/
fle
nat-basic1
/
f
nat
/
fle-01
list-data
/bitlista/
l
nat-basic1
/
ref-1
int-abs
/
elim-sub
nat-basic2
/
oz
nat-basic2
/
s
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
mone-01
int-abs
/
numsub
intnat
/
n2i-add
nat
/
lez
nat
/
elim-pred-c
nat-basic2
/
c
nat-basic2
/
a
nat
/
succ-01
nat
/
ls-02
nat
/
lels-01
nat-basic1
/
one-01
nat-basic1
/
less-1
int-abs
/
lels-01
int-basic1
/
ls-01
nat
/
pred-03
int-abs
/
lels-03
nat
/
lels
int-abs
/
lels