[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-subset-equiv
⊦ ¬ junkref(str, r, st) ∧ st ⊆ st0 → (path∃(str, r, r0, st0) ↔ path∃(str, r, r0, 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: 7
Proof steps: 15
Used lemmas:
pathex-subset-02
,
validrefs-subset-equiv
,
pathex-one
,
pathex-def
,
Used spec theorems:
junkrefs
/
validref-runtimetype
Used simplifier rules:
list
/references/
c-08
list
/references/
e
list
/references/
app-02-ant
list-last
/references/
l-02
list
/references/
app
list-last
/references/
l
junkrefs
/
junkref-not-valid-01
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c