<?xml version="1.0" encoding="UTF-8"?>

<record version="4" id="8200">
 <title>well-ordering principle implies axiom of choice</title>
 <name>WellOrderingPrincipleImpliesAxiomOfChoice</name>
 <created>2006-07-30 03:55:57</created>
 <modified>2007-05-30 22:14:06</modified>
 <type>Theorem</type>
 <creator id="1863" name="Wkbj79"/>
 <author id="1863" name="Wkbj79"/>
 <classification>
	<category scheme="msc" code="03E25"/>
 </classification>
 <related>
	<object name="AxiomOfChoice"/>
	<object name="ZermelosWellOrderingTheorem"/>
 </related>
 <preamble>\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}

\usepackage{psfrag}
\usepackage{graphicx}
\usepackage{amsthm}
\usepackage{xypic}

\newtheorem*{thm*}{Theorem}
</preamble>
 <content>\begin{thm*}
The well-ordering principle implies the axiom of choice.
\end{thm*}

\begin{proof}
Let $C$ be a collection of nonempty sets.  Then $\displaystyle \bigcup_{S \in C} S$ is a set.  By the well-ordering principle, $\displaystyle \bigcup_{S \in C} S$ is well-ordered under some relation $&lt;$.  Since each $S$ is a nonempty subset of $\displaystyle \bigcup_{S \in C} S$, each $S$ has a least member $m_S$ with respect to the relation $&lt;$.

Define $\displaystyle f \colon C \to \bigcup_{S \in C} S$ by $f(S)=m_S$.  Then $f$ is a choice function.  Hence, the axiom of choice holds.
\end{proof}</content>
</record>
