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

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