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

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