reserve J,J1,K for Element of Segm 13,
  b,b1,b2,c,c1,c2 for Element of SCM+FSA-Data-Loc,
  f,f1,f2 for Element of SCM+FSA-Data*-Loc;
reserve k for Nat,
  J,K,L for Element of Segm 13,
  O,P,R for Element of Segm 9;
reserve da for Int-Location,
  fa for FinSeq-Location,
  x,y for set;
reserve la,lb for Nat,
  La for Nat,
  i for Instruction of SCM+FSA,
  I for Instruction of SCM,
  l for Nat,
  LA,LB for Nat,
  dA,dB,dC,dD for Element of SCM+FSA-Data-Loc,
  DA,DB,DC for Element of SCM-Data-Loc,
  fA,fB,fC for Element of SCM+FSA-Data*-Loc,
  f,g for FinSeq-Location,
  A,B for Data-Location,
  a,b,c,db for Int-Location;

theorem Th34:
  for ins being Instruction of SCM+FSA st InsCode ins = 12 holds
  ex a,fa st ins = fa:=<0,...,0>a
proof
  let ins be Instruction of SCM+FSA such that
A1: InsCode ins = 12;
A2: now
    assume ins in { [L,{},<*dB,fA,dA*>] where L is Element of Segm 13,
    dA,dB is Element of SCM+FSA-Data-Loc,fA is Element of SCM+FSA-Data*-Loc:
    L in {9,10} };
    then consider K be Element of Segm 13,
    dA,dB be Element of SCM+FSA-Data-Loc,fA be Element of SCM+FSA-Data*-Loc
    such that
A3: ins = [K,{},<*dB,fA,dA*>] and
A4: K in {9,10};
    ins`1_3 = K by A3;
    hence contradiction by A1,A4,TARSKI:def 2;
  end;
A5: ins in SCM-Instr \/ { [L,{},<*dB,fA,dA*>] where L is Element of Segm 13,
    dA,dB is Element of SCM+FSA-Data-Loc,fA is Element of SCM+FSA-Data*-Loc :
    L in {9,10} } or
 ins in { [K,{},<*dC,fB*>] : K in {11,12} } by XBOOLE_0:def 3;
  not ins in SCM-Instr by A1,AMI_5:5;
  then consider K,dB,fA such that
A6: ins = [K,{},<*dB,fA*>] and
  K in {11,12} by A5,A2,XBOOLE_0:def 3;
  reconsider f=fA as FinSeq-Location by Def3;
  reconsider c = dB as Int-Location by AMI_2:def 16;
  take c,f;
  thus thesis by A1,A6;
end;
