[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 shiftright-pos-div-01
⊦ 0 ≤ i → i >> j = i / 2 ^ abs(j)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
shiftright-not-neg
,
shiftright-rec-8
,
Used by units in proved state:
bytes
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
shiftright-pos-div
,
shiftright-abs
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
abs-03
int-abs
/
forward-le-01