reserve m for Nat;
reserve P for Instruction-Sequence of SCM+FSA;

theorem
  for a,b being Int-Location, f being FinSeq-Location holds
    f:=<0,...,0> b does not destroy a
proof
  let a,b be Int-Location;
  let f be FinSeq-Location;
  now
    let e be Int-Location;
    let h be FinSeq-Location;
A1: InsCode (f :=<0,...,0> b) = 12 by SCMFSA_2:29;
    hence a := e <> f :=<0,...,0> b by SCMFSA_2:18;
    thus AddTo(a,e) <> f :=<0,...,0> b by A1,SCMFSA_2:19;
    thus SubFrom(a,e) <> f :=<0,...,0> b by A1,SCMFSA_2:20;
    thus MultBy(a,e) <> f :=<0,...,0> b by A1,SCMFSA_2:21;
    thus Divide(a,e) <> f :=<0,...,0> b & Divide(e,a) <> f :=<0,...,0> b by A1,
SCMFSA_2:22;
    thus a :=(h,e) <> f :=<0,...,0> b by A1,SCMFSA_2:26;
    thus a :=len h <> f :=<0,...,0> b by A1,SCMFSA_2:28;
  end;
  hence thesis;
end;
