reserve x1,x2,z for set;
reserve A,B for non empty set;
reserve f,g,h for Element of Funcs(A,COMPLEX);

theorem Th1:
  h = (ComplexFuncAdd(A)).(f,g) iff for x being Element of A holds
  h.x = f.x + g.x
proof
A1: now
    assume
A2: for x being Element of A holds h.x=f.x + g.x;
    now
      let x be Element of A;
A3:   x in dom (addcomplex.:(f,g)) by Lm1;
      thus ((ComplexFuncAdd(A)).(f,g)).x = (addcomplex.:(f,g)).x by Def1
        .= addcomplex.(f.x,g.x) by A3,FUNCOP_1:22
        .= f.x + g.x by BINOP_2:def 3
        .= h.x by A2;
    end;
    hence h = (ComplexFuncAdd(A)).(f,g) by FUNCT_2:63;
  end;
  now
    assume
A4: h = (ComplexFuncAdd(A)).(f,g);
    let x be Element of A;
A5: x in dom (addcomplex.:(f,g)) by Lm1;
    thus h.x = (addcomplex.:(f,g)).x by A4,Def1
      .= addcomplex.(f.x,g.x) by A5,FUNCOP_1:22
      .= f.x + g.x by BINOP_2:def 3;
  end;
  hence thesis by A1;
end;
