[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 22 from proof mult-dist (previous step)
| ⊦ (i * (i1 * 10 ^ abs(i4) + i3 * 10 ^ abs(i2))) * 10 ^ abs(i0) = i * i1 * 10 ^ (abs(i0) + abs(i4)) + i * i3 * 10 ^ (abs(i0) + abs(i2)) |
User applied rule insert rewrite lemma
And obtained the following new goals
- Proof step 23:
⊦ 0 ≤ j ∧ 0 ≤ j0 → i ^ (j + j0) = i ^ j * i ^ j0
- Proof step 24:
0 ≤ abs(i0) ∧ 0 ≤ abs(i2)
⊦ (i * (i1 * 10 ^ abs(i4) + i3 * 10 ^ abs(i2))) * 10 ^ abs(i0) = i * i1 * 10 ^ (abs(i0) + abs(i4)) + i * i3 * 10 ^ abs(i0) * 10 ^ abs(i2)
Rule argument
spec: int-pot
inst:
name: pot-dist-pos
seq: ⊦ 0 ≤ j ∧ 0 ≤ j0 → i ^ (j + j0) = i ^ j * i ^ j0
subst: [j0, j, i] → [abs(i2), abs(i0), 10]
flags: rewriteAdditional information
Used simplifier rules:
abs-03: ⊦ 0 ≤ abs(i); from specification int-abs
Used terms: abs(i2), abs(i0), 10