Let $A$ and $B$ be decreasing sets of $P$. Prove that $A \prec B$ in $\langle {\mathcal{O} (P); \subseteq} \rangle$ iff $B = A \cup \{b \}$ for some minimal element $b$ of $P \setminus A$.
Let $P$ be an ordered set and $Q \subseteq P$. Then $a \in Q$ is a minimal element of $Q$ if $x \leqslant a$ and $x \in Q$ imply $a = x$.
$Q$ is a decreasing set (or down-set), whenever $x \in Q$, $y \in P$ and $y \leqslant x$, we have $y \in Q$.
$x \prec y$ ($x$ is covered by $y$), if $x < y$ and $x \leqslant z < y$ implies $z=y$.
The family of all down-sets of $P$ is denoted by $\mathcal{O} (P)$
I understand the exercise, but I don't know how to prove it, the first thing I tried was
$B \subseteq A \cup \{b \}$ and $B \supseteq A \cup \{b \}$ $\Longrightarrow$ $B = A \cup \{b \}$,
and then I wanted to prove both inclusions, but I couldn't. Somebody help me please.
The book is Davey B.A., Priestley H.A. - Introduction to Lattices and Order page 27 - exercise 1.12.
Thanks.
$A \prec B$ implies $A < B$ in the poset $\langle \mathcal{O}(P); \subseteq \rangle$, so $A \subsetneq B$, which implies there is at least some $b \in B\setminus A$. So clearly $A \cup \{b\} \subseteq B$.
You will need to show $A \cup \{b\}$ is a down-set, so a member of $\mathcal{O}(P)$. Can you show that $b$ is minimal in $P \setminus A$, as required? Can there be another element in $B\setminus A$ besides $b$?