If \(B\) is a Boolean algebra, \(S\subseteq B\) and \(S\) is closed under \(\land\), then there is a \(\subseteq\)-maximal proper ideal \(I\) of \(B\) such that \(I\cap S= \{0\}\).

Sikorski's  Extension Theorem: Every homomorphism of a subalgebra \(B\) of a Boolean algebra \(A\) into a complete Boolean algebra \(B'\) can be extended to a homomorphism of \(A\) into \(B'\). Sikorski [1964], p. 141.

BPI: Every Boolean algebra has a prime ideal.

Order Extension Principle: Every partial ordering can be extended to a linear ordering.  Tarski [1924], p 78.

Ordering Principle: Every set can be linearly ordered.

\(C(\infty,< \aleph_{0})\):  Every set of non-empty finite  sets  has  a choice function.

\((\forall n\in\omega, n\ge 2\))\((C(\infty,n))\): For each \(n\in\omega\), \(n\ge 2\), every set of \(n\) element  sets has a choice function.

  \(C(\infty ,2)\):  Every family of pairs has a choice function.

Let \(\Omega\) be the set of all (undirected) infinite cycles of reals (Graphs whose vertices are real numbers, connected, no loops and each vertex adjacent to  exactly two others). Then there is a function \(f\) on \(\Omega \) such that for all \(s\in\Omega\), \(f(s)\) is a direction along \(s\).