[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 8 from proof byte-law-add-pos (
previous step
)
j + i % 256 = i0 + 256, 0 < i % 256, 0 ≤ j, 0 ≤ i, 127 < i % 256 ⊦ i2b(i + j) = i2b(i0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 9
:
j + i % 256 = i0 + 256, 0 < i % 256, 0 ≤ j, 0 ≤ i, 127 < i % 256 ⊦ i2b(i + j) = i2b(i0)
Rule argument
Additional information