[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-addobj-other-01
⊦ ¬ junkref(str, r, st) ∧ newref(r0, st) ∧ r ≠ r0 → (cyclic(str, r, addobj(r0, class, fis, st)) ↔ 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: 8
Proof steps: 15
Used lemmas:
validrefs-newref
,
validrefs-addobj-notin
,
cyclic-def-simple
,
cyclic-addobj-other
,
Used spec theorems:
Used simplifier rules:
list
/references/
in-01
list
/references/
c-08
list-dup
/references/
dups-cons
addfuns
/
add-ref
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
storefuns
/
newref-01