[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-05
⊦ i < ~1 → (m ≤ # int2bits(i) ↔ ¬ 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:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
int2bits-leneq-neg
,
int2bits-not-empty
,
int2bits-lslen-02
,
Used spec theorems:
nat-basic1
/
lstwo
intnat
/
sub
Used simplifier rules:
nat
/
le-add
nat
/
le-num-02
nat-basic2
/
l
nat-basic1
/
ref-1
nat
/
lep
nat
/
add-num-03
nat
/
elim-sub
intnat
/
n2n
nat-basic1
/
twols-02
nat-basic1
/
lf-01
nat
/
let
nat
/
anti
nat
/
not-zero
int-basic2
/
add-zero
int-abs
/
lels-03
int-abs
/
zero-gels-01
int-abs
/
forward-lsle
int-abs
/
forward-le-01
nat-basic2
/
c
nat-basic2
/
a
list-data
/bitlista/
l
nat-basic1
/
one-01
nat
/
l-num-05
nat-basic2
/
succ
nat-basic1
/
trans-1
nat-basic1
/
f
nat-basic1
/
lf
nat
/
lels-01
intnat
/
num-n2i-ls-06
int-basic2
/
add-a
int-abs
/
sub-le-01
int-basic1
/
numlsf
int-basic2
/
add-c