# Absorption Laws (Set Theory)/Intersection with Union

Jump to navigation
Jump to search

## Contents

## Theorem

- $S \cap \paren {S \cup T} = S$

## Proof 1

\(\displaystyle \) | \(\) | \(\displaystyle S \subseteq \paren {S \cup T}\) | Set is Subset of Union | ||||||||||

\(\displaystyle \) | \(\leadsto\) | \(\displaystyle S \cap \paren {S \cup T} = S\) | Intersection with Subset is Subsetâ€Ž |

$\blacksquare$

## Proof 2

\(\displaystyle x\) | \(\in\) | \(\displaystyle S \cap \paren {S \cup T}\) | |||||||||||

\(\displaystyle \leadstoandfrom \ \ \) | \(\displaystyle x\) | \(\in\) | \(\displaystyle S \land \paren {x \in S \lor x \in T}\) | Definition of Set Intersection and Definition of Set Union | |||||||||

\(\displaystyle \leadstoandfrom \ \ \) | \(\displaystyle x\) | \(\in\) | \(\displaystyle S\) | Conjunction Absorbs Disjunction |

$\blacksquare$

## Also see

- Union Absorbs Intersection, where it is proved that $S \cup \paren {S \cap T} = S$

These two results together are known as the Absorption Laws, corresponding to the equivalent results in logic.

## Sources

- 1965: J.A. Green:
*Sets and Groups*... (previous) ... (next): Chapter $1$. Sets: Exercise $3$ - 1975: T.S. Blyth:
*Set Theory and Abstract Algebra*... (previous) ... (next): $\S 1$. Sets; inclusion; intersection; union; complementation; number systems: Exercise $3$