[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 bor-shift-plus
⊦ j0 < 2 ^ i ∧ 0 ≤ j0 ∧ 0 ≤ i ∧ i < 32 → bor(j i<< i, j0) = j * 2 ^ i + j0
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: 3
Proof steps: 3
Used lemmas:
intshiftleft-is-mult
,
bor-2pot-plus-01
,
bor-2pot-plus
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels
int-abs
/
lels-03
int-mult
/
commutativity
int-basic2
/
add-c
int-abs
/
lels-01
int-abs
/
lels-04
int-abs
/
numlelsdel