[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-2pot-pos
⊦ 0 ≤ i ∧ 0 < j ∧ j < 32 → i i>> j = i / 2 ^ j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
intshiftrsign-abs-le
,
intshiftrsign-pos-8
,
intshiftrsign-pos-num
,
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
intshiftrsign-rec-pos
,
intshiftrsign-zero
,
Used spec theorems:
int-pot
/
div2-2pot-01
Used simplifier rules:
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
Sub-def
int-abs
/
sub-le-01
int-abs
/
leone
int-div
/
neqf
int-abs
/
sub-eq-01
int-abs
/
bet
int-abs
/
sub-ls-01
int-abs
/
numleledel-01
int-div
/
div-two-zero-01
int-basic1
/
numlslsdel
int-abs
/
sub-ls
intnat
/
abs-pred
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
numlelsdel
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-basic1
/
forward-pos