[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 50 from proof bxor-flip-one-bit (previous step)

# bits = i→n(j), int2bits(i) = bits0 + bits, 0 ≤ j, 0 ≤ i, 2 ^ j * 2 < i, bits ≠ [] → bitsxor(bits0 + bits, (false ' + true ') + mklist(false, i→n(j))) = bitsxor(bits0, false ' + true ') + bitsxor(bits, mklist(false, i→n(j))) ⊦ bits0 = [], (int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1] ↔ ¬ bits0.last) ∧ int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1, bits0.last] = bits0 + bits

User applied rule cut formula

And obtained the following new goals

Proof step 51:
bits = [], # bits = i→n(j), int2bits(i) = bits0 + bits, 0 ≤ j, 0 ≤ i, 2 ^ j * 2 < i, bits ≠ [] → bitsxor(bits0 + bits, (false ' + true ') + mklist(false, i→n(j))) = bitsxor(bits0, false ' + true ') + bitsxor(bits, mklist(false, i→n(j))) ⊦ bits0 = [], (int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1] ↔ ¬ bits0.last) ∧ int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1, bits0.last] = bits0 + bits
Proof step 101:
# bits = i→n(j), int2bits(i) = bits0 + bits, 0 ≤ j, 0 ≤ i, 2 ^ j * 2 < i, bits ≠ [] → bitsxor(bits0 + bits, (false ' + true ') + mklist(false, i→n(j))) = bitsxor(bits0, false ' + true ') + bitsxor(bits, mklist(false, i→n(j))) ⊦ bits = [], bits0 = [], (int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1] ↔ ¬ bits0.last) ∧ int2bits(bits2int(bitsxor(bits0 + bits, false ' + true ' + mklist(false, i→n(j)))))[# bits0 - 1, bits0.last] = bits0 + bits

Rule argument

fma: bits = []

Additional information

Used formulas: bits = []