If is empty then both and are empty and the assertion holds.
Let be nonempty and let . Let be an injective map from to and let . For every function we define function this way:
Then mapping defined as is injective and maps to .
I have a problem with cardinals:
k,j,l are cardinals. 0<k, k=< l
So this, I believe, should be the way to solution:
I need to prove that j^k<=j^l
so, let |a|=j, |b|=k, |c|=l
I need to prove that |a^c| >= |a^b|
( >= means larger or equal)
Now, I understand that I need to create a function from a^b to a^c and show that it is a 1-1 function.
I now that I can say that there is a function that is a 1-1 function (because i know that b<=c ), but I just can't seem to find a way to use it...
please help me with this
Let f:A -> B be a fuction, by Range(f) (also Rng(f) or Ran(f)) I mean the same as your f[A] -whose advantage is btw. that you can also use it to write f[C], where C is a subset of A, to denote image of the set C under the map f.
Also Im(f) means the image of entire domain A under the mapping f.
In wiki they say: "Some texts refer to the image of f as the range of f, but this usage should be avoided because the word "range" is also commonly used to mean the codomain of f." ...and codomain means the whole B, which I didn't mean by Range(f). So I should probably stop using Range(f) and start using Im(f)!!