rename Tip Self Contents -> Tip Own Contents

[topbloke-formulae.git] / merge.tex

diff --git a/merge.tex b/merge.tex
index 6786dd096b61322624cbcb0826bbaa02d27ce195..2403a49f85ad40bb07e0d502e2057b3fad0175c6 100644 (file)
--- a/merge.tex
+++ b/merge.tex
@@ -117,7 +117,7 @@ This involves considering $D \in \py$.
 
 \subsubsection{For $L \nothaspatch \p, R \nothaspatch \p$:}
 $D \not\isin L \land D \not\isin R$.  $C \not\in \py$ (otherwise $L
-\in \py$ ie $\neg[ L \nothaspatch \p ]$ by Tip Self Contents for $L$).
+\in \py$ ie $\neg[ L \nothaspatch \p ]$ by Tip Own Contents for $L$).
 So $D \neq C$.
 Applying $\merge$ gives $D \not\isin C$ i.e. $C \nothaspatch \p$.
 
@@ -162,7 +162,7 @@ various cases that $D \isin C \equiv M \nothaspatch \p \land D \le C$
 (which suffices by definition of $\haspatch$ and $\nothaspatch$).
 
 Consider $D = C$:  Thus $C \in \py, L \in \py$.
-By Tip Self Contents, $\neg[ L \nothaspatch \p ]$ so $L \neq X$,
+By Tip Own Contents, $\neg[ L \nothaspatch \p ]$ so $L \neq X$,
 therefore we must have $L=Y$, $R=X$.
 By Tip Merge $M = \baseof{L}$ so $M \in \pn$ so
 by Base Acyclic $M \nothaspatch \p$.  By $\merge$, $D \isin C$,