[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 15 from proof byte-law-mult-one (
previous step
)
~256 < j0 ∧ j0 < ~128, ~256 < j0, i0 ≤ 0, i0 * 256 + j0 < 0, j0 < 0 ⊦ j0 = 0, i2b(j0 * j) = i2b((j0 + 256) * j)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 16
:
j0 < 0, i0 * 256 + j0 < 0, i0 ≤ 0, ~256 < j0, j0 < ~128 ⊦ i2b(j0 * j) = i2b((j0 + 256) * j), j0 = 0
Rule argument
Additional information