[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 unchNorec-validrefs-pathex
⊦ validrefs(str, refs, ty, st) ∧ r = refs .first ∧ r0 ∈ refs ∧ (∀ r. r ∈ refs → unchangedNorec(r, st, st0)) ∧ refs ≠ [] → path∃(str, r, r0, st0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
unchanged-pathex-append
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 29
Used lemmas:
unchNorec-validrefs
,
unchNorec-isvalidref
,
Used spec theorems:
list
/references/
In
cyclic
/
pathex-def
cyclic
/
validrefs-prefix
cyclic
/
validrefs-superclass
cyclic
/
validrefs-is-junk
Used simplifier rules:
typefuns
/
subbasic2
addfuns
/
is_valid_ref-no-arraytype
addfuns
/
is_obj-classtype
cyclic
/
validrefs-null-02
typefuns
/
subtype-object-01
list-last
/references/
last-01
list
/references/
c-08
list
/references/
e
list
/references/
app-02-ant
cyclic
/
pathex-one
list
/references/
in-06
list
/references/
in-17
list
/references/
in-append
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c