reserve l, m, n for Nat,
  i,j,k for Instruction of SCM+FSA,
  I,J,K for Program of SCM+FSA;
reserve a,b for Int-Location,
  f for FinSeq-Location,
  s,s1,s2 for State of SCM+FSA;

theorem
  for I,J being MacroInstruction of SCM+FSA, n being Nat
   st n < LastLoc I holds (I ";" J).n = I.n
proof
  let I,J be MacroInstruction of SCM+FSA, l be Nat such that
A1: l < LastLoc I;
   LastLoc I in dom I by VALUED_1:30;
   then
A2: l in dom I by A1,AFINSQ_1:def 12;
  then I.l <> halt SCM+FSA by A1,COMPOS_1:def 15;
 hence thesis by A2,Th5;
end;
