De Morgan's Laws (Set Theory)/Set Difference/General Case/Difference with Intersection

Theorem
Let $S$ and $T$ be sets.

Let $\powerset T$ be the power set of $T$.

Let $\mathbb T \subseteq \powerset T$.

Then:
 * $\displaystyle S \setminus \bigcap \mathbb T = \bigcup_{T' \mathop \in \mathbb T} \paren {S \setminus T'}$

where:
 * $\displaystyle \bigcap \mathbb T := \set {x: \forall T' \in \mathbb T: x \in T'}$

that is, the intersection of $\mathbb T$

Caution
It is tempting to set up an argument to prove the general case using induction. While this works, and is a perfectly valid demonstration for an elementary student in how such proofs are crafted, such a proof is inadequate as it is valid only when $\mathbb T$ is finite.

The proof as given above relies only upon De Morgan's laws as applied to predicate logic. Thus the uncountable case has been reduced to a result in logic.

However, for better or worse, the following is an example of how one might achieve this result using induction.