chiark
/
gitweb
/
~ian
/
topbloke-formulae.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
4c0c56b
)
clarify proof of calculation of ends
author
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Mon, 26 Mar 2012 00:19:13 +0000
(
01:19
+0100)
committer
Ian Jackson
<ijackson@chiark.greenend.org.uk>
Mon, 26 Mar 2012 00:19:13 +0000
(
01:19
+0100)
lemmas.tex
patch
|
blob
|
history
diff --git
a/lemmas.tex
b/lemmas.tex
index 41ea1c815af7fa6e04a2237255e5b355860888ac..8509c895ec46e213c6db96ade1442d814189f2a2 100644
(file)
--- 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$.
}