[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 32 from proof fix2rest-last (previous step)

# bytes0 ≤ 1, bytes2int(bytes0 + by ') < 0 ⊦ (mklist(i2b(~1), 2 - # bytes0 + 1) + bytes0 + by ').rest = by '

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 33:
⊦ bytes ≠ [] → (bytes + bytes0).rest = bytes.rest + bytes0
Proof step 34:
¬ mklist(i2b(~1), 2 - # bytes0 + 1) ≠ [], # bytes0 ≤ 1, bytes2int(bytes0 + by ') < 0 ⊦ (mklist(i2b(~1), 2 - # bytes0 + 1) + bytes0 + by ').rest = by '
Proof step 41:
mklist(i2b(~1), 2 - # bytes0 + 1) ≠ [], # bytes0 ≤ 1, bytes2int(bytes0 + by ') < 0 ⊦ mklist(i2b(~1), 2 - # bytes0 + 1).rest + bytes0 + by ' = by '

Rule argument

seq: ⊦ bytes ≠ [] → (bytes + bytes0).rest = bytes.rest + bytes0 subst: [bytes0, bytes] → [bytes0 + by ', mklist(i2b(~1), 2 - # bytes0 + 1)] rotate: F spec: list inst: bytelist name: rest-01

Additional information

Used terms: bytes0 + by ', mklist(i2b(~1), 2 - # bytes0 + 1)