"Prove that a topology Ƭ on X is the discrete topology if and only if {x} ∈ Ƭ for all x ∈ X" This question is from "Introduction to Topology: Pure and Applied," by Colin Adams and Robert Franzosa. 
Here's how the authors define a topology:
Let X be a set. A topology Ƭ on X is a collection of subsets of X, each called an open set, such that
(i) ∅ and X are open sets;
(ii) The intersection of finitely many open sets is an open set;
(iii) The union of any collection of open sets is an open set.
Here's how they define a discrete topology:
Let X be a nonempty set and let Ƭ be the collection of all subsets of X. Clearly this is a topology, since unions and intersections of subsets of X are themselves subsets of X and therefore are in the collection Ƭ. We call this the discrete topology on X. This is the largest topology that we can define on X.
Here's where I am with this problem:
First, is this what it's asking? Prove that Ƭ is a discrete topology on X if and only if every x in X is a set {x} in Ƭ?
If that is indeed the question, I'm still struggling. (I'm very bad at proofs).
If we look at the definition of a discrete topology, it seems self evident. A discrete topology must contain all subsets of X, which would include every x in X. I just have no idea how to write a mathematical proof of that.
Appreciate any help.

You correctly argued one direction -- if it has the discrete topology, the topology is the power set of $X$, so it contains all subsets of $X$, including the singletons $\{x\}$.
For the other direction, use axiom (iii) of a topology, and the fact that every subset of $X$ can be written as a union of singleton sets $\{x\}$.
E.g. $\{1,2,3 \} = \{1\} \cup \{2\} \cup \{3\}$.
What topology does $X$ have if every subset of $X$ is included in it?
