From 87689e0c8044300edc92a995fb29d71f8a179cc1 Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Fri, 2 Mar 2012 19:06:09 +0000
Subject: [PATCH 1/1] lemma calculation of ends, no proof yet

---
 article.tex | 11 +++++++++++
 1 file changed, 11 insertions(+)

diff --git a/article.tex b/article.tex
index 642190f..07058aa 100644
--- a/article.tex
+++ b/article.tex
@@ -219,6 +219,17 @@ in which case we repeat for $A'$.  Since there are finitely many
 commits, this terminates with $A'' \in \pends()$, ie $A'' \le M$
 by the LHS.  And $A \le A''$.
 }
+\[ \eqn{Calculation Of Ends:}{
+  \bigforall_{C \hasparents \set A}
+    \pendsof{C}{\set P} =
+       \Bigl\{ E \Big|
+           \Bigl[ \Largeexists_{A \in \set A} 
+                       E \in \pendsof{A}{\set P} \Bigr] \land
+           \Bigl[ \Largenexists_{B \in \set A} 
+                       E \neq B \land E \le B \Bigr]
+       \Bigr\}
+}\]
+XXX proof TBD.
 
 \section{Commit annotation}
 
-- 
2.30.2