[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 55 from proof setInt-theorem (previous step)

fillsgn(3, i2b(i >> 8) ') = by ' + by0 ' + by1 ', i >> 8 = b2i(i2b(i >> 8)), i < ~128 ∨ 128 ≤ i ⊦ i = b2i(i2b(i)), by = i2b(i >> 24) ∧ by0 = i2b(i >> 16) ∧ by1 = i2b(i >> 8)

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 56:
⊦ # bytes < n ∧ bytes2int(bytes) < 0 → fillsgn(n, bytes) = mklist(i2b(~1), n - # bytes) + bytes
Proof step 57:
¬(# i2b(i >> 8) ' < 3 ∧ bytes2int(i2b(i >> 8) ') < 0), fillsgn(3, i2b(i >> 8) ') = by ' + by0 ' + by1 ', i >> 8 = b2i(i2b(i >> 8)), i < ~128 ∨ 128 ≤ i ⊦ i = b2i(i2b(i)), by = i2b(i >> 24) ∧ by0 = i2b(i >> 16) ∧ by1 = i2b(i >> 8)
Proof step 73:
# i2b(i >> 8) ' < 3 ∧ bytes2int(i2b(i >> 8) ') < 0, mklist(i2b(~1), 3 - # i2b(i >> 8) ') + i2b(i >> 8) ' = by ' + by0 ' + by1 ', i >> 8 = b2i(i2b(i >> 8)), i < ~128 ∨ 128 ≤ i ⊦ i = b2i(i2b(i)), by = i2b(i >> 24) ∧ by0 = i2b(i >> 16) ∧ by1 = i2b(i >> 8)

Rule argument

spec: bytes inst: name: fillsgn-neg seq: ⊦ # bytes < n ∧ bytes2int(bytes) < 0 → fillsgn(n, bytes) = mklist(i2b(~1), n - # bytes) + bytes subst: [bytes, n] → [i2b(i >> 8) ', 3] flags: rewrite, current

Additional information

Used terms: i2b(i >> 8) ', 3