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

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