reserve x,y for object, X for set;

theorem Th6:
  for f be FinSequence of NAT, b be bag of SetPrimes,a be Prime st
b is prime-factorization-like & Product b <> 1 & a divides Product b & Product
  b = Product f & f = b*canFS(support b) holds a in support b
proof
  let f be FinSequence of NAT, b be bag of SetPrimes, a be Prime;
  assume that
A1: b is prime-factorization-like and
A2: Product b <> 1 and
A3: a divides Product b and
A4: Product b = Product f and
A5: f = b*canFS(support b);
  len f is Element of NAT;
  hence thesis by A1,A2,A3,A4,A5,Lm6;
end;
