[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 intshiftright-unbounded-same
⊦ 0 ≤ i ∧ i < 32 → j i>> i = j >> i
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
shiftrsign-01
,
band-commutativity
,
band-associativity
,
band-31-pos
,
intshiftrsign
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int2bits
/
int2bits-first-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05