[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-minus-one
⊦ j ≠ 0 ∧ n ≠ 0 → >>>(n, ~1, j) = (2 ^ n→i(n) - 1) >> j
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: 12
Proof steps: 22
Used lemmas:
shiftrsign-01
,
shiftrzero-def-01
,
Used spec theorems:
list-del
/bitlista/
sublist-def
int2bits
/
int2bits-mone
bitopsaux
/
fill-rec-one
int2bits
/
bits2int-pos-02
list-del
/bitlista/
firstn-first
list-last
/bitlista/
mk-first
list-last
/bitlista/
mk-last
Used simplifier rules:
list
/bitlista/
app-03
list
/bitlista/
app-02-ant
list-last
/bitlista/
mk-empty
intnat
/
abs-zero
list-del
/bitlista/
firstN-empty
int2bits
/
bits2int-pos
nat-basic2
/
c
nat-basic2
/
a
list
/bitlista/
c
list-del
/bitlista/
weak-firstN-rec
nat-basic1
/
f
nat-basic1
/
z
list-del
/bitlista/
restN-zero
list
/bitlista/
c-08
list
/bitlista/
a
list-last
/bitlista/
mk-len
list
/bitlista/
len-02
list
/bitlista/
len
intnat
/
n2n
int2bits
/
int2bits-2pot-02
intnat
/
nat2int