[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 addarrays-empty
⊦ ints = [] ∨ n→i(# refs) ≠ countrefs(ints) ∨ ¬ posints(ints) → addarrays(refs, ty, ints, i, st) = st
Type: An axiom
Validity: The proof is valid.
Features:
Comment:
Used by:
addarrays-at-other-01
,
addarrays-auto-22
,
addarrays-case
,
addarrays-fieldat
,
addarrays-fieldin
,
addarrays-length
,
addarrays-mode
,
addarrays-out
,
addarrays-refin
,
addarrays-refin-01
,
addarrays-subset
,
addarrays-type
,
endfinallymode
,
Used by units in proved state:
Proof exists?: No