From 3a8cce8e2c30335e973bcaa8b98a7d8238bdaacb Mon Sep 17 00:00:00 2001 From: Ian Jackson Date: Mon, 26 Mar 2012 01:19:13 +0100 Subject: [PATCH] clarify proof of calculation of ends --- lemmas.tex | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/lemmas.tex b/lemmas.tex index 41ea1c8..8509c89 100644 --- a/lemmas.tex +++ b/lemmas.tex @@ -121,7 +121,7 @@ So $\pendsof{C}{\set P} \subset \bigcup_{E \in \set E} \pendsof{E}{\set P}$. Consider some $E \in \pendsof{A}{\set P}$. If $\exists_{B,F}$ as specified, then either $F$ is going to be in our result and disqualifies $E$, or there is some other $F'$ (or, eventually, -an $F''$) which disqualifies $F$. +an $F''$) which disqualifies $F$ and $E$. Otherwise, $E$ meets all the conditions for $\pends$. } -- 2.30.2