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

theorem
  114 satisfies_Sierpinski_problem_76a
  proof
    let x be Nat;
    assume 114 < x < 114+10;
    then 114 < x < 123+1;
    then 114+1 <= x <= 123 by NAT_1:13;
    then x = 115 or ... or x = 123;
    hence thesis by XPRIMES0:115,116,117,118,119,120,121,122,123;
  end;
