[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-put-badclassfield
⊦ ¬ junkref(str, r, st) ∧ fs ' ≠ _type ∧ is_classtype(st[r0 -- _type] .type) ∧ ¬ fs ' ∈ instfields(st[r0 -- _type] .type .class) → (cyclic(str, r, st[r0 -- fs ', val]) ↔ 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: 13
Proof steps: 22
Used lemmas:
validrefs-put-badclassfield-01
,
validrefs-put-badclassfield
,
cyclic-def-shortest
,
Used spec theorems:
Used simplifier rules:
list
/references/
app-02-ant
list
/references/
e
list-last
/references/
butlast-def
list
/references/
c-08
list
/references/
in-06
list-dup
/references/
c-02
list-dup
/references/
dups-cons
list
/references/
in-17
list
/references/
in-append
list
/references/
a
list
/references/
e-01
list
/references/
c
list
/references/
in-empty
list-data
/references/
elim-list
javastore
/
at-other-16