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

# bits = m * 8 + n0, bits.first, # bits2bytes(bits) < n, m * 8 + n0 < 8 * n, n0 < 8, m < n ⊦ mklist(i2b(~1), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(true, (n - 1 - m) * 8) + mklist(true, 8 - n0) + bits), bits = [], n * 8 = m * 8 + n0, n0 = 0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 188:
⊦ # bits0 % 8 = 0 ∧ bits ≠ [] ∧ bits0 ≠ [] → bits2bytes(bits + bits0) = bits2bytes(bits) + bits2bytes(bits0)
Proof step 189:
¬(#(mklist(true, 8 - n0) + bits) % 8 = 0 ∧ mklist(true, (n - 1 - m) * 8) ≠ [] ∧ mklist(true, 8 - n0) + bits ≠ []), # bits = m * 8 + n0, bits.first, # bits2bytes(bits) < n, m * 8 + n0 < 8 * n, n0 < 8, m < n ⊦ mklist(i2b(~1), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(true, (n - 1 - m) * 8) + mklist(true, 8 - n0) + bits), bits = [], n * 8 = m * 8 + n0, n0 = 0
Proof step 212:
#(mklist(true, 8 - n0) + bits) % 8 = 0 ∧ mklist(true, (n - 1 - m) * 8) ≠ [] ∧ mklist(true, 8 - n0) + bits ≠ [], # bits = m * 8 + n0, bits.first, # bits2bytes(bits) < n, m * 8 + n0 < 8 * n, n0 < 8, m < n ⊦ mklist(i2b(~1), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(true, (n - 1 - m) * 8)) + bits2bytes(mklist(true, 8 - n0) + bits), bits = [], n * 8 = m * 8 + n0, n0 = 0

Rule argument

name: bits2bytes-app rotate: F subst: [bits0, bits] → [mklist(true, 8 - n0) + bits, mklist(true, (n - 1 - m) * 8)]

Additional information

Used terms: mklist(true, 8 - n0) + bits, mklist(true, (n - 1 - m) * 8)