We have the following indirect implication of form equivalence classes:

345 \(\Rightarrow\) 42
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
345 \(\Rightarrow\) 43 Topologie, Analyse Nonstandard et Axiome du Choix, Morillon, M. 1988, Universit\'e Blaise-Pascal
43 \(\Rightarrow\) 42 clear

Here are the links and statements of the form equivalence classes referenced above:

Howard-Rubin Number Statement
345:

Rasiowa-Sikorski Axiom:  If \((B,\land,\lor)\) is a Boolean algebra, \(a\) is a non-zero element of \(B\), and \(\{X_n: n\in\omega\}\) is a denumerable set of subsets of \(B\) then there is a maximal filter \(F\) of \(B\) such that \(a\in F\) and for each \(n\in\omega\), if \(X_n\subseteq F\) and \(\bigwedge X_n\) exists then \(\bigwedge X_n \in F\).

43:

\(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.

42:

Löwenheim-Skolem Theorem: If a countable family of first order  sentences is satisfiable in a set \(M\) then it is satisfiable in a countable subset of \(M\). (See Moore, G. [1982], p. 251 for references.

Comment:

Back