
theorem
  for n being set, b1,b2,b3 being bag of n holds lcm(b1,b3) divides lcm(
  b2,b3) implies b1 divides lcm(b2,b3)
proof
  let X be set, b1,b2,b3 be bag of X;
  assume
A1: lcm(b1,b3) divides lcm(b2,b3);
  for k being object st k in X holds b1.k <= lcm(b2,b3).k
  proof
    let k be object;
    assume k in X;
    lcm(b1,b3).k <= lcm(b2,b3).k by A1,PRE_POLY:def 11;
    then max(b1.k,b3.k) <= lcm(b2,b3).k by Def2;
    then
A2: max(b1.k,b3.k) <= max(b2.k,b3.k) by Def2;
    b1.k <= max(b1.k,b3.k) by XXREAL_0:25;
    then b1.k <= max(b2.k,b3.k) by A2,XXREAL_0:2;
    hence thesis by Def2;
  end;
  hence thesis by PRE_POLY:46;
end;
