[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 5 from proof int2int-lastn-negpos (previous step)

# bits = # int2bits(i) - m, int2bits(i) = bits + lastn(m, int2bits(i)), i < 0, m ≤ # int2bits(i) ⊦ bits2int(lastn(m, int2bits(i))) = i % 2 ^ n→i(m) + 2 ^ n→i(m), i % 2 ^ n→i(m) = 0, m = 0, lastn(m, int2bits(i)).first

User applied rule cut formula

And obtained the following new goals

Proof step 6:
# bits = # int2bits(i) - m, int2bits(i) = bits + lastn(m, int2bits(i)), i < 0, m ≤ # int2bits(i) ⊦ bits = [], bits2int(lastn(m, int2bits(i))) = i % 2 ^ n→i(m) + 2 ^ n→i(m), i % 2 ^ n→i(m) = 0, m = 0, lastn(m, int2bits(i)).first

Rule argument

fma: bits = []

Additional information

Used simplifier rules: int2bits-not-empty: ⊦ int2bits(j) ≠ [];%int2int-inj: ⊦ bits2int(int2bits(i)) = i;%int2bits-first-01: ⊦ j < 0 → int2bits(j).first;% ⊦ # [] = 0;% ⊦ m ≤ n → (n - m = 0 ↔ n = m);% ⊦ [] + bits = bits;% ⊦ (bits + bits0) + bits1 = bits + bits0 + bits1;% ⊦ # bits = 0 ↔ bits = [];% ⊦ m ≤ m; Used formulas: bits = []