[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
⊦ i < ~1 ∧ n ≠ 0 → >>>(n, i, 1) = bits2uint(fillsgn(n -1, int2bits((i - 1) / 2)))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shiftzero-by-one-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:
shiftrzero-def-01
,
Used spec theorems:
list-del
/bitlista/
sublist-def
int2bits
/
int2bits-rec-neg
bitopsaux
/
fill-last
Used simplifier rules:
nat-basic2
/
pred
list
/bitlista/
Last
list
/bitlista/
len
list
/bitlista/
len-02
list-del
/bitlista/
weak-firstN-rec
list-del
/bitlista/
firstN-len
list
/bitlista/
c
int2bits
/
bits2int-pos
int2bits
/
int2bits-not-empty
int-div
/
mod2-neg-odd
int-abs
/
lels
int-abs
/
lels-03
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
oz
nat
/
elim-pred-c
list-del
/bitlista/
restN-zero
list
/bitlista/
a
list
/bitlista/
app
list-last
/bitlista/
mk-zero
bitlista
/
mklist-num
int-basic1
/
numlsf
nat
/
pred-03