Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable/Corollary 1

Corollary to Union of Slowly Well-Ordered Class under Subset Relation is Well-Orderable
Let $N$ be a class.

Let $N$ be slowly well-ordered under the subset relation.

For $a \in \ds \bigcup N$, let $\map F a$ denote the smallest element of $N$ that contains $a$.

For $a, b \in \ds \bigcup N$, we define $a \preccurlyeq b \iff \map F a \subseteq \map F b$.

We have that:
 * $a \preccurlyeq b \iff \forall x \in N: b \subseteq x \implies a \subseteq x$