[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 30 from proof sis-neg-low (previous step)

# int2bits(j0) = 17, i0 < 0, i0 * 65536 + j0 < 0, ~65536 < j0, i0 * 65536 + j0 < ~32768, j0 < ~32768, j0 < 0, 16 ≤ # int2bits(j0).rest ⊦ s2i(i2s(bits2int(lastn(16, int2bits(j0).rest)))) = j0 + 65536, j0 = 0, int2bits(j0).rest = []

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 31:
⊦ n = # bits → lastn(n, bits) = bits
Proof step 32:
16 ≠ # int2bits(j0).rest, # int2bits(j0) = 17, i0 < 0, i0 * 65536 + j0 < 0, ~65536 < j0, i0 * 65536 + j0 < ~32768, j0 < ~32768, j0 < 0, 16 ≤ # int2bits(j0).rest ⊦ s2i(i2s(bits2int(lastn(16, int2bits(j0).rest)))) = j0 + 65536, j0 = 0, int2bits(j0).rest = []
Proof step 35:
16 = # int2bits(j0).rest, # int2bits(j0) = 17, i0 < 0, i0 * 65536 + j0 < 0, ~65536 < j0, i0 * 65536 + j0 < ~32768, j0 < ~32768, j0 < 0, 16 ≤ # int2bits(j0).rest ⊦ s2i(i2s(bits2int(int2bits(j0).rest))) = j0 + 65536, j0 = 0, int2bits(j0).rest = []

Rule argument

spec: list-del inst: bitlista name: lastN-all seq: ⊦ n = # bits → lastn(n, bits) = bits subst: [bits, n] → [int2bits(j0).rest, 16] flags: rewrite

Additional information

Used terms: int2bits(j0).rest, 16