There are lots of different inference schemes for this sort of thing, but I don't see exactly how your conclusion follows. There are, however, two general approaches. One is algebraic, treating the collection of subsets of some universe as a Boolean algebra, and using the Boolean algebra axioms to conduct inference. The other is usually a little easier for beginners, and is more element based, focusing on the "$\in$" relationship.
Under this second approach the easiest way to show equality of sets is to appeal to the Axiom of Extensionality: $$C=D \iff \big( x\in C \iff x\in D\big).$$ The simpler form is this:
$$C=D \iff \big( (C\subseteq D) \,\&\, (D\subseteq C)\big).$$
In our case, we want to show that $X=A^{c}$. I'll use extensionality, since it's faster and I have to rush to get my bus.
Suppose that $x\in X$. Then since $X\cap A=\emptyset$, it must be the case that $x\notin A$. Thus $X\subseteq A^{c}$. Now take $x\in A^{c}$. Since $x\in X\cup A$, we must have $x\in X$. Thus $A^{c}\subseteq X$, as required.