[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-zero-size
⊦ j ≠ 0 → >>>(0, i, j) = bits2uint(int2bits(i)) >> j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shiftzero-zero-size-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:
int2bits
/
int2uint-pos-01
int2bits
/
int2bits-bits2unit
list-del
/bitlista/
sublist-def
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
int2bits
/
int2bits-not-empty
list-data
/bitlista/
l
list-del
/bitlista/
firstN-empty
int2bits
/
bits2int-pos
nat-basic2
/
c
nat-basic2
/
a
list
/bitlista/
c
list-del
/bitlista/
weak-firstN-rec
list-del
/bitlista/
restN-zero
list
/bitlista/
a
list
/bitlista/
len-02
list
/bitlista/
len
int-abs
/
forward-le-02
int-abs
/
lels-01
int2bits
/
bits2uint-not-neg-01
int2bits
/
int2bits-first-02
bitopsaux
/
fill-zero