[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 60 from proof int2bits-add-high (previous step)

0 ≤ j0 + 2 ^ i, j < 0, j0 < 0, 0 < i, 2 ^ (i - 1) + j0 < 0, 0 < 2 ^ i + j0, 0 ≤ i, j * 2 ^ i + j0 < 0, 0 ≤ 2 ^ i * (2 ^ n→i(# int2bits(1 - j)) + j) + j0, 1 < 2 ^ n→i(# int2bits(1 - j)) + j, 0 < 2 ^ n→i(# int2bits(1 - j)) + j ⊦ sgn(uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest + fillsgn(i→n(i), int2bits(j0).rest)) = sgn(uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest) + fillsgn(i→n(i), int2bits(j0).rest), ∃ i0. 1 = 2 ^ i0 + j

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 61:
⊦ true ∈ bits ∧ false ∈ bits → sgn(bits + bits0) = sgn(bits) + bits0
Proof step 62:
¬(true ∈ uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest ∧ false ∈ uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest), 0 ≤ j0 + 2 ^ i, j < 0, j0 < 0, 0 < i, 2 ^ (i - 1) + j0 < 0, 0 < 2 ^ i + j0, 0 ≤ i, j * 2 ^ i + j0 < 0, 0 ≤ 2 ^ i * (2 ^ n→i(# int2bits(1 - j)) + j) + j0, 1 < 2 ^ n→i(# int2bits(1 - j)) + j, 0 < 2 ^ n→i(# int2bits(1 - j)) + j ⊦ sgn(uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest + fillsgn(i→n(i), int2bits(j0).rest)) = sgn(uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest) + fillsgn(i→n(i), int2bits(j0).rest), ∃ i0. 1 = 2 ^ i0 + j

Rule argument

seq: ⊦ true ∈ bits ∧ false ∈ bits → sgn(bits + bits0) = sgn(bits) + bits0 subst: [bits0, bits] → [fillsgn(i→n(i), int2bits(j0).rest), uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest] rotate: F spec: bitopsaux inst: name: sgn-append-01

Additional information

Used simplifier rules: ⊦ i + j = j + i; Used terms: fillsgn(i→n(i), int2bits(j0).rest), uint2bits(2 ^ n→i(# int2bits(1 - j)) + j - 1).rest