[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 addarrayinit-def
⊦ addarray(r, ty, vals, st) = addarray(r, vals, 0, st[r -- _type, typeval(mkarraytype(ty))][r -- _length, intval(n→i(# vals))])
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
add-at-gr
,
add-at-neg
,
add-at-ok
,
add-in
,
add-in-fskey
,
add-isobj
,
add-lastrec
,
add-refs
,
addarray-both-subset
,
addarray-mklist-05
,
addarray-mode
,
addbar-refval-01
,
get-add-01
,
get-add-02
,
in-1init
,
in-1init-02
,
in-1init-04
,
in-add
,
in-init-01
,
in-init-06
,
in-init-09
,
init-1init-03
,
init-1init-04
,
init-1init-05
,
length-1init-01
,
length-init
,
lookup-1init
,
lookup-init
,
mode-1init-01
,
newref-1init-01
,
putByteArray-vals-addarray
,
putByteArray-vals-addarray-01
,
putarray-add-butlast
,
putarray-add-same-01
,
shift-1init
,
switch-array
,
switch-class
,
switch-obj
,
type-1init
,
Used by units in proved state:
Proof exists?: No