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

# bits = m * 8 + n0, n0 < 8, bits.first, # bits2bytes(bits) < n, 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 = # bits, n0 = 0, ((8 - n0) + # bits) % 8 = 0 ∧ (n - 1 - m) * 8 ≠ 0

User applied rule insert equation

And obtained the following new goals

Proof step 191:
# bits = m * 8 + n0, n0 < 8, bits.first, # bits2bytes(bits) < n, 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, ((8 - n0) + m * 8 + n0) % 8 = 0 ∧ (n - 1 - m) * 8 ≠ 0

Rule argument

pos: left 1 flags:

Proof step 190 from proof fix-bits2bytes-01 (previous step)

User applied rule insert equation

And obtained the following new goals

Rule argument

Additional information