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

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

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 102:
⊦ m0 * m = 0 ↔ m0 = 0 ∨ m = 0
Proof step 103:
n - 1 - m = 0 ∨ 8 = 0, # bits = m * 8 + n0, 1 + m < n, m < n, n0 < 8 ⊦ bits = [], n * 8 = # bits, n0 = 0, mklist(i2b(0), n - 1 + m) + bits2bytes(bits) = bits2bytes(mklist(false, 8 - n0) + bits), bits.first

Rule argument

seq: ⊦ m0 * m = 0 ↔ m0 = 0 ∨ m = 0 subst: [m, m0] → [8, n - 1 - m] rotate: F spec: nat-mult inst: name: zero-01

Additional information

Used terms: 8, n - 1 - m