[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-one
⊦ path∃(str, r, r, st) ↔ r = jvmref ∨ r ≠ jvmref ∧ is_valid_ref(str, r, st)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
cyclic-put-nopathex
,
junkref-update-equiv
,
junkrefs-put-nopathex
,
junkrefs-put-nopathex-equiv
,
okarray-put-nopath
,
pathex-levelsubset-01
,
pathex-lookup-put-other
,
pathex-null-01
,
pathex-put-cyclic
,
pathex-put-last
,
pathex-put-nopathex
,
pathex-put-pathex-array-refval
,
pathex-putbyte-field
,
pathex-putbyteval-01
,
pathex-putshortfield
,
pathex-putstatfield
,
pathex-subset-equiv
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
validrefs-one
,
validrefs-null-01
,
validrefs-not
,
pathex-def
,
Used spec theorems:
Used simplifier rules:
addfuns
/
is_valid_ref-type
list-last
/references/
l
list
/references/
first
list
/references/
e
list
/references/
c
list
/references/
e-01
list
/references/
a
list-data
/references/
elim-list-c