[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_one_0
⊦ # ints = 1 ∧ ints .first ≤ 0 → addarraymultlist(r, ty, st, refs, ints, ints0, i) = (st[r -- _type, typeval(mktype_from_dims(ty, n→i(# ints) + i))][r -- _length, intval(ints0 .first)])
Type: An axiom
Validity: The proof is valid.
Features:
Comment: add(r,ty,st,refs, [0], ints0, i) one array of length 0 - it's possible
Used by:
multg-at-ref
,
multi-mode
,
Used by units in proved state:
Proof exists?: No