By Unique Base of L and Transitive Ancestors,
$A \le L \equiv A \le \baseof{L}$.
-\subsubsection{For $R \in \py$:}
+\subsubsection{For $R \in FIXME py$:}
By Unique Base of $R$ and Transitive Ancestors,
$A \le R \equiv A \le \baseof{R}$.
R \in \pn : & R
\end{cases}$.
Then by Tip Merge $S \ge \baseof{L}$, and $R \ge S$ so $C \ge S$.
-
+
Consider some $A \in \pn$. If $A \le S$ then $A \le C$.
If $A \not\le S$ then
%$\pends{C,
%%\subsubsection{For $R \in \py$:}
-%foo
\end{document}