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

theorem
  for a,b,c being Int-Location, f being FinSeq-Location holds a <> b
  implies b := (f,c) does not destroy a
proof
  let a,b,c be Int-Location;
  let f be FinSeq-Location;
  assume
A1: a <> b;
  now
    let e be Int-Location;
    let l be Element of NAT;
    let h be FinSeq-Location;
A2: InsCode (b := (f,c)) = 9 by SCMFSA_2:26;
    hence a := e <> b := (f,c) by SCMFSA_2:18;
    thus AddTo(a,e) <> b := (f,c) by A2,SCMFSA_2:19;
    thus SubFrom(a,e) <> b := (f,c) by A2,SCMFSA_2:20;
    thus MultBy(a,e) <> b := (f,c) by A2,SCMFSA_2:21;
    thus Divide(a,e) <> b := (f,c) & Divide(e,a) <> b := (f,c) by A2,
SCMFSA_2:22;
    thus a := (h,e) <> b := (f,c) by A1,SF_MASTR:9;
    thus a :=len h <> b := (f,c) by A2,SCMFSA_2:28;
  end;
  hence thesis;
end;
