reserve m,n for Nat,
  I for Program of SCM+FSA,
  s,s1,s2 for State of SCM+FSA,
  a for Int-Location,
  f for FinSeq-Location,
  p,p1,p2 for Instruction-Sequence of SCM+FSA;

theorem Th44:
  for s being State of SCM+FSA, I being InitHalting really-closed Program of
  SCM+FSA, a being Int-Location st I does not destroy a
   holds IExec(I,p,s).a = (Initialized s).a
proof
  let s be State of SCM+FSA;
  let I be InitHalting really-closed Program of SCM+FSA;
  let a be Int-Location;
A1: Initialized s
        = s +* (Initialize ((intloc 0) .--> 1)+*(SA0))
       .= Initialized s+*SA0 by FUNCT_4:14;
  assume I does not destroy a;
  hence
  IExec(I,p,s).a = Comput(p +* I,
    Initialize Initialized s,0).a by Th43
    .= (Initialized s).a by A1;
end;
