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 Th92:
  Data-Locations SCM+FSA = Int-Locations \/ FinSeq-Locations
proof
  now
    assume NAT in FinSeq-Locations;
    then
A1: NAT in NAT \/ [:{0},NAT:] \ {[0,0]} by NUMBERS:def 4;
    not NAT in NAT;
    then NAT in [:{0},NAT:] by A1,XBOOLE_0:def 3;
    then ex x,y being object st NAT = [x,y] by RELAT_1:def 1;
    hence contradiction;
  end;
  then FinSeq-Locations misses {NAT} by ZFMISC_1:50;
  then
A2: FinSeq-Locations \ ({NAT}) = FinSeq-Locations by XBOOLE_1:83;
  SCM-Data-Loc misses {NAT} by AMI_2:20,ZFMISC_1:50;
  then
A3: SCM-Data-Loc misses {NAT};
A4: SCM-Memory \ ({NAT})
     = SCM-Data-Loc \ ({NAT}) by XBOOLE_1:40
    .= Int-Locations by A3,XBOOLE_1:83;
  thus Data-Locations SCM+FSA
     = SCM-Memory \/ FinSeq-Locations \ ({NAT})
             by SCMFSA_1:5,SUBSET_1:def 8
    .= Int-Locations \/ FinSeq-Locations by A2,A4,XBOOLE_1:42;
end;
