\(RM1,\aleph_{\alpha }\): The representation theorem for multi-algebras with \(\aleph_{\alpha }\) unary operations:  Assume \((A,F)\) is  a  multi-algebra  with \(\aleph_{\alpha }\) unary operations (and no other operations). Then  there  is  an  algebra \((B,G)\)  with \(\aleph_{\alpha }\) unary operations and an equivalence relation \(E\) on \(B\) such that \((B/E,G/E)\) and \((A,F)\) are isomorphic multi-algebras.

\(DC(\omega)\) (DC), Principle of Dependent Choices: If \(S\)  is  a relation on a non-empty set \(A\) and \((\forall x\in A) (\exists y\in A)(x S y)\)  then there is a sequence \(a(0), a(1), a(2), \ldots\) of elements of \(A\) such that \((\forall n\in\omega)(a(n)\mathrel S a(n+1))\).  See Tarski [1948], p 96, Levy [1964], p. 136.

Every infinite branching poset (a partially ordered set in which each element has at least two lower bounds) has either an infinite chain or an infinite antichain.