[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
,
Proof step 11 from proof byte-law-leftshift (
previous step
)
⊦ i2b(cast(8, i i<< j)) = i2b(cast(8, cast(8, i) i<< j))
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 12
:
0 < i ⊦ cast(i, j i<< j0) = cast(i, cast(i, j) i<< j0)
Rule argument
seq: 0 < i ⊦ cast(i, j i<< j0) = cast(i, cast(i, j) i<< j0) subst: [j0, j, i] → [j, i, 8] rotate: F spec: intops inst: name: cast-law-leftshift
Additional information
Used terms: j, i, 8