
theorem
  for I be non empty set,
      F be Group-Family of I,
      x be Function,
      i be Element of I,
      g be Element of F.i
  holds support(x,F) is finite implies support(x+*(i,g),F) is finite
  proof
    let I be non empty set,
        F be Group-Family of I,
        x be Function,
        i be Element of I,
        g be Element of F.i;
    reconsider y = x +* (i,g) as Function;
    assume
    A1: support(x,F) is finite;
    for j be object holds
    j in support(y,F) implies j in support(x,F) \/ {i}
    proof
      let j be object;
      assume j in support(y,F); then
      A2: ex Z being Group st Z = F.j & y.j <> 1_Z & j in I by Def1;
      per cases;
      suppose
        j = i; then
        j in {i} by TARSKI:def 1;
        hence thesis by XBOOLE_0:def 3;
      end;
      suppose
        j <> i; then
        y.j = x.j by FUNCT_7:32; then
        j in support(x,F) by A2,Def1;
        hence thesis by XBOOLE_0:def 3;
      end;
    end; then
    support(y,F) c= support(x,F) \/ {i};
    hence thesis by A1;
  end;
