reserve a,b,c,d,x,j,k,l,m,n,o,xi,xj for Nat,
  p,q,t,z,u,v for Integer,
  a1,b1,c1,d1 for Complex;

theorem Count0:
  for a be non trivial Nat, b be non zero Nat holds
    a|^(a |-count b) <= b
  proof
    let a be non trivial Nat, b be non zero Nat;
    a <> 1 by Def0; then
    a|^(a |-count b) divides b by NAT_3:def 7;
    hence thesis by NAT_D:7;
  end;
