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

# int2bits(j0) = 17, ~65536 < j0, j0 < ~32768, j0 < 0 ⊦ j0 = 0, s2i(i2s(bits2int(lastn(16, int2bits(j0))))) = j0 + 65536

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 16:
⊦ # bits = n + 1 → lastn(n, bits) = bits.rest
Proof step 17:
# int2bits(j0) = 16 + 1, # int2bits(j0) = 17, ~65536 < j0, j0 < ~32768, j0 < 0 ⊦ j0 = 0, s2i(i2s(bits2int(int2bits(j0).rest))) = j0 + 65536

Rule argument

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

Additional information

Used simplifier rules: a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic2%c: ⊦ m + n = n + m; from specification nat-basic2 Used terms: int2bits(j0), 16