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

theorem
  n satisfies_Sierpinski_problem_86 & n <= 32 implies n in {14,16,20,22,32}
  proof
    assume
A1: n satisfies_Sierpinski_problem_86;
    assume n <= 32;
    then n = 0 or ... or n = 32;
    hence thesis by A1,Th50,Lm16,Lm17,Lm18,Lm19,Lm20,Lm21,
    Lm22,Lm23,Lm24,Lm25,Lm26,Lm27,Lm28,Lm29,Lm30,
    Lm31,Lm32,Lm33,Lm34,Lm35,Lm36,Lm37,ENUMSET1:def 3;
  end;
