reserve X for set;
reserve a,b,c,k,m,n for Nat;
reserve i,j for Integer;
reserve r for Real;
reserve p,p1,p2 for Prime;

theorem
  112 satisfies_Sierpinski_problem_87b
  proof
    5 = 2*2+1;
    then reconsider a = 5 as odd Prime by XPRIMES1:5;
    13 = 2*6+1;
    then reconsider b = 13 as odd Prime by XPRIMES1:13;
    193 = 2*96+1;
    then reconsider c = 193 as odd Prime by XPRIMES1:193;
    take a,b,c;
    thus thesis by Th57;
  end;
