Inside a difference, De Morgan swaps the operation: A − (B ∪ C) = (A − B) ∩ (A − C). For subset counts, give each element its choices and multiply: 2 choices give 2^n, 3 choices give 3^n.

— Rule to remember

Translate every difference into an intersection with a complement and De Morgan's laws do the rest. Use n(A Δ B) = n(A) + n(B) − 2 n(A ∩ B) to move between counts. For any subset-counting question, ask how many independent choices each element has; fixed elements contribute a factor of 1, and the complement count is often the quickest route.