[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 18 from proof byte-law-mult-one (
previous step
)
j0 < 0, i0 * 256 + j0 < 0, i0 ≤ 0, ~256 < j0, j0 < ~128 ⊦ i2b(j0 * j) = i2b(j * 256 + j0 * j), j0 = 0
User applied rule insert rewrite lemma
And obtained the following new goals
Proof step 19
:
⊦ i2b(i * 256 + j) = i2b(j)
Rule argument
name: byte-mult-256 rotate: F subst: [j, i] → [j0 * j, j]
Additional information
Used terms: j0 * j, j