Union is Smallest Superset/General Result

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $S$ and $T$ be sets.

Let $\powerset S$ denote the power set of $S$.

Let $\mathbb S$ be a subset of $\powerset S$.


Then:

$\displaystyle \paren {\forall X \in \mathbb S: X \subseteq T} \iff \bigcup \mathbb S \subseteq T$


Family of Sets

In the context of a family of sets, the result can be presented as follows:


Let $\family {S_i}_{i \mathop \in I}$ be a family of sets indexed by $I$.


Then for all sets $X$:

$\displaystyle \paren {\forall i \in I: S_i \subseteq X} \iff \bigcup_{i \mathop \in I} S_i \subseteq X$

where $\displaystyle \bigcup_{i \mathop \in I} S_i$ is the union of $\family {S_i}$.


Proof

Let $\mathbb S \subseteq \powerset S$.

By Union of Subsets is Subset: Subset of Power Set:

$\displaystyle \paren {\forall X \in \mathbb S: X \subseteq T} \implies \bigcup \mathbb S \subseteq T$

$\Box$


Now suppose that $\displaystyle \bigcup \mathbb S \subseteq T$.


Consider any $X \in \mathbb S$ and take any $x \in X$.

From Set is Subset of Union: General Result we have that:

$\displaystyle X \subseteq \bigcup \mathbb S$

Thus:

$\displaystyle x \in \bigcup \mathbb S$

But:

$\displaystyle \bigcup \mathbb S \subseteq T$

So it follows that:

$X \subseteq T$

So:

$\displaystyle \bigcup \mathbb S \subseteq T \implies \paren {\forall X \in \mathbb S: X \subseteq T}$

$\Box$


Hence:

$\displaystyle \paren {\forall X \in \mathbb S: X \subseteq T} \iff \bigcup \mathbb S \subseteq T$

$\blacksquare$


Also see


Sources