[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 11 from proof bytes2bytes-fix (previous step)

b2i(by) = 0, ∀ bytes0. # bytes0 < #(by + bytes1) → true → bytes0 = [] ∨ fix(# bytes0, int2bytes(bytes2int(bytes0))) = bytes0 ⊦ fix(1 + # bytes1, int2bytes(bytes2int(by ' + bytes1))) = by ' + bytes1

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 12:
1 < # bytes, b2i(bytes.first) = 0, b2i(bytes.rest.first) < 0 ⊦ int2bytes(bytes2int(bytes)) = bytes
Proof step 13:
¬(1 < #(by ' + bytes1) ∧ b2i((by ' + bytes1).first) = 0 ∧ b2i((by ' + bytes1).rest.first) < 0), b2i(by) = 0, ∀ bytes0. # bytes0 < #(by + bytes1) → true → bytes0 = [] ∨ fix(# bytes0, int2bytes(bytes2int(bytes0))) = bytes0 ⊦ fix(1 + # bytes1, int2bytes(bytes2int(by ' + bytes1))) = by ' + bytes1
Proof step 31:
1 < #(by ' + bytes1) ∧ b2i((by ' + bytes1).first) = 0 ∧ b2i((by ' + bytes1).rest.first) < 0, b2i(by) = 0, ∀ bytes0. # bytes0 < #(by + bytes1) → true → bytes0 = [] ∨ fix(# bytes0, int2bytes(bytes2int(bytes0))) = bytes0 ⊦ fix(1 + # bytes1, by ' + bytes1) = by ' + bytes1

Rule argument

name: bytes2bytes-zero rotate: F subst: [bytes] → [by ' + bytes1]

Additional information

Used terms: by ' + bytes1