[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,

Theorem addarraymultlist_more_1

⊦ # ints > 1 ∧ ints .first = 1 → addarraymultlist(r, ty, st, refs, ints, ints0, i) = addarraymultlist (refs .first, ty, st[r -- (ints .first - 1) ', refval(refs .first)][r -- _type, typeval(mktype_from_dims(ty, i + n→i(# ints)))][r -- _length, intval(ints0 .first)], refs .rest, ints .rest, ints0 .rest, i)

Type: An axiom
Validity: The proof is valid.
Features:
Comment: add(r,ty,st,refs, [1, x], ints0, i), just the outer recursion
Used by: multg-at-ref, multi-mode,
Used by units in proved state:
Proof exists?: No