<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" media="screen" href="/~d/styles/rss2full.xsl"?><?xml-stylesheet type="text/css" media="screen" href="http://feeds.feedburner.com/~d/styles/itemcontent.css"?><rss xmlns:feedburner="http://rssnamespace.org/feedburner/ext/1.0" version="2.0">
<channel>
  <title>Metamath Recent Proofs</title>
  <link>http://us2.metamath.org:8888/mpeuni/mmrecent.html</link>
  <description>Recent proofs for Metamath proof system</description>
  <language>en</language>
<atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="self" href="http://feeds.feedburner.com/MetamathRecentProofs" type="application/rss+xml" /><atom10:link xmlns:atom10="http://www.w3.org/2005/Atom" rel="hub" href="http://pubsubhubbub.appspot.com" /><item>
<title>11262 : ancomd Commutation of conjuncts in consequent. ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/DDoe4biEJsw/ancomd.html</link>
<pubDate>13-Nov-2009</pubDate><description><![CDATA[ Commutation of conjuncts in consequent.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&phi;</I> &rarr; (<I>&psi;</I> &#8896; <I>&chi;</I>))&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&phi;</I>  &rarr; (<I>&chi;</I> &#8896; <I>&psi;</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/ancomd.html</feedburner:origLink></item>

<item>
<title>11530 : flimfnfcls A filter converges to a point iff every ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/-u5FOGGxo6s/flimfnfcls.html</link>
<pubDate>12-Nov-2009</pubDate><description><![CDATA[ A filter converges to a point iff every finer filter clusters there.     Along with <A HREF="fclsfnflim.html">fclsfnflim</A>&nbsp;11529, this theorem illustrates the duality between     convergence and clustering.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &rarr; (<I>A</I> &isin; ((fLim1  &lsquo;<I>J</I>) &lsquo;<I>F</I>) &harr; &forall;<I>g</I> &isin; Fil ((<I>X</I> =  &cup;<I>g</I> &#8896; <I>F</I> &#8838; <I>g</I>) &rarr;  <I>A</I> &isin;  ((fClus &lsquo;<I>J</I>) &lsquo;<I>g</I>)))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/flimfnfcls.html</feedburner:origLink></item>

<item>
<title>11529 : fclsfnflim A filter clusters at a point iff a finer... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/w0Ry-4hWSJc/fclsfnflim.html</link>
<pubDate>12-Nov-2009</pubDate><description><![CDATA[ A filter clusters at a point iff a finer filter converges to it.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &rarr; (<I>A</I> &isin; ((fClus  &lsquo;<I>J</I>) &lsquo;<I>F</I>) &harr; &exist;<I>g</I> &isin; Fil (<I>X</I> =  &cup;<I>g</I> &#8896; <I>F</I> &#8838; <I>g</I> &#8896; <I>A</I> &isin; ((fLim1 &lsquo;<I>J</I>) &lsquo;<I>g</I>)))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fclsfnflim.html</feedburner:origLink></item>

<item>
<title>11528 : flimfcls A limit point is a cluster point.  ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/-qvWY0H8664/flimfcls.html</link>
<pubDate>12-Nov-2009</pubDate><description><![CDATA[ A limit point is a cluster point.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &rarr; ((fLim1 &lsquo;<I>J</I>) &lsquo;<I>F</I>)  &#8838; ((fClus &lsquo;<I>J</I>) &lsquo;<I>F</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/flimfcls.html</feedburner:origLink></item>

<item>
<title>11527 : fcluscf Characterization of fineness of topologi... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/NXSxJeDdOis/fcluscf.html</link>
<pubDate>12-Nov-2009</pubDate><description><![CDATA[ Characterization of fineness of topologies in terms of cluster points. <P>  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>K</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>K</I> &isin; Top  &#8896; <I>X</I> =  <I>Y</I>) &rarr; (<I>J</I> &#8838; <I>K</I> &harr; &forall;<I>f</I> &isin; Fil (<I>X</I> =  &cup;<I>f</I> &rarr;  ((fClus &lsquo;<I>K</I>) &lsquo;<I>f</I>) &#8838; ((fClus  &lsquo;<I>J</I>) &lsquo;<I>f</I>)))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fcluscf.html</feedburner:origLink></item>

<item>
<title>11356 : supfil The supersets of a nonempty set which ar... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/Q9ceVO74Y04/supfil.html</link>
<pubDate>12-Nov-2009</pubDate><description><![CDATA[ The supersets of a nonempty set which are also subsets of a given base set   form a filter.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>A</I> &isin; <I>C</I> &#8896; <I>B</I> &#8838; <I>A</I> &#8896; <I>B</I> &ne; &empty;) &rarr;  ({<I>x</I>&#8739;(<I>x</I> &#8838; <I>A</I> &#8896; <I>B</I> &#8838; <I>x</I>)} &isin; Fil &#8896;  <I>A</I> = &cup;{<I>x</I>&#8739;(<I>x</I> &#8838; <I>A</I> &#8896; <I>B</I> &#8838; <I>x</I>)})) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/supfil.html</feedburner:origLink></item>

<item>
<title>11526 : fclusss A finer filter has fewer cluster points.... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/-w8D2xUOuEA/fclusss.html</link>
<pubDate>11-Nov-2009</pubDate><description><![CDATA[ A finer filter has fewer cluster points.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Z</I> = &cup;<I>G</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>G</I>  &isin; Fil) &#8896;  <I>X</I> = <I>Y</I>  &#8896; <I>X</I> =  <I>Z</I>) &#8896;  <I>F</I> &#8838;  <I>G</I>) &rarr; ((fClus &lsquo;<I>J</I>) &lsquo;<I>G</I>)  &#8838; ((fClus &lsquo;<I>J</I>) &lsquo;<I>F</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fclusss.html</feedburner:origLink></item>

<item>
<title>11525 : fclusneii A neighborhood of a cluster point of a f... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/PQP0SmM3e0g/fclusneii.html</link>
<pubDate>11-Nov-2009</pubDate><description><![CDATA[ A neighborhood of a cluster point of a filter intersects any element of     that filter.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &#8896;  <I>A</I> &isin;  ((fClus &lsquo;<I>J</I>) &lsquo;<I>F</I>) &#8896; <I>N</I> &isin; ((nei  &lsquo;<I>J</I>) &lsquo;{<I>A</I>})) &#8896; <I>S</I> &isin; <I>F</I>) &rarr; (<I>N</I>  &cap; <I>S</I>) &ne; &empty;) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fclusneii.html</feedburner:origLink></item>

<item>
<title>11524 : fclselbas A cluster point is in the base set.  ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/SR0SVFReyfI/fclselbas.html</link>
<pubDate>11-Nov-2009</pubDate><description><![CDATA[ A cluster point is in the base set.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; (((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &#8896;  <I>A</I> &isin;  ((fClus &lsquo;<I>J</I>) &lsquo;<I>F</I>)) &rarr; <I>A</I>  &isin; <I>X</I>) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fclselbas.html</feedburner:origLink></item>

<item>
<title>11523 : fclusnei Cluster points in terms of neighborhoods... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/4jvwr2ZGwBY/fclusnei.html</link>
<pubDate>11-Nov-2009</pubDate><description><![CDATA[ Cluster points in terms of neighborhoods.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>Y</I> = &cup;<I>F</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>F</I> &isin; Fil  &#8896; <I>X</I> =  <I>Y</I>) &rarr; (<I>A</I> &isin; ((fClus  &lsquo;<I>J</I>) &lsquo;<I>F</I>) &harr; (<I>A</I>  &isin; <I>X</I>  &#8896; &forall;<I>n</I> &isin; ((nei &lsquo;<I>J</I>) &lsquo;{<I>A</I>})&forall;<I>s</I> &isin; <I>F</I> (<I>n</I> &cap;  <I>s</I>) &ne; &empty;)))]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/fclusnei.html</feedburner:origLink></item>

</channel>
</rss>
