[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
⊦ newref(r, st) → ¬ cyclic(str, r, addarray(r, ty, i, st))
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 14
Used lemmas:
validrefs-null-02
,
validrefs-array
,
validrefs-is-junk
,
cyclic-def-simple
,
Used spec theorems:
addfuns
/
is-valid-ref-stronger-def
Used simplifier rules:
list
/references/
in-01
int-abs
/
forward-le-05
list
/references/
in-empty
int-abs
/
forward-le-01
javatype
/
sel-01
javavalue
/
sel-09
valuefuns
/
initial-value
addarray
/
at-1dim
javavalue
/
sel-04
addarray
/
length-1dim
addarray
/
is_obj-addarray-01
int-abs
/
lels-04
int-abs
/
lels-01
addarray
/
is_array-addarray
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-1dim
storefuns
/
newref-01