reserve l, m, n for Nat;
reserve a,b for Int-Location,
  f for FinSeq-Location,
  s,s1,s2 for State of SCM+FSA;
reserve L for finite Subset of Int-Locations;
reserve L for finite Subset of FinSeq-Locations;
reserve L for finite Subset of Int-Locations;

theorem
  for t be FinSequence of INT,f be FinSeq-Location
  holds dom Initialize((intloc 0) .--> 1) misses dom (f .--> t)
proof
  let t be FinSequence of INT,f be FinSeq-Location;
  set x = f .--> t;
  set DI=dom Initialize((intloc 0) .--> 1);
  assume DI /\ dom x <> {};
  then consider y being object such that
A2: y in DI /\ dom x by XBOOLE_0:def 1;
A3: y in DI by A2,XBOOLE_0:def 4;
  y in dom x by A2,XBOOLE_0:def 4;
  then
A4: y=f by TARSKI:def 1;
  y=intloc 0 or y=IC SCM+FSA by A3,Th11,TARSKI:def 2;
  hence contradiction by A4,SCMFSA_2:57,58;
end;
