(Predicate Logic) ∀x ∈ N(x > 1 → ∃k ∈ N∃m ∈ N(m ≡ 1(mod 2) ∧ x = 2^k⋅m))
Prove the statement $\forall x\in\mathbb N (x > 1\to\exists k\in\mathbb N\exists m \in\mathbb N (m \equiv 1 (\text{mod }2) \wedge x = 2^km))$.