[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 34 from proof fix-bits2bytes-01 (previous step)

# bits = 8 * m + n0, m < # bits2bytes(bits), # bits ≤ 8 * m + 8, n0 < 8 ⊦ lastn(m + 1, bits2bytes(bits)) = bits2bytes(mklist(bits.first, 8 * m + 8 - # bits) + bits), n0 = 0, bits = []

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 35:
⊦ n = # bytes → lastn(n, bytes) = bytes
Proof step 36:
m + 1 ≠ # bits2bytes(bits), # bits = 8 * m + n0, m < # bits2bytes(bits), # bits ≤ 8 * m + 8, n0 < 8 ⊦ lastn(m + 1, bits2bytes(bits)) = bits2bytes(mklist(bits.first, 8 * m + 8 - # bits) + bits), n0 = 0, bits = []
Proof step 43:
m + 1 = # bits2bytes(bits), # bits = 8 * m + n0, m < # bits2bytes(bits), # bits ≤ 8 * m + 8, n0 < 8 ⊦ bits2bytes(bits) = bits2bytes(mklist(bits.first, 8 * m + 8 - # bits) + bits), n0 = 0, bits = []

Rule argument

seq: ⊦ n = # bytes → lastn(n, bytes) = bytes subst: [bytes, n] → [bits2bytes(bits), m + 1] rotate: F spec: list-del inst: bytelist name: lastN-all

Additional information

Used terms: bits2bytes(bits), m + 1