<?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" /><item>
<title>8920 : lanfwcl Closure of the infimum (meet) of two lat... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/19EyHXIDuHs/lanfwcl.html</link>
<pubDate>15-Jul-2009</pubDate><description><![CDATA[ Closure of the infimum (meet) of two lattice elements.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = dom  <I>R</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>R</I> &isin; Lat &#8896;  <I>A</I> &isin;  <I>X</I> &#8896;  <I>B</I> &isin;  <I>X</I>) &rarr; (<I>R</I> inf<SUB>w</SUB> {<I>A</I>, <I>B</I>}) &isin; <I>X</I>) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/lanfwcl.html</feedburner:origLink></item>

<item>
<title>11095 : conntoppr Connectedness is a topological property.... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/kdKtazsUu0g/conntoppr.html</link>
<pubDate>8-Jul-2009</pubDate><description><![CDATA[ Connectedness is a topological property.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>J</I> ~= <I>K</I>) &rarr; (<I>J</I>  &isin; Con &harr; <I>K</I> &isin;  Con)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/conntoppr.html</feedburner:origLink></item>

<item>
<title>11094 : conntopprlem Lemma for conntoppr... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/YnOdvbOYmps/conntopprlem.html</link>
<pubDate>8-Jul-2009</pubDate><description><![CDATA[ Lemma for <A HREF="conntoppr.html">conntoppr</A>&nbsp;11095.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>J</I> ~= <I>K</I>) &rarr; (<I>J</I>  &isin; Con &rarr; <I>K</I> &isin;  Con)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/conntopprlem.html</feedburner:origLink></item>

<item>
<title>11093 : hmeocldb Homeomorphisms preserve closedness.  ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/yXRlCQhFykQ/hmeocldb.html</link>
<pubDate>8-Jul-2009</pubDate><description><![CDATA[ Homeomorphisms preserve closedness.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>F</I> &isin;  (<I>J</I> Homeo <I>K</I>)) &#8896; <I>S</I> &isin; (Clsd  &lsquo;<I>K</I>)) &rarr; (<SUP>&#9697;</SUP><I>F</I>  &#8220; <I>S</I>) &isin; (Clsd &lsquo;<I>J</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/hmeocldb.html</feedburner:origLink></item>

<item>
<title>11092 : hmeoclda Homeomorphisms preserve closedness.  ... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/ei9714sd6us/hmeoclda.html</link>
<pubDate>8-Jul-2009</pubDate><description><![CDATA[ Homeomorphisms preserve closedness.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>F</I> &isin;  (<I>J</I> Homeo <I>K</I>)) &#8896; <I>S</I> &isin; (Clsd  &lsquo;<I>J</I>)) &rarr; (<I>F</I> &#8220; <I>S</I>)  &isin; (Clsd &lsquo;<I>K</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/hmeoclda.html</feedburner:origLink></item>

<item>
<title>777 : dn1 A single axiom for Boolean algebra known... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/yPq5f_q_H-k/dn1.html</link>
<pubDate>8-Jul-2009</pubDate><description><![CDATA[ A single axiom for Boolean algebra known as DN<SUB>1</SUB>.  See      <A HREF="http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf">http://www-unix.mcs.anl.gov/~mccune/papers/basax/v12.pdf</A>.      (Contributed by Jeffrey Hankins, 3-Jul-2009.)  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (&not; (&not; (&not; (<I>&phi;</I> &#8897; <I>&psi;</I>) &#8897;  <I>&chi;</I>) &#8897; &not; (<I>&phi;</I> &#8897; &not;  (&not; <I>&chi;</I> &#8897; &not; (<I>&chi;</I> &#8897; <I>&theta;</I>)))) &harr; <I>&chi;</I>) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/dn1.html</feedburner:origLink></item>

<item>
<title>11091 : comptoppr Compactness is a topological property-th... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/X5u4uq-Tfsc/comptoppr.html</link>
<pubDate>3-Jul-2009</pubDate><description><![CDATA[ Compactness is a topological property-that is, for any two homeomorphic        topologies, either both are compact or neither is.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>J</I> ~= <I>K</I>) &rarr; (<I>J</I>  &isin; Comp &harr; <I>K</I> &isin;  Comp)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/comptoppr.html</feedburner:origLink></item>

<item>
<title>11090 : comptopprlem Lemma for comptoppr... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/7SUJJwmfeO8/comptopprlem.html</link>
<pubDate>3-Jul-2009</pubDate><description><![CDATA[ Lemma for <A HREF="comptoppr.html">comptoppr</A>&nbsp;11091.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896; <I>K</I> &isin; Top &#8896;  <I>J</I> ~= <I>K</I>) &rarr; (<I>J</I>  &isin; Comp &rarr; <I>K</I> &isin;  Comp)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/comptopprlem.html</feedburner:origLink></item>

<item>
<title>11089 : com15 Commutation of antecedents. Swap 1st and... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/XGRN-a4VR_4/com15.html</link>
<pubDate>3-Jul-2009</pubDate><description><![CDATA[ Commutation of antecedents. Swap 1st and 5th.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&phi;</I> &rarr; (<I>&psi;</I> &rarr; (<I>&chi;</I> &rarr; (<I>&theta;</I> &rarr; (<I>&tau;</I> &rarr; <I>&eta;</I>)))))&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&tau;</I>  &rarr; (<I>&psi;</I> &rarr; (<I>&chi;</I> &rarr; (<I>&theta;</I> &rarr; (<I>&phi;</I> &rarr; <I>&eta;</I>))))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/com15.html</feedburner:origLink></item>

<item>
<title>11088 : com45 Commutation of antecedents. Swap 4th and... </title>
<link>http://feedproxy.google.com/~r/MetamathRecentProofs/~3/QZvWYzO6jxI/com45.html</link>
<pubDate>3-Jul-2009</pubDate><description><![CDATA[ Commutation of antecedents. Swap 4th and 5th.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&phi;</I> &rarr; (<I>&psi;</I> &rarr; (<I>&chi;</I> &rarr; (<I>&theta;</I> &rarr; (<I>&tau;</I> &rarr; <I>&eta;</I>)))))&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>&phi;</I>  &rarr; (<I>&psi;</I> &rarr; (<I>&chi;</I> &rarr; (<I>&tau;</I> &rarr; (<I>&theta;</I> &rarr; <I>&eta;</I>)))))]]></description>
<feedburner:origLink>http://us2.metamath.org:8888/mpeuni/com45.html</feedburner:origLink></item>

</channel>
</rss>
