I know little bit basic algebraic number theory but do not major in it. This question might be trivial for the experts. I should be ashamed of my failure in proving it. If it is too easy, please devote me.
Let $p$ be a prime. Question is the proof of the following statement: For $n\in \mathbb{N}$. Let $a_{n}:=n'x_{n}$ where $n'$ and $v_{p}(n)$ is defined s.t. $n'p^{v_{p}(n)}=n$, $(n',p)=1$ and $x_{n}$ is defined s.t. $1=n'x_{n}+p^{v_{p}(n)}y_{n}$. Then $a_{n}\equiv a_{m} \pmod m$ for $m\mid n$ and $m\in\mathbb{N}$ and for any integer $a$, there exists $l$ s.t. $a_{l}\not\equiv a \pmod n$.
The author failed in dealing with the explicit expressions for $x_{n}$ and $y_{n}$ although there is an algorithm for that and he failed in working out another approach.
Background: This is one of the steps in a proof from Neukirch's Algebraic Number Theory. His aim is proving that, if $F$ is Frobenius element, then cyclic group $\langle F\rangle$ generated by $F$ is a subgroup of $\operatorname{Gal}(\overline{\mathbb{F}_{p}}/\mathbb{F}_{p}).$ If the statement in Question is valid, then $(F^{a_{i}})_{i}\nsubseteq \langle F\rangle$.