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

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

User applied rule cut formula

And obtained the following new goals

Proof step 77:
n * 8 ≠ # bits, # bits2bytes(bits) < n, # bits ≤ 8 * n ⊦ mklist(i2b(0), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(false, n * 8 - # bits) + bits), bits = [], bits.first, # bits % 8 = 0 ∧ n * 8 ≠ # bits
Proof step 131:
# bits2bytes(bits) < n, # bits ≤ 8 * n ⊦ n * 8 ≠ # bits, mklist(i2b(0), n - # bits2bytes(bits)) + bits2bytes(bits) = bits2bytes(mklist(false, n * 8 - # bits) + bits), bits = [], bits.first, # bits % 8 = 0 ∧ n * 8 ≠ # bits

Rule argument

fma: n * 8 ≠ # bits

Additional information

Used formulas: n * 8 ≠ # bits