Let $A\neq \varnothing$ and denote by $\operatorname{Part}(A)$ the set of partitions of $A$. For $S,S' \in\operatorname{Part}(A),$ we set $$ S\leq S' :\!\!\iff \forall C \in S: \exists C'\in S': C\subseteq C'. $$
Let $T\subseteq \operatorname{Part}(A)$. Show that $T$ has an infimum with respect to $\leq$.
I would actually want to show that $$ \inf T = \left\{\bigcap_{S\in T} C_S\neq \varnothing : \forall S \in T, C_S\in S\right\}. $$
Am I allowed to write this without using the Axiom of Choice?
If not, what other way is there to prove the existence of $\inf T$, if any at all?
SKETCH: For each $S\in\operatorname{Part}(A)$ and $a\in A$ let $[a]_S$ be the part of $S$ that contains $a$. Observe that $S\le S'$ iff $[a]_S\subseteq[a]_{S'}$ for each $a\in A$. Given $T\subseteq\operatorname{Part}(A)$, for each $a\in A$ let $C_a=\bigcap_{S\in T}[a]_S$, and let $C=\{C_a:a\in A\}$.
Clearly $C_a\subseteq[a]_S$ for each $S\in T$, so at this point you can conclude that $C\le S$ for each $S\in T$.
None of this requires the axiom of choice.