 reserve n,k for Nat;
 reserve L for comRing;
 reserve R for domRing;
 reserve x0 for positive Real;

theorem Lm2:
  for n be Nat, f,g be Element of L st
    f divides g holds f divides n*g
  proof
    let n be Nat, f,g be Element of L;
    assume f divides g; then
    consider h be Element of L such that
A2: g = f*h by GCD_1:def 1;
    n in NAT by ORDINAL1:def 12; then
    n*g = f*(n*h) by A2,BINOM:19;
    hence thesis by GCD_1:def 1;
  end;
