[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 precise-disj
precise(P0), precise(P1) ⊦ ((P0 * P1 * true))(H0 ∪ H2) ∧ H0 ∪ H2 = H1 ∪ H3 ∧ H0 ⊥ H2 ∧ H1 ⊥ H3 ∧ P0(H0) ∧ P1(H1) → H0 ⊥ H1
Type: A user defined theorem
Validity: The proof is valid.
Features: forward, localforward,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 12
Proof steps: 21
Used lemmas:
precise
,
trueH
,
precise-same
,
true-elim
,
sep-com
,
sep-ass
,
sep
,
Used spec theorems:
heap
/
uni-com
heap
/
uni-ass
Used simplifier rules:
heap
/
disj-distr-uni
heap
/
disj-com-rw