reserve i,i1,i2,i3,i4,i5,j,r,a,b,x,y for Integer,
  d,e,k,n for Nat,
  fp,fk for FinSequence of INT,
  f,f1,f2 for FinSequence of REAL,
  p for Prime;
reserve fr for FinSequence of REAL;
reserve fr,f for FinSequence of INT;
reserve b,m for Nat;
reserve b for Integer;

theorem
  Lege (1,p) = 1
proof
  1 < p by INT_2:def 4; then
  1 mod p <> 0 by NAT_D:14; then
  Lege (1^2,p) = 1 by Th26;
  hence thesis;
end;
