From 3da86b6d60fbd0edfa34366c2c57a5481790883c Mon Sep 17 00:00:00 2001
From: Ian Jackson <ijackson@chiark.greenend.org.uk>
Date: Mon, 12 Mar 2012 15:17:46 +0000
Subject: [PATCH] assert that exact ancestors is trivial

---
 article.tex | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/article.tex b/article.tex
index 1dd625f..a57bbec 100644
--- a/article.tex
+++ b/article.tex
@@ -275,7 +275,7 @@ $ \bigforall_{C \in \py}\bigforall_{D \in \py}
     ( \mathop{\hbox{\huge{$\vee$}}}_{R \in \set R} D \le R )
     \lor D = C
 }\]
-xxx proof tbd
+\proof{ ~ Trivial.}
 
 \[ \eqn{Transitive Ancestors:}{
   \left[ \bigforall_{ E \in \pendsof{C}{\set P} } E \le M \right] \equiv
-- 
2.30.2