Definition:Set Ordered by Subset Relation/Reverse Inclusion

Definition

Let $S$ be a set.

Let $S$ be ordered by $\supseteq$, the dual of the subset relation $\subseteq$.

Then $S$ is said to be ordered by reverse inclusion.

Sources

• 1990: John B. Conway: A Course in Functional Analysis (2nd ed.) ... (previous) ... (next): Appendix $\text{A}$ Preliminaries: $\S 2.$ Topology