I am not clear why the proof is so long. By induction, the first i elements are already smaller than the A[i], so it's essentially an unoptimised version of

for i: 0..n-1 A[i] = min(A[i:n])