prop. For every set X and preorder → on X, exists a set S and function s:X→2S such that x→y iff s(x)⊆s(y)
pf. Take (X,→). For x∈X, let s(x) denote the set of values y∈X with y→x. Note that s is of type s:X→P(X)=2X, as promised. I claim that x→y⟺s(x)⊆s(y):
(⇒) Take x→y and z∈s(x). Then z→x so by transitivity z→y so z∈s(y). Thus s(x)⊆s(y).
(⇐) Take s(x)⊆s(y). Note x→x so x∈s(x) so x∈s(y) so x→y.