- #1
evinda
Gold Member
MHB
- 3,836
- 0
Hello! (Wave)
I want to show that the subsets of finite sets are finite sets.
That's what I have tried so far:
Let $A$ be a finite set.
Then $A \sim n$, for a natural number $n \in \omega$.
That means that there is a $1-1$ and surjective function $f: A \to n$.
Let $B \subset A$.
That means that $\forall x(x \in B \rightarrow x \in A)$.
What bijective function could we take in order to show that $B$ is also a finite set?
A set is called finite if it is equinumerous with a natural number $n \in \omega$.
I want to show that the subsets of finite sets are finite sets.
That's what I have tried so far:
Let $A$ be a finite set.
Then $A \sim n$, for a natural number $n \in \omega$.
That means that there is a $1-1$ and surjective function $f: A \to n$.
Let $B \subset A$.
That means that $\forall x(x \in B \rightarrow x \in A)$.
What bijective function could we take in order to show that $B$ is also a finite set?