[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 27 from proof multi-refin (previous step)

# refs = i→n(countrefs(i ' + ints0)), rk ∈ st, posints(ints0), 0 < i0, i ≤ i0, 0 < i, ∀ ty, acc, ints, i, st, rk, refs0. # refs0 < # refs → ( true → ( rk ∈ st ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → rk ∈ addmultiarrays(refs0, i, acc, ty, ints, st))) ⊦ ints0 = [], 0 = i0, i = 0, 0 ∈ ints0 .butlast, rk ∈ addmultiarrays (firstn(# refs - i→n(countrefs(ints0)), refs), i - 1, lastn(i→n(countrefs(ints0)), refs) .first ' + acc, ty, i0 ' + ints0, addmultiarrays(lastn(i→n(countrefs(ints0)), refs), ints0 .first, [], ty, ints0, st))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 26:
ints0 = i1 + ints1, # refs = i→n(countrefs(i ' + ints0)), rk ∈ st, posints(ints0), 0 < i0, i ≤ i0, 0 < i, ∀ ty, acc, ints, i, st, rk, refs0. # refs0 < # refs → ( true → ( rk ∈ st ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → rk ∈ addmultiarrays(refs0, i, acc, ty, ints, st))) ⊦ ints0 = [], 0 = i0, i = 0, 0 ∈ ints0 .butlast, rk ∈ addmultiarrays (firstn(# refs - i→n(countrefs(ints0)), refs), i - 1, lastn(i→n(countrefs(ints0)), refs) .first ' + acc, ty, i0 ' + ints0, addmultiarrays(lastn(i→n(countrefs(ints0)), refs), i1, [], ty, ints0, st))

Rule argument

[speclemmaarg: ints ≠ [] ,i = ints .first ∧ ints0 = ints .rest ↔ ints = i + ints0 ,[ints, i, ints0] → [ints0, i1, ints1] ,T ,list-data ,intlista ,elim-list-c ]

Additional information

[[CONCRETESIMPRULES : ([CSIMPELIM : ints ≠ [] ⊦ i = ints .first ∧ ints0 = ints .rest ↔ ints = i + ints0])], [EXTRATERMS : (ints0, i1, ints1)]]