[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 185 from proof int2bytes-rec-neg-05 (previous step)

1 + 8 * i→n(i) = # int2bits(j % 2 ^ (i * 8)), i→n(i) + 1 = # bits2bytes(int2bits(j % 2 ^ (i * 8))), 0 < i, j + 2 ^ (i * 8 - 1) < 0, j + 2 ^ (i * 8) ≤ 0, j + 2 ^ (i * 8) < i, j % 2 ^ (i * 8) < 0, 0 ≤ i, 8 * i→n(i) ≤ 7 ⊦ int2bits(j % 2 ^ (i * 8)).rest = [], j % 2 ^ (i * 8) = 0, bits2bytes(int2bits(j % 2 ^ (i * 8)).rest) = bits2bytes(int2bits(j % 2 ^ (i * 8))).rest

User applied rule cut formula

And obtained the following new goals

Proof step 186:
1 + 8 * i→n(i) = # int2bits(j % 2 ^ (i * 8)), i→n(i) + 1 = # bits2bytes(int2bits(j % 2 ^ (i * 8))), 0 < i, j + 2 ^ (i * 8 - 1) < 0, j + 2 ^ (i * 8) ≤ 0, j + 2 ^ (i * 8) < i, j % 2 ^ (i * 8) < 0, 0 ≤ i, 8 * i→n(i) ≤ 7 ⊦ i = 0, int2bits(j % 2 ^ (i * 8)).rest = [], j % 2 ^ (i * 8) = 0, bits2bytes(int2bits(j % 2 ^ (i * 8)).rest) = bits2bytes(int2bits(j % 2 ^ (i * 8))).rest

Rule argument

fma: i = 0

Additional information

Used simplifier rules: ⊦ i % 1 = 0;% ⊦ int2bits(0) = false ';% ⊦ # boolvar ' = 0 +1;% ⊦ boolvar '.rest = []; Used formulas: i = 0