On Tarski-Knaster theorem

Let $P(X)$ denote the power set of $X$ (the set of all subsets of $X$) with a partial order given by inclusion.

If $F: P(X) \to P(X)$ is monotone (order preserving), then $F$ has a fixed point.

How are we going to prove that without using the term (complete lattice)?!

Simply note that monotonicity in this context means $A\subseteq B\implies F(A)\subseteq F(B)$.

Now consider the set $D=\bigcup\{A\mid A\subseteq F(A)\}$. Show that $D\subseteq F(D)$ and conclude from that $F(D)\subseteq D$.

How we're going to prove that without using the term (complete lattice)?!

Define a ruskomsnusk to mean a partially ordered set such that every subset has a least upper bound and a greatest lower bound.

Then $\mathcal P(X)$ ordered by set inclusion forms a ruskomsnusk.

et cetera