| # (i0 ' + ints0) = 1, # refs = i→n(countrefs(i ' + ints0)), i ≤ i0, 0 ≤ i, posints(ints0), 0 ≤ i0, ∀ st, ty, acc, r, ints, i, fs, refs0. # refs0 < # refs → ( true → ( fs ' ≠ _type ∧ fs ' ≠ _length ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (r -- fs ' ∈ addmultiarrays(refs0, i, acc, ty, ints, st) ↔ r -- fs ' ∈ st))) ⊦ fs ' = _length, fs ' = _type, r -- fs ' ∈ addarray(refs .first, ty, (i0 ' + ints0) .first, st) ↔ r -- fs ' ∈ st, 0 ∈ (i0 ' + ints0) .butlast |
⊦ countrefs(i ') = 1
# refs = 1, r ∈ addarray(refs .first, ty, i0, st), r -- fs ' ∈ addarray(refs .first, ty, i0, st), 0 ≤ i0, 0 ≤ i, i ≤ i0, ∀ st, ty, acc, r, ints, i, fs, refs0. # refs0 < 1 → ( true → ( fs ' ≠ _type ∧ fs ' ≠ _length ∧ # refs0 = i→n(countrefs(i ' + ints .rest)) ∧ ints ≠ [] ∧ 0 ≤ i ∧ posints(ints) ∧ ¬ 0 ∈ ints .butlast ∧ i ≤ ints .first → (r -- fs ' ∈ addmultiarrays(refs0, i, acc, ty, ints, st) ↔ r -- fs ' ∈ st))) ⊦ fs ' = _type, fs ' = _length, r -- fs ' ∈ st
[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ ¬ i ∈ []], [CSIMPSEQ : ⊦ i ' .butlast = []], [CSIMPSEQ : ⊦ posints([])], [CSIMPSEQ : ⊦ ints + [] = ints], [CSIMPFORWARD : ⊦ r -- sk ∈ st → r ∈ st], [CSIMPSEQ : ⊦ rk ∈ st → rk ∈ addarray(r, ty, i, st)], [CSIMPSEQ : ⊦ (i ' + ints) .first = i], [CSIMPSEQ : ⊦ m + n = n + m], [CSIMPSEQ : ⊦ (m + n0) + n1 = m + n0 + n1], [CSIMPSEQ : ⊦ # ints = 0 ↔ ints = []], [CSIMPSEQ : ⊦ 1 = m + 1 ↔ m = 0], [CSIMPSEQ : ⊦ (ints + ints0) + ints1 = ints + ints0 + ints1], [CSIMPSEQ : ⊦ # i ' = 0 +1], [CSIMPSEQ : ⊦ # (ints + ints0) = # ints + # ints0])]]