[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-one
⊦ st[r -- fs '] = refval(r) ∧ is_obj(str, r, st) ∧ fs ' ∈ instfields(st[r -- _type] .type .class) ∧ st[r -- _type] .type ≤ fs .type → cyclic(str, r, 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: 5
Proof steps: 12
Used lemmas:
validrefs-one
,
validrefs-class
,
cyclic-def-simple
,
Used spec theorems:
Used simplifier rules:
addfuns
/
is_valid_ref-isobj
fieldspec
/
elim
javavalue
/
sel-09
javavalue
/
test-19
list
/references/
first
list
/references/
e
typefuns
/
ref
list
/references/
c-08
list
/references/
a
list
/references/
in-17
list-dup
/references/
c
list-dup
/references/
dups-cons