[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 19 from proof bytes2int-len-one-02 (previous step)

0 ≤ band(255, b2i(by0)) + 256 * bytes2int((i2b(0) ' + by ') + bytes0), b2i(by) < 0, band(255, b2i(by0)) + 256 * bytes2int((i2b(0) ' + by ') + bytes0) < 128 ⊦ 256 * bytes2int((i2b(0) ' + by ') + bytes0) < 128

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 20:
⊦ i + j ≤ j0 ∧ 0 < j → i < j0
Proof step 21:
¬(256 * bytes2int((i2b(0) ' + by ') + bytes0) + band(255, b2i(by0)) ≤ 128 ∧ 0 < band(255, b2i(by0))), 0 ≤ band(255, b2i(by0)) + 256 * bytes2int((i2b(0) ' + by ') + bytes0), b2i(by) < 0, band(255, b2i(by0)) + 256 * bytes2int((i2b(0) ' + by ') + bytes0) < 128 ⊦ 256 * bytes2int((i2b(0) ' + by ') + bytes0) < 128

Rule argument

seq: ⊦ i + j ≤ j0 ∧ 0 < j → i < j0 subst: [i, j, j0] → [256 * bytes2int((i2b(0) ' + by ') + bytes0), band(255, b2i(by0)), 128] rotate: F spec: int-abs inst: name: discard-add2-lels-left

Additional information

Used terms: 256 * bytes2int((i2b(0) ' + by ') + bytes0), band(255, b2i(by0)), 128