[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 shiftzero-by-one-01
⊦ i < ~1 ∧ n ≠ 0 → >>>(n, i, 1) = 2 ^ n→i((# fillsgn(n, int2bits(i)))-1) + (i - 1) / 2
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shiftzero-max-neg
,
shiftzero-max-neg-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
shiftzero-by-one
,
Used spec theorems:
int2bits
/
ubits2bits
int2bits
/
bits2int-fill
int2bits
/
int2bits-rec-neg
bitopsaux
/
fill-last
Used simplifier rules:
list
/bitlista/
Last
list
/bitlista/
len
list
/bitlista/
len-02
list
/bitlista/
a
nat
/
add-01
nat-basic2
/
z
nat-basic2
/
a
nat-basic2
/
c
int-div
/
mod2-neg-odd
int-basic2
/
add-in
int2bits
/
int2int-inj
int-abs
/
zero-gels-01
bitopsaux
/
fill-empty
int2bits
/
int2bits-not-empty
int2bits
/
int2bits-fillfirst
int2bits
/
int2bits-first-02
int-div
/
div-ls-zero
int-abs
/
sub-add-01
int-abs
/
numsub
int-abs
/
numle-03
int-abs
/
mone-05
int-abs
/
lels-03
int-basic1
/
numlsf
nat
/
pred-03
int-abs
/
lels
int-abs
/
mone-08
int-abs
/
minus-add
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-eq