theorem Th31:
  i > n & i <> n*n+3*n+1 implies (findmin n).f.i=f.i
proof
  set k=Argmin(OuterVx(f,n),f,n), mi=n*n+3*n+1;
  assume
A1: i > n & i <> mi;
  (findmin n).f.i = ((f,mi):=(k,-jj)).i & k <= n by Def11,Th30;
  hence thesis by A1,Th18;
end;
