Q:

Prove that if A and B are mutually exclusive then $P(A)\leq P(B^c)$.

Suppose $\textbf{P}(A\cap B) = 0$. Prove $\textbf{P}(A) \leq \textbf{P}(B^{c})$ using the axioms of probability. 
I know the axioms are: 

$\textbf{P}(A)\geq 0$.
$\textbf{P}(\Omega) = 1$.
If A and B are disjoint, $P(A\cup B) = P(A) + P(B)$.

I've tried messing around with each of these axioms to end up with the proof statement, but haven't been able to get to it. Does anybody know how to prove this using the axioms?
Thanks

A:

$$P(A)=P(A\cap B) + P(A\cap B^c)= P(A\cap B^c)\leq P(B^c)$$
The first equality uses $A=(A\cap B)\cup (A\cap B^c)$, and Axiom 3. (union of disjoints sets). 
The last inequality follows from the more general $X\subset Y \implies P(X)\leq P(Y)$, which is a consequence of $Y=X\cup(Y\setminus X)$ and Axiom 3.

