From cd2fc577b6871ee5f39e8114554c788919315805 Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Mon, 5 Mar 2012 16:55:36 +0000 Subject: [PATCH] wip merge --- article.tex | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/article.tex b/article.tex index 4e114f2..5619821 100644 --- a/article.tex +++ b/article.tex @@ -394,9 +394,9 @@ Need to consider only $C \in \py$, ie $L \in \py$, and calculate $\pendsof{C}{\pn}$. So we will consider some putative ancestor $A \in \pn$ and see whether $A \le C$. -$A \le C \equiv A \le L \lor A \le R \lor A = C$. +By Exact Ancestors for C, $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 $fixme this is not really the right thing A \le L \lor A \le R$. +Thus $A \le C \equiv A \le L \lor A \le R$. By Unique Base of L and Transitive Ancestors, $A \le L \equiv A \le \baseof{L}$. @@ -416,7 +416,7 @@ Thus $A \le C \equiv A \le \baseof{R}$. Ie, $\baseof{C} = UP TO HERE -By Tip Merge, $A \le $ +By Tip Merge condition on $A \le $ Let $S = \begin{cases} -- 2.30.2