How to prove that A $\subseteq$B $\implies$ |A|$\le$|B|?

47 Views Asked by At

How to prove that A $\subseteq$B $\implies$ |A|$\le$|B|? I know that for |A|$\le$|B| there has to be a function f:A $\mapsto$B which is an injective function. But i get stuck because the sets A and B were not specified, so should i just let A and B be anything i decide ?

1

There are 1 best solutions below

2
On

Consider the inclusion function:

$$f:A\to B,\quad f(a)=a\quad\forall a\in A$$