[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 5 from proof ubyte-inj (previous step)

b2i(by) = ub2i(by0), 0 ≤ ub2i(by0) ⊦ by = by0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 6:
⊦ b2i(by) < 0 → ub2i(by) = 256 + b2i(by)
Proof step 7:
b2i(by0) < 0, b2i(by) = 256 + b2i(by0), 0 ≤ 256 + b2i(by0) ⊦ by = by0

Rule argument

name: ubyte-neg rotate: F subst: [by] → [by0]

Additional information

Used simplifier rules: ubyte-pos: ⊦ 0 ≤ b2i(by) → ub2i(by) = b2i(by);%byte-equal: ⊦ b2i(byi) = b2i(byj) ↔ byi = byj;% ⊦ ¬ i < j ↔ j ≤ i; Used terms: by0