Take
A an infinite
set of minimal indices. Then let
f(n)=e∈Amin{e>n}
map any natural
n to the smallest
index e>n in
A. By
Rogers' fixpoint theorem we can find a particular
index ε so that
φε=φf(ε)
Then
ε and
f(ε) encode the same
turing machine. And by definition of
f we know both that
f(ε)>ε and that
f(ε)∈A. But then
f(ε) is a non-minimal
index in
A, which is contradictory.