let i, j be Nat; i * j = (i lcm j) * (i gcd j)
A1:
( i <> 0 & j <> 0 implies i * j = (i lcm j) * (i gcd j) )
proof
assume that A2:
i <> 0
and A3:
j <> 0
;
i * j = (i lcm j) * (i gcd j)
A4:
(
i divides i implies
i divides i * j )
by Th9;
(
j divides j implies
j divides j * i )
by Th9;
then
i lcm j divides i * j
by A4, Def4;
then consider c being
Nat such that A5:
i * j = (i lcm j) * c
by Def3;
A6:
i divides i lcm j
by Def4;
A7:
j divides i lcm j
by Def4;
consider d being
Nat such that A8:
i lcm j = i * d
by A6, Def3;
consider e being
Nat such that A9:
i lcm j = j * e
by A7, Def3;
i * j = i * (c * d)
by A5, A8;
then A10:
j = c * d
by A2, XCMPLX_1:5;
i * j = j * (c * e)
by A5, A9;
then
i = c * e
by A3, XCMPLX_1:5;
then A11:
c divides i
by Def3;
A12:
c divides j
by A10, Def3;
for
f being
Nat st
f divides i &
f divides j holds
f divides c
hence
i * j = (i lcm j) * (i gcd j)
by A5, A11, A12, Def5;
verum
end;
( ( i = 0 or j = 0 ) implies i * j = (i lcm j) * (i gcd j) )
hence
i * j = (i lcm j) * (i gcd j)
by A1; verum