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 Count4:
  for a be non trivial Nat, b be non zero Nat holds
    b < a|^n implies a |-count b < n
  proof
    let a be non trivial Nat, b be non zero Nat;
    assume b < a|^n; then
    1*a|^0 divides b & not a|^(0+n) divides b by INT_2:12, NAT_D:7;
    hence thesis by Count1;
  end;
