[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 94 from proof add-scale-neq (previous step)

(dec_i.int + dec_j.int * 10 ^ (dec_i.scale - dec_j.scale)) % 10 = 0, 0 < dec_i.scale, 1 < maxScale(dec_i.int + dec_j.int * 10 ^ (dec_i.scale - dec_j.scale)), 0 ≤ dec_j.scale, dec_i.scale < maxScale(dec_i.int + dec_j.int * 10 ^ (dec_i.scale - dec_j.scale)), dec_j.scale < dec_i.scale, 0 < maxScale(dec_i.int + dec_j.int * 10 ^ (dec_i.scale - dec_j.scale)) ⊦ dec_i.int + dec_j.int * 10 ^ (dec_i.scale - dec_j.scale) = 0, 0 = dec_i.scale, dec_i.scale = dec_j.scale

User applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: int-pot inst: name: pot-mod-add-zero seq: ⊦ 0 ≤ j ∧ 0 < j0 → ((i + i0 * j ^ j0) % j = 0 ↔ i % j = 0) subst: [j0, j, i0, i] → [dec_i.scale - dec_j.scale, 10, dec_j.int, dec_i.int] flags: rewrite

Additional information

Used simplifier rules: intvalue-mod-10: ⊦ dec.scale ≠ 0 → dec.int % 10 ≠ 0; from specification decimal%sub-ls-01: ⊦ i < j - i0 ↔ i + i0 < j; from specification int-abs%add-zero: ⊦ i + 0 = i; from specification int-basic2%add-a: ⊦ i + j + i0 = (i + j) + i0; from specification int-basic2%add-c: ⊦ i + j = j + i; from specification int-basic2 Used terms: dec_i.scale - dec_j.scale, 10, dec_j.int, dec_i.int