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

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

User applied rule cut formula

And obtained the following new goals

Proof step 55:
# bits = m * 8 + n0, ((8 - n0) + # bits) % 8 = 0, n0 < 8, # bits2bytes(bits) < n, # bits ≤ 8 * (n - 1), m < n ⊦ bits.first, bits = [], mklist(i2b(0), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(false, (n - 1 - m) * 8)) + bits2bytes(mklist(false, 8 - n0) + bits), n * 8 = # bits, n0 = 0, mklist(false, 8 - n0) + bits = [], n - 1 - m = 0, bits.first

Rule argument

fma: bits.first

Additional information

Used formulas: bits.first