reserve p for preProgram of SCM+FSA,
  ic for Instruction of SCM+FSA,
  i,j,k for Nat,
  fa,f for FinSeq-Location,
  a,b,da,db for Int-Location,
  la,lb for Nat;
reserve p1,p2,q for Instruction-Sequence of SCM+FSA;
reserve n for Nat;

theorem Th20:
  for p being Instruction-Sequence of SCM+FSA
  for s be State of SCM+FSA,I be Program of SCM+FSA,f be FinSeq-Location
  holds Result(p +* I,Initialized s).f = IExec(I,p,s).f
proof
  let p be Instruction-Sequence of SCM+FSA;
  let s be State of SCM+FSA,I be Program of SCM+FSA,f be FinSeq-Location;
  set D= Int-Locations \/ FinSeq-Locations;
  f in FinSeq-Locations by SCMFSA_2:def 5;
  then
A1: f in D by XBOOLE_0:def 3;
  hence Result(p +* I,Initialized s).f
     = (DataPart Result(p +* I,Initialized s)).f
       by FUNCT_1:49,SCMFSA_2:100
    .=(DataPart IExec(I,p,s)).f by SCMFSA8B:32
    .= IExec(I,p,s).f by A1,FUNCT_1:49,SCMFSA_2:100;
end;
