[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 intshiftrsign-if
⊦ i i>> j = (# int2bits(i) ≤ i→n(band(j, 31)) ⊃ (i < 0 ⊃ ~1;0);bits2int(sublist(0, # int2bits(i) - i→n(band(j, 31)), int2bits(i))))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
intshiftrsign-band31
,
intshiftrsign-num
,
intshiftrsign-zero-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 19
Used lemmas:
intshiftrsign
,
Used spec theorems:
list-del
/bitlista/
sublist-mklist-01
list-del
/bitlista/
sublist-append-02
int2bits
/
bits2int-mklist
list-del
/bitlista/
sublist-firsteq
Used simplifier rules:
nat-basic2
/
pred
nat-basic2
/
oz
int-abs
/
lels-04
int2bits
/
int2bits-first-01
list
/bitlista/
a
list
/bitlista/
in-14
list
/bitlista/
c
list-data
/bitlista/
elim-list-c
list-del
/bitlista/
sublist-empty
nat-basic2
/
l-01
nat-basic1
/
lf-01
nat
/
elim-sub
nat
/
lels-03
list-last
/bitlista/
mk-len
nat-basic1
/
ls-02
int2bits
/
bits2int-mklist-04
int-abs
/
forward-le-01
int-abs
/
zero-gels-04
int2bits
/
bits2int-mklist-03
nat-basic2
/
z
nat-basic2
/
a
nat-basic2
/
c
nat
/
fle
nat-basic1
/
f
nat
/
fle-01
list-data
/bitlista/
l
int2bits
/
int2bits-not-empty
intnat
/
labs
int-basic1
/
irref
int-abs
/
forward-le-02
int-abs
/
lels-01
nat
/
lels
int2bits
/
int2bits-first-02
int-abs
/
lels
nat
/
lels-01