reserve k,m,n for Nat,
  a, b, c for object,
  x, y, X, Y, Z for set,
  D for non empty set;
reserve p, q, r, s, t, u, v for FinSequence;
reserve P, Q, R, P1, P2, Q1, Q2, R1, R2 for FinSequence-membered set;
reserve S, T for non empty FinSequence-membered set;
reserve A for Function of P, NAT;
reserve U, V, W for Subset of P*;
reserve k,l,m,n,i,j for Nat,
  a, b, c for object,
  x, y, z, X, Y, Z for set,
  D, D1, D2 for non empty set;
reserve p, q, r, s, t, u, v for FinSequence;
reserve P, Q, R for FinSequence-membered set;
reserve B, C for antichain;
reserve S, T for Polish-language;
reserve A for Polish-arity-function of T;
reserve U, V, W for Polish-language of T;
reserve F, G for Polish-WFF of T, A;

theorem Th72:
  for Y, Z, D for p being FinSequence for f being Function of Y, D
        for g being Function of Z, D
      st rng p c= Y & rng p c= Z & for a st a in rng p holds f.a = g.a
    holds f * p = g * p
proof
  let Y, Z, D;
  let p be FinSequence;
  let f be Function of Y, D;
  let g be Function of Z, D;
  assume that
      A1: rng p c= Y and
      A2: rng p c= Z and
      A3: for a st a in rng p holds f.a = g.a;
  reconsider p1 = p as FinSequence of Y by A1, FINSEQ_1:def 4;
  reconsider q = f * p1 as FinSequence by FINSEQ_2:32;
  reconsider p2 = p as FinSequence of Z by A2, FINSEQ_1:def 4;
  reconsider r = g * p2 as FinSequence by FINSEQ_2:32;
  q = r
    proof
    thus len q = len p by FINSEQ_2:33
          .= len r by FINSEQ_2:33;
    let k;
    assume that
    A6: 1 <= k and
    A7: k <= len q;
    k <= len p by A7, FINSEQ_2:33;
    then k in Seg len p by A6, FINSEQ_1:1;
    then A8: k in dom p by FINSEQ_1:def 3;
    hence q.k = f.(p.k) by FUNCT_1:13
        .= g.(p.k) by A3, A8, FUNCT_1:3
        .= r.k by FUNCT_1:13, A8;
    end;
  hence thesis;
end;
