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;
reserve S for State of SCM,
  s,s1 for State of SCM+FSA;

theorem Th50:
  for dl being FinSeq-Location holds dl <> IC SCM+FSA
proof
  let dl be FinSeq-Location;
 now assume NAT in INT \ NAT;
  then
A1: NAT in NAT \/ [:{0},NAT:] by NUMBERS:def 4,XBOOLE_0:def 5;
 per cases by A1,XBOOLE_0:def 3;
 suppose NAT in NAT;
 hence contradiction;
 end;
 suppose NAT in [:{0},NAT:];
 hence contradiction by FINSET_1:15;
 end;
 end;
 hence thesis by Def3,Th1;
end;
