Proof. $S(n):$ Given any set of numbers, if one of the numbers is prime then all the numbers in the set are prime.
Starting with $S(1)$, means that we are starting with one prime number in the set, and the number in the set is prime. Which proves that $S(1)$ is true. Now, we if we make an induction hypothesis that S(n) is true, and we consider a set consisting of $n + 1$ numbers and at least one of them is prime. Let $P_1,P_2,P_3,...,P_{n+1}$ be the numbers in the set with $P_1$ being the number that is prime. If we consider the subset {${P_1,P_2,...,P_{n}}$}, we see it is the set with $n$ numbers and one of them is prime, so by induction hypothesis, numbers $P_1,P_2,...P_{n}$ are primes. Next the subset {${P_1,P_2,...,P_{n+1}}$} is also a subset of $n$ numbers. So, by induction hypothesis, we can say that they are all prime. Hence, it is proved that $S(n+1)$ is true, which completes the proof.