[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
⊦ 0 ≤ i ∧ 0 ≤ j → i >> j = i / 2 ^ j
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
divide-by-10
,
longshiftright-2pot-pos
,
longshiftzero-carry-01
,
longshiftzero-zero-03
,
shiftright-pos-div-01
,
shiftright-shift
,
shiftzero-max-neg-01
,
Used by units in proved state:
bytes
,
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 9
Used lemmas:
shiftright-zero
,
rightshift-zero
,
shiftright-rec-pos
,
Used spec theorems:
int-pot
/
div2-2pot-01
Used simplifier rules:
int-abs
/
Sub-def
int-div
/
zero
int-pot
/
two-zero
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-abs
/
negle-07
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
minus-one-01
int-mult
/
numle-07
int-div
/
num-ls
int-abs
/
absle
int-div
/
abs
intnat
/
labs
int-div
/
div-two-zero-01
int-abs
/
numleledel-01
int-abs
/
sub-le-01
int-abs
/
leone
int-abs
/
forward-le-05
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
lels
int-abs
/
anti
int-div
/
one
int-abs
/
forward-le-01