From 4cb4b094de07de42b3a8690172301f4cefff6e72 Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Fri, 16 Mar 2012 21:59:10 +0000 Subject: [PATCH] merge fixes/clarifications - add missing \ --- merge.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/merge.tex b/merge.tex index e295d3f..a8dd9a7 100644 --- a/merge.tex +++ b/merge.tex @@ -81,7 +81,7 @@ and calculate $\pendsof{C}{\pn}$. So we will consider some putative ancestor $A \in \pn$ and see whether $A \le 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$. +But $C \in \py$ and $A \in \pn$ so $A \neq C$. Thus $A \le C \equiv A \le L \lor A \le R$. By Unique Base of L and Transitive Ancestors, -- 2.30.2