You name one property you need to check: antisymmetric.
You must also ensure that the relation is reflexive, and transitive.
A relation R is a partial order on a set $S$
if it is reflexive: for all $x\in S, x R x$
if it is antisymmetric, which is the property you list
And if it is transitive: for all $x, y, z \in S,\; (x R y \text{ and}\; y R z) \rightarrow x R z$
Reflexivity is easy to check here: $(1,1),(2,2),(3,3),(4, 4) \in R$, so for all $x\in S, xRx$.
In small sets like this, it's usually easy enough to check whether or not these three properties all hold.
There are really only three pair in your set for which you need to consider antisymmetry and transitivity.
Can you find counterexamples to these properties?
All you need is one counterexample to a property, and all you need is one property to fail to hold, to conclude that a relation is NOT a partial order on a set.
If no property fails, the relation is a partial order on your set.
Edit:
To address your question as to what constitutes a formal proof: Yes, you could list all pairs to show satisfaction of all the properties. It depends on your instructor, how detailed you have to be in a proof.
For example, you could state $\lnot \exists x \in S$ such that $\lnot (x R x)$, which translates to the equivalent, $\forall x \in S, (xRx)$. And do similarly for each property, without listing all pairs.
Again, it depends on the context context in which you need to prove that the relation defines a partial order on S.