Working directly from the three axioms of probability, four theorems give the tools used to combine probabilities of related events.
Theorem 12.3 (impossible event). P(∅)=0 -- since S=S∪∅ with S,∅ mutually exclusive, axiom [P2] gives P(S)=P(S)+P(∅), so P(∅)=0.
Theorem 12.4 (complement rule). P(Aˉ)=1−P(A) -- since A∪Aˉ=S with A,Aˉ mutually exclusive, P(A)+P(Aˉ)=P(S)=1.
Theorem 12.5 (only-A rule). P(A∩Bˉ)=P(A)−P(A∩B) -- the part of A that misses B has probability 'all of A' minus 'the overlap with B', since (A∩Bˉ)∪(A∩B)=A with the two pieces mutually exclusive.
Theorem 12.6 -- the Addition Theorem. For any two events A,B:
P(A∪B)=P(A)+P(B)−P(A∩B).
The idea: adding P(A) and P(B) counts the overlap A∩B twice, so it is subtracted back out once. When A,B are mutually exclusive, P(A∩B)=0 and this collapses to the simpler additivity axiom. The theorem extends to three events:
P(A∪B∪C)=P(A)+P(B)+P(C)−P(A∩B)−P(B∩C)−P(C∩A)+P(A∩B∩C).
De Morgan corollaries. Applying the complement rule to the addition theorem gives P(Aˉ∩Bˉ)=1−P(A∪B) (neither A nor B occurs) and P(Aˉ∪Bˉ)=1−P(A∩B) (at least one of A,B fails to occur).