| j % 2 = 1, i % 2 = 1, 0 < j, 1 < j, i ≤ bits2int(bitsand(int2bits(i / 2), int2bits(j / 2))) * 2, 0 ≤ i, 1 < i, 0 < i, 0 < bits2int(bitsand(int2bits(i / 2), int2bits(j / 2))), ∀ i0, j. i→n(i0) < i→n(i) → i0 < bits2int(bitsand(int2bits(i0), int2bits(j))) ∧ 0 ≤ i0 → false ⊦ bitsand(int2bits(i / 2), int2bits(j / 2)).first |
j % 2 = 1, i % 2 = 1, 0 < j, 1 < j, i ≤ bits2int(bitsand(int2bits(i / 2), int2bits(j / 2))) * 2, 0 ≤ i, 1 < i, 0 < i, 0 < bits2int(bitsand(int2bits(i / 2), int2bits(j / 2))), ∀ i0, j. i→n(i0) < i→n(i) → i0 < bits2int(bitsand(int2bits(i0), int2bits(j))) ∧ 0 ≤ i0 → false ⊦ i / 2 < bits2int(bitsand(int2bits(i / 2), int2bits(j / 2))) ∧ 0 ≤ i / 2, bitsand(int2bits(i / 2), int2bits(j / 2)).first
Used simplifier rules: ⊦ i→n(i) < i→n(j) ↔ abs(i) < abs(j);%j ≠ 0 ⊦ abs(i / j) = abs(i) / abs(j);% ⊦ 1 < i → abs(i) = i;% ⊦ 0 < j ∧ 0 ≤ i → (i / (* j) < j0 ↔ i < j * j0);% ⊦ ¬ i < j ↔ j ≤ i;% ⊦ 0 < i → (i * j ≤ i ↔ j ≤ 1);% ⊦ i * j * j0 = (i * j) * j0;% ⊦ i * j = j * i; Used terms: i / 2, j / 2