reserve a,b,c,k,m,n for Nat;
reserve p for Prime;

theorem
  62 satisfies_Sierpinski_problem_76b
  proof
    let x be Nat;
    assume 10*62 < x < 10*(62+1);
    then 620 < x < 629+1;
    then 620+1 <= x <= 629 by NAT_1:13;
    then x = 621 or ... or x = 629;
    hence thesis by XPRIMES0:621,622,623,624,625,626,627,628,629;
  end;
