reserve p,p1,p2,q,r,F,G,G1,G2,H,H1,H2 for ZF-formula,
  x,x1,x2,y,y1,y2,z,z1,z2,s,t for Variable,
  a,X for set;
reserve M for non empty set,
  m,m9 for Element of M,
  v,v9 for Function of VAR,M;
reserve i,j for Element of NAT;

theorem Th135:
  x <> 0 & x <> 1 & x <> 2 & x <> 3 & x <> 4
proof
  x in VAR;
  then
A1: ex i st x = i & 5 <= i;
  assume x = 0 or x = 1 or x = 2 or x = 3 or x = 4;
  hence contradiction by A1;
end;
