[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 cyclic-addarray-this-01
⊦ newref(r, st) ∧ (∀ r. refval(r) ∈ vals → ¬ junkref(str, r, st) ∧ ¬ cyclic(str, r, st)) → ¬ cyclic(str, r, addarray(r, ty, vals, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 15
Proof steps: 34
Used lemmas:
validrefs-sametype
,
validrefs-superset-junkref
,
validrefs-addarray
,
validrefs-array
,
validrefs-is-junk
,
cyclic-def-simple
,
Used spec theorems:
list-del
/javavalues/
get-in
intnat
/
num-i2n-le-02
Used simplifier rules:
int-abs
/
lels-04
nat
/
lels
list-dup
/references/
dups-cons
list
/references/
c-08
addarray
/
addarray-subset
list
/references/
in-01
junkrefs
/
junkref-newref
javavalue
/
test-19
javavalue
/
elim-13
list
/references/
in-17
list
/references/
in-append
list-data
/javavalues/
l
nat-basic1
/
z
intnat
/
num-n2i-ls-02
int-abs
/
forward-le-01
int-abs
/
forward-le-05
list
/references/
in-empty
javatype
/
sel-01
addarray
/
add-at-ok
javavalue
/
sel-04
addarray
/
length-1init-01
addfuns
/
is_valid_ref-isarray
addfuns
/
is_valid_ref-01
addarray
/
is_obj-addarray-02
typefuns
/
ref
typefuns
/
subarray1
list-dup
/references/
rec
list
/references/
a
list
/references/
e-01
list
/references/
c
list-dup
/references/
e-01
list-data
/references/
elim-list-c
javavalue
/
sel-11
addarray
/
type-1init
storefuns
/
newref-01