
theorem GRCY330:
  for a,b be Integer, n be Nat holds a|^n mod b = (a mod b)|^n mod b
  proof
    let a,b be Integer, n be Nat;
    a mod b = (a mod b) mod b;
    hence thesis by INT_5:13;
  end;
