[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 59 from proof push-corr (previous step)

(i→n(i0) + i→n(i1)) % # ar = (i→n(i0) + n) % # ar, 0 < i1, n < i→n(i1), 0 ≤ i0 + i1, inv(mk(ar[(i→n(i0) + n) % # ar, a], n→i(# ar), i0, i1 + 1)), i1 < n→i(# ar), inv(mk(ar, n→i(# ar), i0, i1)), i0 < n→i(# ar), i1 ≤ n→i(# ar), 0 ≤ i0, 0 ≤ (i0 + i1) % n→i(# ar) ⊦ # ar = 0, i1 = 0, # ar = 1, ar[(i→n(i0) + n) % # ar] = a

User applied rule insert rewrite lemma

And obtained the following new goals

Proof step 14:
⊦ m < n → m % n = m
Proof step 55:
¬ i→n(i0) + i→n(i1) < # ar, (i→n(i0) + i→n(i1)) % # ar = (i→n(i0) + n) % # ar, 0 < i1, n < i→n(i1), 0 ≤ i0 + i1, inv(mk(ar[(i→n(i0) + n) % # ar, a], n→i(# ar), i0, i1 + 1)), i1 < n→i(# ar), inv(mk(ar, n→i(# ar), i0, i1)), i0 < n→i(# ar), i1 ≤ n→i(# ar), 0 ≤ i0, 0 ≤ (i0 + i1) % n→i(# ar) ⊦ # ar = 0, i1 = 0, # ar = 1, ar[(i→n(i0) + n) % # ar] = a
Proof step 58:
i→n(i0) + i→n(i1) < # ar, i→n(i0) + i→n(i1) = (i→n(i0) + n) % # ar, 0 < i1, n < i→n(i1), 0 ≤ i0 + i1, inv(mk(ar[(i→n(i0) + n) % # ar, a], n→i(# ar), i0, i1 + 1)), i1 < n→i(# ar), inv(mk(ar, n→i(# ar), i0, i1)), i0 < n→i(# ar), i1 ≤ n→i(# ar), 0 ≤ i0, 0 ≤ (i0 + i1) % n→i(# ar) ⊦ # ar = 0, i1 = 0, # ar = 1, ar[(i→n(i0) + n) % # ar] = a

Rule argument

[x0lemmaarg: spec-name: nat-div instance-name: lemma-name: mod-eq antecedent: succedent: m < n → m % n = m substlist: [n, m] → [# ar, i→n(i0) + i→n(i1)] add preconditions?: F is rewrite lemma?: T current spec?: F rotate lemma?: F replace all?: T paths: ((0, 0, 0, 1, 0)) dummy: () ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (# ar, i→n(i0) + i→n(i1))]]