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 Th8:
  for I being Instruction of SCM+FSA st InsCode I <= 8 holds
  I is Instruction of SCM
proof
  let I be Instruction of SCM+FSA;
  assume
A1: InsCode I <= 8;
  now
    assume I in { [K,{},<*dC,fB*>] : K in {11,12} };
    then consider K,dC,fB such that
A2: I = [K,{},<*dC,fB*>] and
A3: K in {11,12};
A4: I`1_3 = K by A2;
    K = 12 or K = 11 by A3,TARSKI:def 2;
    hence contradiction by A1,A4;
  end;
  then
A5: I 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} }
       by XBOOLE_0:def 3;
  now
    assume I 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 L be Element of Segm 13,
    dA,dB be Element of SCM+FSA-Data-Loc,fA be Element of SCM+FSA-Data*-Loc
    such that
A6: I = [L,{},<*dB,fA,dA*>] and
A7: L in {9,10};
A8: I`1_3 = L by A6;
    L = 9 or L = 10 by A7,TARSKI:def 2;
    hence contradiction by A1,A8;
  end;
  hence thesis by A5,XBOOLE_0:def 3;
end;
