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

theorem Th52:
  for n being non zero Nat holds
  PrimeDivisorsFS(n) = sort_a canFS support ppf n
  proof
    let n be non zero Nat;
    PrimeDivisorsFS(n) = sort_a canFS support pfexp n by Th51;
    hence thesis by NAT_3:def 9;
  end;
