[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 18 from proof bib-pos-high (previous step)

127 < j, 64 ≤ j, j < 256, 0 < j ⊦ j = 256 + b2i(i2b(bits2int(lastn(8, int2bits(j))))), 0 = j, lastn(8, int2bits(j)).first

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 19:
⊦ # bits = n + 1 → lastn(n, bits) = bits.rest
Proof step 20:
# int2bits(j) ≠ 8 + 1, 127 < j, 64 ≤ j, j < 256, 0 < j ⊦ j = 256 + b2i(i2b(bits2int(lastn(8, int2bits(j))))), 0 = j, lastn(8, int2bits(j)).first
Proof step 23:
# int2bits(j) = 8 + 1, 127 < j, 64 ≤ j, j < 256, 0 < j ⊦ j = 256 + b2i(i2b(bits2int(int2bits(j).rest))), 0 = j, int2bits(j).rest.first

Rule argument

seq: ⊦ # bits = n + 1 → lastn(n, bits) = bits.rest subst: [bits, n] → [int2bits(j), 8] rotate: F spec: list-del inst: bitlista name: lastN-rest-01

Additional information

Used terms: int2bits(j), 8