[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 pathex-def-simple
⊦ path∃(str, r, r0, st) ↔ (∃ refs. refs ≠ [] ∧ refs .first = r ∧ refs .last = r0 ∧ validrefs(str, refs, st[r -- _type] .type, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
pathex-array
,
pathex-class
,
pathex-def-nodups
,
pathex-junkref
,
pathex-levelsubset-01
,
pathex-noreftype
,
pathex-not-is-validref
,
pathex-not-is-validref-01
,
pathex-put-array-badindex
,
pathex-put-nopathex
,
pathex-put-pathex-array-refval
,
pathex-putbyte
,
validrefs-nopathex
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 15
Used lemmas:
validrefs-not
,
validrefs-null-02
,
validrefs-is-junk
,
validrefs-superclass
,
validrefs-sametype
,
pathex-def
,
Used spec theorems:
Used simplifier rules:
typefuns
/
ref
addfuns
/
is_valid_ref-type
list
/references/
app-02-ant
list
/references/
e
list
/references/
c-08
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c