set X = Morphs V;
defpred S₁[ Element of Morphs V, Element of Morphs V] means dom $1 = cod $2;
let c1, c2 be PartFunc of [:(Morphs V),(Morphs V):],(Morphs V); :: thesis: ( ( for g, f being Element of Morphs V holds
( [g,f] in dom c1 iff dom g = cod f ) ) & ( for g, f being Element of Morphs V st [g,f] in dom c1 holds
c1 . g,f = g * f ) & ( for g, f being Element of Morphs V holds
( [g,f] in dom c2 iff dom g = cod f ) ) & ( for g, f being Element of Morphs V st [g,f] in dom c2 holds
c2 . g,f = g * f ) implies c1 = c2 )
assume that
A3: for g, f being Element of Morphs V holds
( [g,f] in dom c1 iff S₁[g,f] ) and
A4: for g, f being Element of Morphs V st [g,f] in dom c1 holds
c1 . g,f = g * f and
A5: for g, f being Element of Morphs V holds
( [g,f] in dom c2 iff S₁[g,f] ) and
A6: for g, f being Element of Morphs V st [g,f] in dom c2 holds
c2 . g,f = g * f ; :: thesis: c1 = c2
set V0 = dom c1;

now

let x be set ; :: thesis: ( x in dom c1 implies x in dom c2 )
assume A7: x in dom c1 ; :: thesis: x in dom c2
then consider g, f being Element of Morphs V such that
A8: x = [g,f] by SUBSET_1:65;
S₁[g,f] by A3, A7, A8;
hence x in dom c2 by A5, A8; :: thesis: verum

end;

then A9: dom c1 c= dom c2 by TARSKI:def 3;
A10: for x, y being set st [x,y] in dom c1 holds
c1 . x,y = c2 . x,y

proof

let x, y be set ; :: thesis: ( [x,y] in dom c1 implies c1 . x,y = c2 . x,y )
assume A11: [x,y] in dom c1 ; :: thesis: c1 . x,y = c2 . x,y
then reconsider x = x, y = y as Element of Morphs V by ZFMISC_1:106;
c1 . x,y = x * y by A4, A11;
hence c1 . x,y = c2 . x,y by A6, A9, A11; :: thesis: verum

end;

now

let x be set ; :: thesis: ( x in dom c2 implies x in dom c1 )
assume A12: x in dom c2 ; :: thesis: x in dom c1
then consider g, f being Element of Morphs V such that
A13: x = [g,f] by SUBSET_1:65;
S₁[g,f] by A5, A12, A13;
hence x in dom c1 by A3, A13; :: thesis: verum

end;

then dom c2 c= dom c1 by TARSKI:def 3;
then dom c1 = dom c2 by A9, XBOOLE_0:def 10;
hence c1 = c2 by A10, BINOP_1:32; :: thesis: verum