
theorem for a,b be Integer holds a,b are_congruent_mod a gcd b
  proof
    let a,b be Integer;
    (a gcd b) divides a & (a gcd b) divides b by INT_2:def 2;
    hence thesis by INT_5:1;
  end;
