From 2d0d58ba65870e8158a0e4124f09297807587d64 Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Fri, 2 Mar 2012 19:44:05 +0000
Subject: [PATCH] wip merge unique base

---
 article.tex | 45 +++++++++++++++++++++++++++++++++++++++++++--
 1 file changed, 43 insertions(+), 2 deletions(-)

diff --git a/article.tex b/article.tex
index 9e58393..f0bbf33 100644
--- a/article.tex
+++ b/article.tex
@@ -386,9 +386,50 @@ $\qed$
 \subsection{Unique Base}
 
 Need to consider only $C \in \py$, ie $L \in \py$,
-and calculate $\pendsof{C}{\pn}$.
+and calculate $\pendsof{C}{\pn}$.  So we will consider some
+putative ancestor $A \in \pn$ and see whether $A \le C$.
 
-%\subsubsection{For $R \in \py$:}
+$A \le C \equiv A \le L \lor A \le R \lor A = C$.
+But $C \in py$ and $A \in \pn$ so $A \neq C$.  
+Thus $A \le L \lor A \le R$.
+
+By Unique Base of L and Transitive Ancestors,
+$A \le L \equiv A \le \baseof{L}$.
+
+\subsubsection{For $R \in \py$:}
+
+By Unique Base of $R$ and Transitive Ancestors,
+$A \le R \equiv A \le \baseof{R}$.
+
+But by Tip Merge condition on $\baseof{R}$,
+$A \le \baseof{L} \implies A \le \baseof{R}$, so
+$A \le \baseof{R} \lor A \le \baseof{R} \equiv A \le \baseof{R}$.
+Thus $A \le C \equiv A \le \baseof{R}$.  Ie, $\baseof{C} =
+\baseof{R}$.
+
+UP TO HERE
+
+By Tip Merge, $A \le $
+
+Let $S =
+   \begin{cases} 
+     R \in \py : & \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 
+
+Let $A \in \pends{C}{\pn}$.  
+Then by Calculation Of Ends $A \in \pendsof{L,\pn} \lor A \in
+\pendsof{R,\pn}$.
+
+
+
+%$\pends{C,
+
+%%\subsubsection{For $R \in \py$:}
 %foo
 
 \end{document}
-- 
2.30.2