[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 uint2bits-len-min
0 ≤ i, 0 ≤ j, 2 ^ i ≤ j ⊦ i→n(i + 1) < # uint2bits(j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
uint2bits-2potrec
,
uint2bits-mod2pot
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
uint2bits-len
,
uint2bits-zero
,
Used spec theorems:
int-pot
/
exin2pot
intnat
/
add-01
Used simplifier rules:
nat
/
le-num-02
nat
/
succ-01
intnat
/
labs
int-abs
/
absle
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
lels-03
int-abs
/
forward-lele
int-abs
/
numlsf-01
int-abs
/
ler
int-abs
/
succ-02
int-pot
/
ls-pos
int-abs
/
forward-lels
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
lels-02
int-pot
/
two-lez
nat-basic2
/
c
nat-basic2
/
a
nat
/
lep
list
/bitlista/
len-02
int-abs
/
anti
int-abs
/
lels
nat
/
lels
int-basic2
/
add-c
int-basic2
/
add-a
intnat
/
rax-04