reserve m for Nat;
reserve P,PP,P1,P2 for Instruction-Sequence of SCM+FSA;

theorem
  for a,b,c being Int-Location holds a <> b implies AddTo(c,b)
  does not refer a
proof
  let a,b,c be Int-Location;
  assume
A1: a <> b;
  now
    let e be Int-Location;
    let l be Nat;
    let f be FinSeq-Location;
A2: InsCode AddTo(c,b) = 2 by SCMFSA_2:19;
    hence e := a <> AddTo(c,b) by SCMFSA_2:18;
    thus AddTo(e,a) <> AddTo(c,b) by A1,SF_MASTR:2;
    thus SubFrom(e,a) <> AddTo(c,b) by A2,SCMFSA_2:20;
    thus MultBy(e,a) <> AddTo(c,b) by A2,SCMFSA_2:21;
    thus Divide(a,e) <> AddTo(c,b) & Divide(e,a) <> AddTo(c,b) by A2,
SCMFSA_2:22;
    thus a =0_goto l <> AddTo(c,b);
    thus a >0_goto l <> AddTo(c,b);
    thus e :=(f,a) <> AddTo(c,b) by A2,SCMFSA_2:26;
    thus (f,e):= a <> AddTo(c,b) & (f,a):= e <> AddTo(c,b) by A2,SCMFSA_2:27;
    thus f :=<0,...,0> a <> AddTo(c,b) by A2,SCMFSA_2:29;
  end;
  hence thesis;
end;
