[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 unchanged-pathex-append
⊦ unchanged(str, r, st, st1) ∧ path∃(str, r, r0, st) ∧ path∃(str, r0, r1, st) → path∃(str, r0, r1, st1)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
unchanged-pathex-unchanged
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 7
Proof steps: 17
Used lemmas:
unchanged-validrefs-unchNorec
,
unchNorec-validrefs-pathex
,
Used spec theorems:
cyclic
/
pathex-def
cyclic
/
validrefs-append-01
list-last
/references/
l-01
Used simplifier rules:
list-last
/references/
l-02
list
/references/
c-07
list
/references/
in-06
list
/references/
e
list
/references/
app-02-ant
list
/references/
in-17
list
/references/
in-append
list-last
/references/
lin-01
list
/references/
c-08
list
/references/
a
list
/references/
e-01
list
/references/
c
list-data
/references/
elim-list-c