reserve x,A for set, i,j,k,m,n, l, l1, l2 for Nat;
reserve D for non empty set, z for Nat;
reserve S for COM-Struct;
reserve ins for Element of the InstructionsF of S;
reserve k, m for Nat,
  x, x1, x2, x3, y, y1, y2, y3, X,Y,Z for set;
reserve i, j, k for Nat,
  n for Nat,
  l,il for Nat;
reserve
  i,j,k for Instruction of S,
  I,J,K for Program of S;
reserve k1,k2 for Integer;
reserve l,l1,loc for Nat;
reserve i1,i2 for Instruction of S;
reserve
  i,j,k for Instruction of S,
  I,J,K for Program of S;
reserve m for Nat;
reserve I,J for Program of S;
reserve i for Instruction of S,
        I for Program of S;
reserve loc for Nat;

theorem
  for S being COM-Struct, F, G being Program of S,
   n being Nat st n < LastLoc F
  holds F.n = (F ';' G).n
proof
  let S be COM-Struct, F, G be Program of S, f be Nat;
  assume f < LastLoc F;
  then f < card F - 1 by AFINSQ_1:91;
  hence thesis by Lm6;
end;
