[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-def-pathex
⊦ disjoint(str, refs, st) ↔ ¬ (∃ r, r0, r1. r ∈ refs ∧ r0 ∈ refs ∧ r ≠ r0 ∧ r1 ≠ jvmref ∧ path∃(str, r, r1, st) ∧ path∃(str, r0, r1, st))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
disjoint-forward-array
,
disjoint-forward-field
,
disjoint-nopath-both
,
disjoint-nopathex-same
,
disjoint-pathex-forward
,
disjoint-subset
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 11
Proof steps: 26
Used lemmas:
disjoint-def
,
Used spec theorems:
cyclic
/
pathex-def-simple
Used simplifier rules:
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