From 23862a524934c97cc30445f0250c943df589c729 Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Sun, 18 Mar 2012 10:59:16 +0000
Subject: [PATCH] merge coherence complex - fix proof intro re haspatch
 nonexclusivity

---
 merge.tex | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/merge.tex b/merge.tex
index d9415bc..5dc99ee 100644
--- a/merge.tex
+++ b/merge.tex
@@ -157,8 +157,9 @@ One of the Merge Ends conditions applies.
 Recall that we are considering $D \in \py$.
 $D \isin Y \equiv D \le Y$.  $D \not\isin X$.
 We will show for each of
-various cases that $D \isin C \equiv M \nothaspatch \p \land D \le C$
-(which suffices by definition of $\haspatch$ and $\nothaspatch$).
+various cases that
+if $M \haspatch \p$, $D \not\isin C$,
+whereas if $M \nothaspatch \p$, $D \isin C \equiv \land D \le C$.
 
 Consider $D = C$:  Thus $C \in \py, L \in \py$.
 By Tip Own Contents, $\neg[ L \nothaspatch \p ]$ so $L \neq X$,
-- 
2.30.2