reserve R for Ring,
  r for Element of R,
  a, b, d1, d2 for Data-Location of R,
  il, i1, i2 for Nat,
  I for Instruction of SCM R,
  s,s1, s2 for State of SCM R,
  T for InsType of the InstructionsF of SCM R,
  k for Nat;

theorem Th33:
  JUMP (a=0_goto i1) = {i1}
proof
  set X = the set of all  NIC(a=0_goto i1, il) ;
  now
    let x be object;
A1: now
      let Y be set;
      assume Y in X;
      then ex il being Nat st Y = NIC(a=0_goto i1,il);
      hence i1 in Y by Th31;
    end;
    hereby
      reconsider il1 = 1, il2 = 2 as Element of NAT;
      assume
A2:   x in meet X;
A3:   NIC(a=0_goto i1, il2) c= {i1, il2 + 1} by Th31;
      NIC(a=0_goto i1, il2) in X;
      then x in NIC(a=0_goto i1, il2) by A2,SETFAM_1:def 1;
      then
A4:   x = i1 or x = il2 + 1 by A3,TARSKI:def 2;
A5:   NIC(a=0_goto i1, il1) c= {i1, il1 + 1} by Th31;
      NIC(a=0_goto i1, il1) in X;
      then x in NIC(a=0_goto i1, il1) by A2,SETFAM_1:def 1;
      then x = i1 or x = il1 + 1 by A5,TARSKI:def 2;
      hence x in {i1} by A4,TARSKI:def 1;
    end;
    assume x in {i1};
    then
A6: x = i1 by TARSKI:def 1;
    NIC(a=0_goto i1, i1) in X;
    hence x in meet X by A6,A1,SETFAM_1:def 1;
  end;
  hence thesis by TARSKI:2;
end;
