reserve a, b, d1, d2, d3, d4 for Int-Location,
  A, B for Data-Location,
  f, f1, f2, f3 for FinSeq-Location,
  il, i1, i2 for Nat,
  L for Nat,
  I for Instruction of SCM+FSA,
  s,s1,s2 for State of SCM+FSA,
  T for InsType of the InstructionsF of SCM+FSA,
  k for Nat;
reserve J,K for Element of Segm 13,
  b,b1,c,c1 for Element of SCM-Data-Loc,
  f,f1 for Element of SCM+FSA-Data*-Loc;
reserve a, b, d1, d2, d3, d4 for Int-Location,
  A, B for Data-Location,
  f, f1,
  f2, f3 for FinSeq-Location;

theorem
  T = 9 implies JumpParts T = {{}}
proof
  assume
A1: T = 9;
  hereby
    let x be object;
    assume x in JumpParts T;
     then consider I being Instruction of SCM+FSA such that
A2:   x = JumpPart I and
A3:   InsCode I = T;
     consider a,b,f such that
A4:   I = b:=(f,a) by A1,A3,SCMFSA_2:38;
     x = {} by A2,A4;
    hence x in {{}} by TARSKI:def 1;
  end;
  set a = the Int-Location, f = the FinSeq-Location;
  let x be object;
  assume x in {{}};
   then x = {} by TARSKI:def 1;
   then
A5:  x = JumpPart(a:=(f,a));
    InsCode(a:=(f,a)) = 9;
  hence thesis by A5,A1;
end;
