We have the following indirect implication of form equivalence classes:

335-n \(\Rightarrow\) 315
given by the following sequence of implications, with a reference to its direct proof:

Implication Reference
335-n \(\Rightarrow\) 333 Bases for vector spaces over the two element field and the axiom of choice, Keremedis, K. 1996a, Proc. Amer. Math. Soc.
333 \(\Rightarrow\) 67 clear
67 \(\Rightarrow\) 89 On cardinals and their successors, Jech, T. 1966a, Bull. Acad. Polon. Sci. S'er. Sci. Math. Astronom. Phys.
89 \(\Rightarrow\) 90 The Axiom of Choice, Jech, 1973b, page 133
90 \(\Rightarrow\) 51 Variations of Zorn's lemma, principles of cofinality, and Hausdorff's maximal principle, Part I and II, Harper, J. 1976, Notre Dame J. Formal Logic
51 \(\Rightarrow\) 25 Choice and cofinal well-ordered subsets, Morris, D.B. 1969, Notices Amer. Math. Soc.
25 \(\Rightarrow\) 315 clear

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

Howard-Rubin Number Statement
335-n:

Every quotient group of an Abelian group each of whose elements has order  \(\le n\) has a set of representatives.

333:

\(MC(\infty,\infty,\mathrm{odd})\): For every set \(X\) of  sets such that for all \(x\in X\), \(|x|\ge 1\), there is a function \(f\) such that  for every \(x\in X\), \(f(x)\) is a finite, non-empty subset of \(x\) and \(|f(x)|\) is odd.

67:

\(MC(\infty,\infty)\) \((MC)\), The Axiom of Multiple Choice: For every set \(M\) of non-empty sets there is a function \(f\) such that \((\forall x\in M)(\emptyset\neq f(x)\subseteq x\) and \(f(x)\) is finite).

89:

Antichain Principle:  Every partially ordered set has a maximal antichain. Jech [1973b], p 133.

90:

\(LW\):  Every linearly ordered set can be well ordered. Jech [1973b], p 133.

51:

Cofinality Principle: Every linear ordering has a cofinal sub well ordering.  Sierpi\'nski [1918], p 117.

25:

\(\aleph _{\beta +1}\) is regular for all ordinals \(\beta\).

315:

\(\Omega = \omega_1\), where
\(\Omega = \{\alpha\in\hbox{ On}: (\forall\beta\le\alpha)(\beta=0 \vee (\exists\gamma)(\beta=\gamma+1) \vee\)
there is a sequence \(\langle\gamma_n: n\in\omega\rangle\) such that for each \(n\),
\(\gamma_n<\beta\hbox{ and } \beta=\bigcup_{n<\omega}\gamma_n.)\} \)

Comment:

Back