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
  for n being non zero Nat st n > 1 holds Euler_factorization n is non empty
  proof
    let n be non zero Nat;
    support Euler_factorization n c= dom Euler_factorization n by PRE_POLY:37;
    hence thesis by Th22;
  end;
