TheoremBase

Monotone Sequences of Sets, Unions of Traces, and Disjointness of Smaller Sets

Inclusions between consecutive terms of a sequence of sets extend to all ordered pairs of indices; the union of the traces of a sequence on a set is the trace of its union; an empty intersection is the same as disjointness; and sets contained in pairwise disjoint sets are pairwise disjoint.

Statement

In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let XX be a set, let sequences be as in Sequences (i), and let the union ⋃m∈NAm\bigcup_{m\in\mathbb{N}}A_{m} of a sequence (Am)(A_{m}) be the union of the family (Am)m∈N(A_{m})_{m\in\mathbb{N}}, as in Sets and Maps: Ordinary Notation (vi) and Indexed Families of Sets and Their Union, Intersection and Product (ii). Intersections and disjointness are as in The Boolean Operations on Classes, Disjointness, and the Universal Class (i) and The Boolean Operations on Classes, Disjointness, and the Universal Class (ii), ⊆\subseteq is as in Subclasses and Subsets (i), and ∅\emptyset is the empty set. The terms of a sequence in XX are sets, being elements of XX.

Let (Am)(A_{m}) be a sequence in XX with Am⊆Am+1A_{m}\subseteq A_{m+1} for every m∈Nm\in\mathbb{N}. Then Ak⊆AnA_{k}\subseteq A_{n} for all k,n∈Nk,n\in\mathbb{N} with k≤nk\le n.

Let (Am)(A_{m}) be a sequence in XX with Am+1⊆AmA_{m+1}\subseteq A_{m} for every m∈Nm\in\mathbb{N}. Then An⊆AkA_{n}\subseteq A_{k} for all k,n∈Nk,n\in\mathbb{N} with k≤nk\le n; in particular An⊆A1A_{n}\subseteq A_{1} for every n∈Nn\in\mathbb{N}.

Let (Am)(A_{m}) be a sequence in XX, let YY be a set, and let (Am∩Y)(A_{m}\cap Y) be the sequence in the power set P(Y)\mathcal{P}(Y) with mm-th term Am∩YA_{m}\cap Y, which exists by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii). Then ⋃m∈N(Am∩Y)=(⋃m∈NAm)∩Y\bigcup_{m\in\mathbb{N}}(A_{m}\cap Y)=\Big(\bigcup_{m\in\mathbb{N}}A_{m}\Big)\cap Y.

For sets AA and BB: A∩B=∅A\cap B=\emptyset if and only if AA and BB are disjoint, that is, if and only if no set is an element of both AA and BB.

Let (Am)(A_{m}) and (Cm)(C_{m}) be sequences in XX with Cm⊆AmC_{m}\subseteq A_{m} for every m∈Nm\in\mathbb{N} and Am∩Ak=∅A_{m}\cap A_{k}=\emptyset for all m,k∈Nm,k\in\mathbb{N} with m≠km\neq k. Then Cm∩Ck=∅C_{m}\cap C_{k}=\emptyset for all m,k∈Nm,k\in\mathbb{N} with m≠km\neq k.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…