theorem
  n > k & A <> B implies (n|->A)^(k|->B) in DominatedElection(A,n,B,k)
proof
  assume that
A1: n >k and
A2: A<>B;
  k < n-0 by A1;
  then (n|->A)^(k|->B) is A,n,B,0+k-dominated-election by Th16,A2,Th15;
  hence thesis by Def3;
end;
