reserve a,b,c,h for Integer;
reserve k,m,n for Nat;
reserve i,j,z for Integer;
reserve p for Prime;

theorem Th50:
  for n being non zero Nat st PrimeDivisorsFS(n) is empty holds n = 1
  proof
    let n be non zero Nat;
    rng PrimeDivisorsFS(n) = PrimeDivisors(n) by FINSEQ_1:def 14;
    hence thesis by Th49;
  end;
