Definitions
,
Results
,
Conjectures
▾
Set of symbols
▾
Alphabet
▾
Deduction system
▾
Theory
▾
Zermelo-Fraenkel set theory
▾
Set
▾
Collection of sets
Set intersection
Formulation 0
Let $x$ be a
D11: Set
.
The
intersection
of $x$ is the
D11: Set
\begin{equation} \cap x : = \{ z \mid \forall \, y \in x : z \in y \} \end{equation}
Formulation 4
Let $X_j$ be a
D11: Set
for each $j \in J$.
The
intersection
of $\{ X_j \}_{j \in J}$ is the
D11: Set
\begin{equation} \bigcap_{j \in J} X_j : = \{ x \mid \forall \, j \in J : x \in X_j \} \end{equation}
Results
»
R237: Intersection distributes over union
»
R2081: Binary set intersection with empty set is empty
»
R2079: Isotonicity of set intersection
»
R4074: Arbitrary intersection of subsets is subset
»
R4149: Countable intersection is a lower bound to each set in the intersection
»
R4150: Finite intersection is a lower bound to each set in the intersection
»
R4151: Binary intersection is a lower bound to each set in the intersection
»
R4148: Intersection is a lower bound to each set in the intersection
»
R4160: Subset of intersection iff subset of every set in the intersection
»
R4161: Subset of countable intersection iff subset of every set in the intersection
»
R4162: Subset of finite intersection iff subset of every set in the intersection
»
R4163: Subset of binary intersection iff subset of both sets in the intersection
»
R4215: Countable set intersection is invariant under bijective shifting of indices
»
R4216: Finite set intersection is invariant under bijective shifting of indices
»
R2221: Set intersection is invariant under bijective shifting of indices
»
R2220: Binary set intersection is commutative
»
R4267: Set intersection with empty set is empty
»
R4265: Finite set intersection with empty set is empty
»
R4266: Countable set intersection with empty set is empty
»
R2219: Set intersection is associative
»
R1130: Intersection is largest lower bound