[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 disjoint-pathex-forward-both
⊦ disjoint(str, r ' + r0 ', st) ∧ path∃(str, r, r1, st) ∧ path∃(str, r0, r2, st) ∧ r ≠ r0 → disjoint(str, r1 ' + r2 ', st)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
disjoint-nopath-both
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
disjoint-nopathex-same
,
disjoint-symmetric
,
disjoint-pathex-forward
,
Used spec theorems:
Used simplifier rules:
cyclic
/
pathex-null
cyclic
/
pathex-null-01