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.
In the setting of Routine Facts Used Without Citation: Arithmetic, Maps, Predicativity and Indices, let be a set, let sequences be as in Sequences (i), and let the union of a sequence be the union of the family , 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), is as in Subclasses and Subsets (i), and is the empty set. The terms of a sequence in are sets, being elements of .
Let be a sequence in with for every . Then for all with .
Let be a sequence in with for every . Then for all with ; in particular for every .
Let be a sequence in , let be a set, and let be the sequence in the power set with -th term , which exists by Sequences and Maps of Sets: Complements, Traces, Two-Term Sequences, the Disjointing Sequence, and Sequences in a Subset (ii). Then .
For sets and : if and only if and are disjoint, that is, if and only if no set is an element of both and .
Let and be sequences in with for every and for all with . Then for all with .
Loading…
No relations recorded yet.