Not applicable.
-\section{Anticommit}
+\section{Dependency Removal}
-Given $L$ and $\pr$ as represented by $R^+, R^-$.
-Construct $C$ which has $\pr$ removed.
+Given $L$ which contains $\pr$ as represented by $R^+, R^-$.
+Construct $C$ which has $\pr$ removed by applying a single
+commit which is the anticommit of $\pr$.
Used for removing a branch dependency.
\gathbegin
C \hasparents \{ L \}
R^+ \in \pry \land R^- = \baseof{R^+}
}\]
\[ \eqn{ Into Base }{
- L \in \pn
+ L \in \pqn
}\]
\[ \eqn{ Unique Tip }{
\pendsof{L}{\pry} = \{ R^+ \}
\subsection{No Replay}
-By definition of $\merge$,
+By $\merge$,
$D \isin C \implies D \isin L \lor D \isin R^- \lor D = C$.
So, by Ordering of Ingredients,
Ingredients Prevent Replay applies. $\qed$
\subsubsection{For $D \neq C, D \not\le L$:}
-By No Replay $D \not\isin L$. Also $D \not\le R^-$ hence
+By No Replay for $L$, $D \not\isin L$.
+Also, by Ordering of Ingredients, $D \not\le R^-$ hence
$D \not\isin R^-$. Thus $D \not\isin C$. OK.
\subsubsection{For $D \neq C, D \le L, D \in \pry$:}
by Unique Tip, $D \le R^+ \equiv D \le L$.
So $D \isin R^+$.
-By Base Acyclic, $D \not\isin R^-$.
+By Base Acyclic for $R^-$, $D \not\isin R^-$.
Apply $\merge$: $D \not\isin C$. OK.
\subsection{Unique Base}
-Into Base means that $C \in \pn$, so Unique Base is not
+Into Base means that $C \in \pqn$, so Unique Base is not
applicable. $\qed$
\subsection{Tip Contents}
\subsection{Base Acyclic}
-By Base Acyclic for $L$, $D \isin L \implies D \not\in \py$.
-And by Into Base $C \not\in \py$.
+By Into Base and Base Acyclic for $L$, $D \isin L \implies D \not\in \pqy$.
+And by Into Base $C \not\in \pqy$.
Now from Desired Contents, above, $D \isin C
\implies D \isin L \lor D = C$, which thus
-$\implies D \not\in \py$. $\qed$.
+$\implies D \not\in \pqy$. $\qed$.
\subsection{Coherence and Patch Inclusion}