[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 129 from proof uint2bits-restsgn (previous step)

0 ≤ n→i(# bits), 0 ≤ i, 2 ^ i0 = i2 + 1, i + 1 = i0 + n→i(# bits), ~1 ≤ i2, 0 ≤ i, 2 ^ (n→i(# bits) + 1) * i2 + 1 < 4 * 2 ^ i, 0 ≤ 2 ^ i, 0 < i, 2 ^ i ≤ 2 ^ (n→i(# bits) + 1) * i2, 2 ^ n→i(# bits) * i2 < 2 ^ i, 1 < 2 ^ i, 0 < 2 ^ i, 0 < 2 ^ n→i(# bits), n→i(# bits) ≤ i + 1, 2 ^ n→i(# bits) * i2 < 2 ^ (i + 1), 0 < i2, ∀ j0, i1. i→n(j0) < i→n(2 ^ (n→i(# bits) + 1) * i2 + 1) → 0 < i1 ∧ 0 ≤ j0 ∧ 2 ^ i1 < j0 ∧ j0 < 2 * 2 ^ i1 → sgn(uint2bits(2 ^ (i1 + 2) - j0).rest) = uint2bits(2 ^ (i1 + 2) - j0).rest ⊦ sgn(bits + true ') = bits + true ', 4 * 2 ^ i = 2 * (2 ^ n→i(# bits) * i2 + 1), false ∈ bits

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 130:
⊦ i * j = j * i
Proof step 131:
0 ≤ n→i(# bits), 0 ≤ i, 2 ^ i0 = i2 + 1, i + 1 = i0 + n→i(# bits), ~1 ≤ i2, 0 ≤ i, 2 ^ (n→i(# bits) + 1) * i2 + 1 < 4 * 2 ^ i, 0 ≤ 2 ^ i, 0 < i, 2 ^ i ≤ 2 ^ (n→i(# bits) + 1) * i2, i2 * 2 ^ n→i(# bits) < 2 ^ i, 1 < 2 ^ i, 0 < 2 ^ i, 0 < 2 ^ n→i(# bits), n→i(# bits) ≤ i + 1, i2 * 2 ^ n→i(# bits) < 2 ^ (i + 1), 0 < i2, ∀ j0, i1. i→n(j0) < i→n(2 ^ (n→i(# bits) + 1) * i2 + 1) → 0 < i1 ∧ 0 ≤ j0 ∧ 2 ^ i1 < j0 ∧ j0 < 2 * 2 ^ i1 → sgn(uint2bits(2 ^ (i1 + 2) - j0).rest) = uint2bits(2 ^ (i1 + 2) - j0).rest ⊦ sgn(bits + true ') = bits + true ', 4 * 2 ^ i = 2 * (i2 * 2 ^ n→i(# bits) + 1), false ∈ bits

Rule argument

seq: ⊦ i * j = j * i subst: [j, i] → [i2, 2 ^ n→i(# bits)] rotate: F spec: int-mult inst: name: commutativity

Additional information

Used terms: i2, 2 ^ n→i(# bits)