[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-lelen-06
⊦ 0 < i → (m ≤ # int2bits(i) ↔ ¬ i < 2 ^ (n→i(m) - 2))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
int2bits-lslen-12
,
Used by units in proved state:
intops
,
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 10
Used lemmas:
int2bits-not-empty
,
int2bits-lslen-01
,
Used spec theorems:
intnat
/
sub
Used simplifier rules:
nat
/
le-ls-simp
nat
/
sub-ls
nat-basic2
/
eq
nat
/
add-num-04
nat-basic2
/
l-01
nat
/
le-num-02
nat
/
le-add
nat
/
elim-sub
nat
/
zero-01
intnat
/
n2n
nat
/
lels-02
intnat
/
num-i2n-eq
nat-basic1
/
ls-02
intnat
/
num-n2i-eq
int-abs
/
sub-eq
intnat
/
abs-zero
nat-basic1
/
one
nat
/
l-num-04
nat
/
fle
nat
/
lels-03
intnat
/
num-n2i-ls-02
int-abs
/
sub-ls-01
int-abs
/
leone
intnat
/
num-i2n-le-02
nat-basic1
/
twols-02
nat
/
anti
nat
/
le-num-04
nat
/
let
nat
/
not-zero
int-abs
/
forward-le-05
int-abs
/
sub-le-01
int-basic2
/
add-a
int-basic2
/
add-c
intnat
/
num-n2i-ls-06
nat
/
lels-01
nat-basic1
/
lf
nat-basic1
/
trans-1
nat-basic1
/
f
nat-basic2
/
succ
nat
/
l-num-05
nat-basic1
/
one-01
list-data
/bitlista/
l
nat-basic2
/
a
nat-basic2
/
c
int-basic1
/
forward-pos
int-pot
/
pot2-pos
nat
/
ls-le-simp