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;
