let a, b, c, d be set ; for f being Function st a in dom f & c in dom f & f . a = b & f . c = d holds
a,c --> b,d c= f
let f be Function; ( a in dom f & c in dom f & f . a = b & f . c = d implies a,c --> b,d c= f )
assume that
A1:
a in dom f
and
A2:
c in dom f
and
A3:
( f . a = b & f . c = d )
; a,c --> b,d c= f
per cases
( a <> c or a = c )
;
suppose A4:
a <> c
;
a,c --> b,d c= f
(
[a,b] in f &
[c,d] in f )
by A1, A2, A3, FUNCT_1:8;
then
{[a,b],[c,d]} c= f
by ZFMISC_1:38;
hence
a,
c --> b,
d c= f
by A4, Th71;
verum end; end;