<?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>6076 : rpneg Either a nonzero real or its negation is... </title>
<link>http://us2.metamath.org:8888/mpeuni/rpneg.html</link>
<pubDate>20-Nov-2008</pubDate><description><![CDATA[ Either a nonzero real or its negation is a positive real, but not both.      Axiom 8 of [<A HREF="mmset.html#Apostol">Apostol</A>] p. 20.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>A</I> &isin; &#8477; &#8896; <I>A</I> &ne; 0)  &rarr; (<I>A</I> &isin; &#8477;<SUP>+</SUP>  &harr; &not; -<I>A</I> &isin; &#8477;<SUP>+</SUP>)) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>4507 : pwne No set equals its power set.  ... </title>
<link>http://us2.metamath.org:8888/mpeuni/pwne.html</link>
<pubDate>19-Nov-2008</pubDate><description><![CDATA[ No set equals its power set.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>A</I> &isin; <I>B</I> &rarr;  &weierp;<I>A</I>  &ne; <I>A</I>) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>6075 : rerpdivcl Closure law for division of a real by a ... </title>
<link>http://us2.metamath.org:8888/mpeuni/rerpdivcl.html</link>
<pubDate>18-Nov-2008</pubDate><description><![CDATA[ Closure law for division of a real by a positive real.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>A</I> &isin; &#8477; &#8896; <I>B</I> &isin; &#8477;<SUP>+</SUP>) &rarr; (<I>A</I> / <I>B</I>) &isin; &#8477;) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>1966 : sbc8g This is the closest we can get to df-sbc... </title>
<link>http://us2.metamath.org:8888/mpeuni/sbc8g.html</link>
<pubDate>18-Nov-2008</pubDate><description><![CDATA[ This is the closest we can get to <A HREF="df-sbc.html">df-sbc</A>&nbsp;1949 if we start from <A HREF="dfsbcq.html">dfsbcq</A>&nbsp;1950        (see its comments).  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>A</I> &isin; <I>B</I> &rarr;  ([<I>A</I> / <I>x</I>]<I>&phi;</I> &harr;  <I>A</I> &isin;  {<I>x</I>&#8739;<I>&phi;</I>})) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>1965 : sbc7g An equivalence for class substitution in... </title>
<link>http://us2.metamath.org:8888/mpeuni/sbc7g.html</link>
<pubDate>18-Nov-2008</pubDate><description><![CDATA[ An equivalence for class substitution in the spirit of <A HREF="df-clab.html">df-clab</A>&nbsp;1470.        Note that <I>x</I> and <I>A</I> don't have to be distinct.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>A</I> &isin; <I>B</I> &rarr;  ([<I>A</I> / <I>x</I>]<I>&phi;</I> &harr;  &exist;<I>y</I>(<I>y</I> = <I>A</I> &#8896; [<I>y</I> / <I>x</I>]<I>&phi;</I>))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>10774 : isepic The predicate ... </title>
<link>http://us2.metamath.org:8888/mpeuni/isepic.html</link>
<pubDate>17-Nov-2008</pubDate><description><![CDATA[ The predicate &quot;is an epimorphism&quot; when the morphism <I>F</I> belongs to a        homset.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>O</I> = dom (<U>id</U> &lsquo;<I>T</I>)&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>H</I> = (hom &lsquo;<I>T</I>)&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>R</I> = (<U>o</U> &lsquo;<I>T</I>)&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; ((<I>T</I> &isin; Cat &#8896;  (<I>A</I> &isin;  <I>O</I> &#8896;  <I>B</I> &isin;  <I>O</I>) &#8896;  <I>F</I> &isin;  (<I>H</I> &lsquo;&lang;<I>A</I>, <I>B</I>&rang;)) &rarr;  (<I>F</I> &isin;  (Epi &lsquo;<I>T</I>) &harr; &forall;<I>c</I> &isin; <I>O</I> &forall;<I>g</I> &isin; (<I>H</I>  &lsquo;&lang;<I>B</I>, <I>c</I>&rang;)&forall;<I>h</I> &isin; (<I>H</I> &lsquo;&lang;<I>B</I>, <I>c</I>&rang;)((<I>g</I><I>R</I><I>F</I>) = (<I>h</I><I>R</I><I>F</I>) &rarr;  <I>g</I> = <I>h</I>))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>10643 : usinuniop If a topology is connected, its underlyi... </title>
<link>http://us2.metamath.org:8888/mpeuni/usinuniop.html</link>
<pubDate>17-Nov-2008</pubDate><description><![CDATA[ If a topology is connected, its underlying set can't be partitioned        into two non empty non-overlapping open sets.  <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; Con &rarr; &forall;<I>x</I> &isin; <I>J</I> &forall;<I>y</I> &isin; <I>J</I> ((<I>x</I> &ne; &empty; &#8896; <I>y</I> &ne;  &empty; &#8896;  (<I>x</I> &cap; <I>y</I>) = &empty;) &rarr;  <I>X</I> &ne; (<I>x</I> &cup; <I>y</I>))) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>10642 : iscon2 The predicate J is a connected topology ... </title>
<link>http://us2.metamath.org:8888/mpeuni/iscon2.html</link>
<pubDate>17-Nov-2008</pubDate><description><![CDATA[ The predicate <I>J</I> is a connected topology .  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>J</I> &isin; Con &harr;  (<I>J</I> &isin; Top  &#8896; (<I>J</I>  &cap; (Clsd &lsquo;<I>J</I>)) = {&empty;, &cup;<I>J</I>})) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>10641 : iscon The predicate J is a connected topology ... </title>
<link>http://us2.metamath.org:8888/mpeuni/iscon.html</link>
<pubDate>17-Nov-2008</pubDate><description><![CDATA[ The predicate <I>J</I> is a connected topology .  <BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>J</I> &isin; Top &rarr;  (<I>J</I> &isin; Con  &harr; (<I>J</I> &cap; (Clsd &lsquo;<I>J</I>)) = {&empty;, &cup;<I>J</I>})) <BR/>&nbsp;&nbsp;&nbsp;&nbsp;]]></description>
</item>

<item>
<title>10523 : vri The properties of a real vector space, w... </title>
<link>http://us2.metamath.org:8888/mpeuni/vri.html</link>
<pubDate>17-Nov-2008</pubDate><description><![CDATA[ The properties of a real vector space, which is an abelian group        (i.e. the vectors, with the operation of vector addition) accompanied        by a scalar multiplication operation on the field of real numbers.        The variable <I>W</I> was chosen because <I>V</I> is already used for the        universal class.  <BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>G</I> = (1<SUP>st</SUP> &lsquo;<I>W</I>)&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>S</I> = (2<SUP>nd</SUP> &lsquo;<I>W</I>)&nbsp;&nbsp;&nbsp; &amp;<BR/>&nbsp;&nbsp;&nbsp;&#8866; <I>X</I> = ran <I>G</I>&nbsp;&nbsp;&nbsp; &#8658;<BR/>&nbsp;&nbsp;&nbsp;&#8866; (<I>W</I> &isin; RVec &rarr; (<I>G</I> &isin; Abel &#8896; <I>S</I>:(&#8477; &times; <I>X</I>)&ndash;&rarr;<I>X</I> &#8896; &forall;<I>x</I> &isin; <I>X</I>  ((1<I>S</I><I>x</I>)  = <I>x</I> &#8896;  &forall;<I>y</I>  &isin; &#8477;  (&forall;<I>z</I>  &isin; <I>X</I>  (<I>y</I><I>S</I>(<I>x</I><I>G</I><I>z</I>)) =  ((<I>y</I><I>S</I><I>x</I>)<I>G</I>(<I>y</I><I>S</I><I>z</I>)) &#8896; &forall;<I>z</I> &isin; &#8477; (((<I>y</I> +  <I>z</I>)<I>S</I><I>x</I>) =  ((<I>y</I><I>S</I><I>x</I>)<I>G</I>(<I>z</I><I>S</I><I>x</I>)) &#8896; ((<I>y</I>  &middot; <I>z</I>)<I>S</I><I>x</I>) = (<I>y</I><I>S</I>(<I>z</I><I>S</I><I>x</I>)))))))]]></description>
</item>

</channel>
</rss>
