[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-len-pos-01
⊦ 0 ≤ j ∧ j < 2 ^ i → (i→n(i) < # int2bits(j) ↔ # int2bits(j) = i→n(i) + 1)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
intops
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 6
Used lemmas:
int2bits-eq
,
int2bits-first-02
,
int2bits-len-range
,
int2bits-not-empty
,
Used spec theorems:
intnat
/
abs-succ-03
int-abs
/
Abs-neg
Used simplifier rules:
list-data
/bitlista/
l
nat-basic2
/
succ-03
nat
/
eq
nat
/
lels
int-abs
/
negle-13
int-abs
/
lels-01
int-abs
/
forward-lsle
int-basic1
/
lf-01
int-basic1
/
trans
int-basic2
/
ls
int-pot
/
two-lsz
int-abs
/
numadd-01
intnat
/
abs-zero
nat-basic1
/
f
intnat
/
labs
nat
/
fle
int-abs
/
abs-16
int-abs
/
abs-17
int-abs
/
ler
nat
/
les
int-abs
/
neg-06
int-abs
/
neg-07
int-basic1
/
numlsf
int-abs
/
abs-08
int-abs
/
neg-03
int-abs
/
Abs-pos
int-abs
/
succ-02
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
numls-03
int-abs
/
lels
int-abs
/
lels-02
int-abs
/
mone-06
int-abs
/
anti
int-abs
/
forward-lele
int-abs
/
forward-lels
nat-basic2
/
a
nat-basic2
/
c
list-data
/bitlista/
lf-01
list
/bitlista/
c
list
/bitlista/
app
list
/bitlista/
a