<?xml version="1.0" encoding="UTF-8"?>
<rss 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>
<item>
<title>11089 : comptoppr Compactness is a topological property-th... </title>
<link>http://us2.metamath.org:8888/mpeuni/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>
</item>

<item>
<title>11088 : comptopprlem Lemma for comptoppr... </title>
<link>http://us2.metamath.org:8888/mpeuni/comptopprlem.html</link>
<pubDate>3-Jul-2009</pubDate><description><![CDATA[ Lemma for <A HREF="comptoppr.html">comptoppr</A>&nbsp;11089.  <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>
</item>

<item>
<title>11087 : com15 Commutation of antecedents. Swap 1st and... </title>
<link>http://us2.metamath.org:8888/mpeuni/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>
</item>

<item>
<title>11086 : com45 Commutation of antecedents. Swap 4th and... </title>
<link>http://us2.metamath.org:8888/mpeuni/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>))))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>7026 : cj11 Complex conjugate is a one-to-one functi... </title>
<link>http://us2.metamath.org:8888/mpeuni/cj11.html</link>
<pubDate>2-Jul-2009</pubDate><description><![CDATA[ Complex conjugate is a one-to-one function.  (Proof shortened by Eric      Schmidt, 2-Jul-2009.  Previous version is <A HREF="cj11OLD.html">cj11OLD</A>&nbsp;7027.)  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>A</I> &isin; &#8450; &#8896; <I>B</I> &isin; &#8450;) &rarr;  ((&lowast; &lsquo;<I>A</I>) = (&lowast;  &lsquo;<I>B</I>) &harr; <I>A</I> = <I>B</I>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>8918 : laspwcl Closure of the supremum (join) of two la... </title>
<link>http://us2.metamath.org:8888/mpeuni/laspwcl.html</link>
<pubDate>1-Jul-2009</pubDate><description><![CDATA[ Closure of the supremum (join) 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> sup<SUB>w</SUB> {<I>A</I>, <I>B</I>}) &isin; <I>X</I>) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>11085 : cptclsscpt A closed subset of a compact space is co... </title>
<link>http://us2.metamath.org:8888/mpeuni/cptclsscpt.html</link>
<pubDate>30-Jun-2009</pubDate><description><![CDATA[ A closed subset of a compact space is compact.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Comp &#8896; <I>S</I> &isin; (Clsd &lsquo;<I>J</I>)) &rarr; (subSp &lsquo;&lang;<I>S</I>, <I>J</I>&rang;) &isin; Comp) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>11084 : compsub Two equivalent ways of describing a comp... </title>
<link>http://us2.metamath.org:8888/mpeuni/compsub.html</link>
<pubDate>30-Jun-2009</pubDate><description><![CDATA[ Two equivalent ways of describing a compact subset of a topological        space.  Inspired by Sue E. Goodman's <I>Beginning Topology</I>.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>S</I> &#8838;  <I>X</I>) &rarr; ((subSp &lsquo;&lang;<I>S</I>, <I>J</I>&rang;) &isin; Comp &harr; &forall;<I>c</I> &isin; &weierp; <I>J</I>(<I>S</I> &#8838; &cup;<I>c</I> &rarr; &exist;<I>d</I> &isin; (&weierp;<I>c</I> &cap; Fin)<I>S</I>  &#8838; &cup;<I>d</I>))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>11083 : compsublem Lemma for compsub... </title>
<link>http://us2.metamath.org:8888/mpeuni/compsublem.html</link>
<pubDate>30-Jun-2009</pubDate><description><![CDATA[ Lemma for <A HREF="compsub.html">compsub</A>&nbsp;11084.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Top &#8896;  <I>S</I> &#8838;  <I>X</I>) &rarr; (&forall;<I>c</I> &isin; &weierp; <I>J</I>(<I>S</I> &#8838; &cup;<I>c</I> &rarr; &exist;<I>d</I> &isin; (&weierp;<I>c</I> &cap; Fin)<I>S</I>  &#8838; &cup;<I>d</I>) &rarr; &forall;<I>s</I> &isin; &weierp; (subSp  &lsquo;&lang;<I>S</I>, <I>J</I>&rang;)(&cup;(subSp &lsquo;&lang;<I>S</I>, <I>J</I>&rang;) = &cup;<I>s</I> &rarr; &exist;<I>t</I> &isin; (&weierp;<I>s</I> &cap; Fin)&cup;(subSp  &lsquo;&lang;<I>S</I>, <I>J</I>&rang;) = &cup;<I>t</I>))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>11082 : compcov An open cover of a compact topology has ... </title>
<link>http://us2.metamath.org:8888/mpeuni/compcov.html</link>
<pubDate>30-Jun-2009</pubDate><description><![CDATA[ An open cover of a compact topology has a finite subcover.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = &cup;<I>J</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>J</I> &isin; Comp &#8896;  <I>S</I> &#8838;  <I>J</I> &#8896;  <I>X</I> = &cup;<I>S</I>) &rarr; &exist;<I>s</I> &isin; (&weierp;<I>S</I> &cap; Fin)<I>X</I> =  &cup;<I>s</I>)]]></description>
</item>

</channel>
</rss>
