rename Tip Self Contents -> Tip Own Contents

diff --git a/anticommit.tex b/anticommit.tex
index 47e0a9b395a2893ad53ebf57dbab39b47fec064b..90304e08e12857df301487c46ca34be34989cd0c 100644 (file)
--- a/anticommit.tex
+++ b/anticommit.tex
@@ -61,7 +61,7 @@ $D \not\isin R^-$.  Thus $D \not\isin C$.  OK.
 
 By Currently Included, $D \isin L$.
 
 
 By Currently Included, $D \isin L$.
 

-By Tip Self Contents for $R^+$, $D \isin R^+ \equiv D \le R^+$, but by
+By Tip Own Contents for $R^+$, $D \isin R^+ \equiv D \le R^+$, but by

 by Unique Tip, $D \le R^+ \equiv D \le L$.
 So $D \isin R^+$.
 
 by Unique Tip, $D \le R^+ \equiv D \le L$.
 So $D \isin R^+$.
 

diff --git a/lemmas.tex b/lemmas.tex
index 044e937f34cf49f06f3c34d13276e4f7264ad287..44dd26039c6e7a5400102c6d9d26dead824d2989 100644 (file)
--- a/lemmas.tex
+++ b/lemmas.tex
@@ -53,7 +53,7 @@ So by Base Acyclic $D \isin B \implies D \notin \py$.
   \end{cases}
 }\]
 
   \end{cases}
 }\]
 

-\subsection{Tip Self Contents}
+\subsection{Tip Own Contents}

 Given Base Acyclic for $C$,
 $$
   \bigforall_{C \in \py} C \haspatch \p \land \neg[ C \nothaspatch \p ]
 Given Base Acyclic for $C$,
 $$
   \bigforall_{C \in \py} C \haspatch \p \land \neg[ C \nothaspatch \p ]

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
 
 \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$.
 
 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$.
 (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$,
 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$,