I am reading a book on set theory and the following theorem has been left as an exercise to the reader.
Let $a,b,c$ be cardinals with $a,b>0$. If $b\leq c$ then $a^b \leq a^c$.
How would we go about proving this with just the definitions and mappings. I have the following work:
Let $A,B,C$ be sets and $a=|A|,b=|B|,c=|C|$. Then $f$ is an injective function from $B$ to $C$. I think we have to then define another function between the two specified sets and prove that it is injective. Any tips on how to proceed?
This is, in fact, not true. Consider $a = b = 0$ and $c = 1$. Then $b \leq c$, but $1 = a^b > 0 = a^c$ (using the definitions of cardinal exponentiation to calculate $0^0$).
To solve this, let $a = |A|$, $b = |B|$, $c = |C|$ and suppose we have some element $k \in A$. WLOG, take $B \subseteq C$. We see that $a^b = |\{f : B \to A\}|$ and $a^c = |\{g | C \to A\}|$. Then given $f : B \to A$, define $h_f : C \to A$ by $h_f(x) = f(x)$ if $x \in B$ and $k$ otherwise. Then we see that $h$ is a 1-1 function from $\{f : B \to A\}$ to $\{g : C \to A\}$, since $h_f |_B = f$ and thus if $h_f = h_{f'}$, we have $f = h_f|_B = h_g|_B = g$.