Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion content/set-theory/card-arithmetic/expotough.tex
Original file line number Diff line number Diff line change
Expand Up @@ -61,7 +61,7 @@
&= \cardexpo{2}{\cardfont{a} \cardtimes \cardfont{b}}
\text{, by \olref{simplecardexpo}} \\
&= \cardexpo{2}{\cardfont{b}}
\text{, by \olref[simp]{cardplustimesmax}}
\text{, as $\cardfont{b} \leq \cardfont{a} \cardtimes \cardfont{b} \leq \cardfont{b} \cardtimes \cardfont{b} = \cardfont{b}$ by \olref[simp]{cardplustimesmax}}
\end{align*}
\end{proof}

Expand Down
3 changes: 2 additions & 1 deletion content/set-theory/card-arithmetic/simp.tex
Original file line number Diff line number Diff line change
Expand Up @@ -113,7 +113,8 @@
\cardfont{b})$. Then invoking \olref{alphatimesalpha},
$\cardfont{a}\cardtimes\cardfont{a} = \cardfont{a} \leq \cardfont{a}
\cardplus \cardfont{b} \leq \cardfont{a} \cardplus \cardfont{a} \leq
\cardfont{a} \cardtimes \cardfont{a}$. \end{proof}\noindent Similarly,
\cardfont{a} \cardtimes \cardfont{a}$, and likewise $\cardfont{a} \leq
\cardfont{a} \cardtimes \cardfont{b} \leq \cardfont{a} \cardtimes \cardfont{a} = \cardfont{a}$. \end{proof}\noindent Similarly,
if $\cardfont{a}$ is infinite, an $\cardfont{a}$-sized union of
$\leq\cardfont{a}$-sized sets has size $\leq\cardfont{a}$:

Expand Down
2 changes: 1 addition & 1 deletion content/set-theory/replacement/limofsize.tex
Original file line number Diff line number Diff line change
Expand Up @@ -15,7 +15,7 @@
set formed by Replacement cannot be any larger than any set from which
it was formed. Stated precisely: suppose you form a set
$\funimage{\tau}{A} = \Setabs{\tau(x)}{x \in A}$ using Replacement;
then $\cardle{\funimage{\tau}{A}}{A}$; so if the !!{element}s of $A$
then (given the Axiom of Choice) $\cardle{\funimage{\tau}{A}}{A}$; so if the !!{element}s of $A$
were not too numerous to form a set, their images are not too numerous
to form $\funimage{\tau}{A}$.

Expand Down