
theorem Th49:
  for p being Prime, f being FinSequence of NAT st f = {} holds
  p |-count f = {}
proof
  let p be Prime;
  let f be FinSequence of NAT;
  assume f={};
  then len (p |-count f) = len {} by Def1;
  hence thesis;
end;
