First order logic, finite partially ordered structure problem The exercise below is part of an exam for a Logic course. There were other questions leading up to this, but I've included their "result" in the wording below. 
Suppose alphabet $\mathcal{L} = \lbrace <, =\rbrace $, where $<$ is a 2-place relation. 
Suppose also, that every structure $\mathcal{A}$ of $\mathcal{L}$ is strictly partially ordered ($<^\mathcal{A}$ is irreflexive and transitive).


*

*Find a proposition $\phi$ such that every structure $\mathcal{A}$ of
$\mathcal{L}$ that satisfies it, has at least n elements where $n
    \in \mathbb{N}$. (I've done this)

*Using the compactness theorem prove that there is
    no set of propositions $\Sigma$ such that if $\mathcal{A}$ is a
    structure of $\mathcal{L}$ then


$$\mathcal{A} \text{ model of } \Sigma \Leftrightarrow \mathcal{A} \text{ is finite strictly partially ordered}$$
Any ideas for the second part will be very appreciated :)

Let $\phi_n$ be a proposition satisfied precisely by those structures with at least $n$ elements. Consider 
$$\Sigma' = \Sigma \cup \bigcup_{n\in \mathbb{N}} \phi_n$$
as a new family of propositions. Any model of $\Sigma'$ is also a model of $\Sigma$. Can you show that any model of $\Sigma'$ is infinite, and also, using the Compactness Theorem, that models of $\Sigma'$ exist?
