[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 21 from proof int2bits-2pot-04 (previous step)

0 < i, 0 < 2 ^ i, j < 2 ^ i, j < 0, j + 1 < 2 ^ i, j < i, j * 2 ^ i < i, j + 1 < i ⊦ sgn(bitsinvert(uint2bits(~ j)) +1 + mklist(false, i→n(i))) = int2bits(j) + mklist(false, i→n(i)), j = 0, i = 0

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 22:
⊦ bits0 ≠ [] ∧ (¬ bits0.first) ∈ bits → sgn(bits + bits0) = sgn(bits) + bits0
Proof step 23:
¬(mklist(false, i→n(i)) ≠ [] ∧ (¬ mklist(false, i→n(i)).first) ∈ bitsinvert(uint2bits(~ j)) +1), 0 < i, 0 < 2 ^ i, j < 2 ^ i, j < 0, j + 1 < 2 ^ i, j < i, j * 2 ^ i < i, j + 1 < i ⊦ sgn(bitsinvert(uint2bits(~ j)) +1 + mklist(false, i→n(i))) = int2bits(j) + mklist(false, i→n(i)), j = 0, i = 0
Proof step 27:
mklist(false, i→n(i)) ≠ [] ∧ (¬ mklist(false, i→n(i)).first) ∈ bitsinvert(uint2bits(~ j)) +1, 0 < i, 0 < 2 ^ i, j < 2 ^ i, j < 0, j + 1 < 2 ^ i, j < i, j * 2 ^ i < i, j + 1 < i ⊦ sgn(bitsinvert(uint2bits(~ j)) +1) + mklist(false, i→n(i)) = int2bits(j) + mklist(false, i→n(i)), j = 0, i = 0

Rule argument

seq: ⊦ bits0 ≠ [] ∧ (¬ bits0.first) ∈ bits → sgn(bits + bits0) = sgn(bits) + bits0 subst: [bits0, bits] → [mklist(false, i→n(i)), bitsinvert(uint2bits(~ j)) +1] rotate: F spec: bitopsaux inst: name: sgn-append-06

Additional information

Used terms: mklist(false, i→n(i)), bitsinvert(uint2bits(~ j)) +1