reserve x,A for set,
  i,j,k,m,n, l, l1, l2 for Nat;
reserve D for non empty set,
  z for Nat;

theorem Th1:
 for S be standard-ins non empty set
 for I,J being Element of S
  st InsCode I = InsCode J & JumpPart I = JumpPart J &
   AddressPart I = AddressPart J
 holds I = J
proof
 let  S be standard-ins non empty set;
 let I,J be Element of S;
  consider X being non empty set such that
A1:   S c= [:NAT,NAT*,X*:] by Def1;
A2: I in S;
  J in S;
 hence thesis by A2,A1,RECDEF_2:10;
end;
