\subsection{Conditions}
-\[ \eqn{ Merges Exhaustive }{
- L \in \py => \Bigl[ R \in \py \lor R \in \pn \Bigr]
-}\]
\[ \eqn{ Tip Merge }{
- L \in \py \land R \in \py \implies \Bigl[ \text{TBD} \Bigr]
-}\]
-\[ \eqn{ Base Merge }{
- L \in \py \land R \in \pn \implies \Bigl[ R \ge \baseof{L} \land M =
- \baseof{L} \Bigr]
+ L \in \py \implies
+ \begin{cases}
+ R \in \py : & \baseof{R} \ge \baseof{L}
+ \land [\baseof{L} = M \lor \baseof{L} = \baseof{M}] \\
+ R \in \pn : & R \ge \baseof{L}
+ \land M = \baseof{L} \\
+ \text{otherwise} : & \false
+ \end{cases}
}\]
+\subsection{No Replay}
+
+\subsubsection{For $D=C$:} $D \isin C, D \le C$, trivial.
+
+\subsubsection{For $D \isin L \land D \isin R$:}
+$D \isin C$. And $D \isin L
+
\end{document}