reserve a, b, n for Nat,
  r for Real,
  f for FinSequence of REAL;
reserve p for Prime;

theorem Th26:
  b <> 1 & a <> 0 & b divides b |^ (b |-count a) implies b divides a
proof
  assume that
A1: b <> 1 & a <> 0 and
A2: b divides b |^ (b |-count a);
  b |^ (b |-count a) divides a by A1,Def7;
  hence thesis by A2,NAT_D:4;
end;
