[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 26 from proof multi-in-other (previous step)

# refs2 = i→n(countrefs(i1 ' + ints1)) * i→n(i2) + i→n(countrefs(i1 ' + ints1)), lastn(i→n(countrefs(i1 ' + ints1)), r1 ' + refs2) = r0 ' + refs1, posints(ints1), 0 ≤ i1, 0 < i0, i2 < i0, 0 ≤ i2, i→n(countrefs(i1 ' + ints1)) ≤ 1 + # refs2, ∀ st, ty, acc, sk, ints, i, r, refs0. # refs0 < # (r1 + refs2) → ( true → ( ¬ r ∈ refs0 ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (r -- sk ∈ addmultiarrays(refs0, i, acc, ty, ints, st) ↔ r -- sk ∈ st))) ⊦ r -- sk ∈ addmultiarrays (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2), i2, r0 ' + acc, ty, i0 ' + i1 ' + ints1, addmultiarrays(r0 ' + refs1, i1, [], ty, i1 ' + ints1, st)) ↔ r -- sk ∈ st, 0 = i0, (~1) = i2, r = r1, 0 ∈ (i1 ' + ints1) .butlast, r ∈ refs2

User applied rule apply induction

And obtained the following new goals

Proof step 11:
# refs2 = i→n(countrefs(i1 ' + ints1)) * i→n(i2) + i→n(countrefs(i1 ' + ints1)), lastn(i→n(countrefs(i1 ' + ints1)), r1 ' + refs2) = r0 ' + refs1, posints(ints1), 0 ≤ i1, 0 < i0, i2 < i0, 0 ≤ i2, i→n(countrefs(i1 ' + ints1)) ≤ 1 + # refs2, ∀ st, ty, acc, sk, ints, i, r, refs0. # refs0 < # (r1 + refs2) → ( true → ( ¬ r ∈ refs0 ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (r -- sk ∈ addmultiarrays(refs0, i, acc, ty, ints, st) ↔ r -- sk ∈ st))) ⊦ # (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2)) < # (r1 + refs2), r -- sk ∈ addmultiarrays (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2), i2, r0 ' + acc, ty, i0 ' + i1 ' + ints1, addmultiarrays(r0 ' + refs1, i1, [], ty, i1 ' + ints1, st)) ↔ r -- sk ∈ st, 0 = i0, (~1) = i2, r = r1, 0 ∈ (i1 ' + ints1) .butlast, r ∈ refs2
Proof step 25:
¬ r ∈ r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2) ∧ # (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2)) = i→n(countrefs(i2 ' + (i0 ' + i1 ' + ints1) .rest)) ∧ i0 ' + i1 ' + ints1 ≠ [] ∧ 0 ≤ i2 ∧ posints(i0 ' + i1 ' + ints1) ∧ ¬ 0 ∈ (i0 ' + i1 ' + ints1) .butlast ∧ i2 ≤ (i0 ' + i1 ' + ints1) .first → ( r -- sk ∈ addmultiarrays (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2), i2, r0 ' + acc, ty, i0 ' + i1 ' + ints1, addmultiarrays(r0 ' + refs1, i1, [], ty, i1 ' + ints1, st)) ↔ r -- sk ∈ addmultiarrays(r0 ' + refs1, i1, [], ty, i1 ' + ints1, st)), # refs2 = i→n(countrefs(i1 ' + ints1)) * i→n(i2) + i→n(countrefs(i1 ' + ints1)), lastn(i→n(countrefs(i1 ' + ints1)), r1 ' + refs2) = r0 ' + refs1, posints(ints1), 0 ≤ i1, 0 < i0, i2 < i0, 0 ≤ i2, i→n(countrefs(i1 ' + ints1)) ≤ 1 + # refs2, ∀ st, ty, acc, sk, ints, i, r, refs0. # refs0 < # (r1 + refs2) → ( true → ( ¬ r ∈ refs0 ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (r -- sk ∈ addmultiarrays(refs0, i, acc, ty, ints, st) ↔ r -- sk ∈ st))) ⊦ r -- sk ∈ addmultiarrays (r1 ' + firstn(i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2), i2, r0 ' + acc, ty, i0 ' + i1 ' + ints1, addmultiarrays(r0 ' + refs1, i1, [], ty, i1 ' + ints1, st)) ↔ r -- sk ∈ st, 0 = i0, (~1) = i2, r = r1, 0 ∈ (i1 ' + ints1) .butlast, r ∈ refs2

Rule argument

[substlist-arg: [st, ty, acc, sk, ints, i, r, refs0] → [addmultiarrays (r0 ' + refs1, i1, [], ty, i1 ' + ints1, st), ty, r0 ' + acc, sk, i0 ' + i1 ' + ints1, i2, r, r1 ' + firstn (i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2)] ]

Additional information

[[CONCRETESIMPRULES : ()], [EXTRATERMS : (addmultiarrays (r0 ' + refs1, i1, [], ty, i1 ' + ints1, st), ty, r0 ' + acc, sk, i0 ' + i1 ' + ints1, i2, r, r1 ' + firstn (i→n(countrefs(i1 ' + ints1)) * i→n(i2), refs2))]]