let f be Function; ( f is one-to-one iff for g, h being Function st rng g c= dom f & rng h c= dom f & dom g = dom h & f * g = f * h holds
g = h )
thus
( f is one-to-one implies for g, h being Function st rng g c= dom f & rng h c= dom f & dom g = dom h & f * g = f * h holds
g = h )
( ( for g, h being Function st rng g c= dom f & rng h c= dom f & dom g = dom h & f * g = f * h holds
g = h ) implies f is one-to-one )
assume A7:
for g, h being Function st rng g c= dom f & rng h c= dom f & dom g = dom h & f * g = f * h holds
g = h
; f is one-to-one
for x1, x2 being object st x1 in dom f & x2 in dom f & f . x1 = f . x2 holds
x1 = x2
proof
let x1,
x2 be
object ;
( x1 in dom f & x2 in dom f & f . x1 = f . x2 implies x1 = x2 )
assume that A8:
x1 in dom f
and A9:
x2 in dom f
and A10:
f . x1 = f . x2
;
x1 = x2
deffunc H1(
object )
-> object =
x1;
consider g being
Function such that A11:
dom g = {{}}
and A12:
for
x being
object st
x in {{}} holds
g . x = H1(
x)
from FUNCT_1:sch 3();
A13:
{} in {{}}
by TARSKI:def 1;
then A14:
g . {} = x1
by A12;
then
rng g = {x1}
by A11, Th4;
then A15:
rng g c= dom f
by A8, ZFMISC_1:31;
then A16:
dom (f * g) = dom g
by RELAT_1:27;
deffunc H2(
object )
-> object =
x2;
consider h being
Function such that A17:
dom h = {{}}
and A18:
for
x being
object st
x in {{}} holds
h . x = H2(
x)
from FUNCT_1:sch 3();
A19:
h . {} = x2
by A18, A13;
then
rng h = {x2}
by A17, Th4;
then A20:
rng h c= dom f
by A9, ZFMISC_1:31;
then A21:
dom (f * h) = dom h
by RELAT_1:27;
for
x being
object st
x in dom (f * g) holds
(f * g) . x = (f * h) . x
proof
let x be
object ;
( x in dom (f * g) implies (f * g) . x = (f * h) . x )
assume A22:
x in dom (f * g)
;
(f * g) . x = (f * h) . x
then A23:
g . x = x1
by A11, A12, A16;
(
(f * g) . x = f . (g . x) &
(f * h) . x = f . (h . x) )
by A11, A17, A16, A21, A22, Th12;
hence
(f * g) . x = (f * h) . x
by A10, A11, A18, A16, A22, A23;
verum
end;
hence
x1 = x2
by A7, A11, A17, A14, A19, A15, A20, A16, A21, Th2;
verum
end;
hence
f is one-to-one
; verum