let P, Q be Relation; :: thesis: ( ( for x, y being object holds
( [x,y] in P iff ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) ) ) & ( for x, y being object holds
( [x,y] in Q iff ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) ) ) implies P = Q )

assume that
A4: for x, y being object holds
( [x,y] in P iff ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) ) and
A5: for x, y being object holds
( [x,y] in Q iff ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) ) ; :: thesis: P = Q
let x, y be object ; :: according to RELAT_1:def 2 :: thesis: ( ( not [x,y] in P or [x,y] in Q ) & ( not [x,y] in Q or [x,y] in P ) )
thus ( [x,y] in P implies [x,y] in Q ) :: thesis: ( not [x,y] in Q or [x,y] in P )
proof
assume [x,y] in P ; :: thesis: [x,y] in Q
then ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) by A4;
hence [x,y] in Q by A5; :: thesis: verum
end;
assume [x,y] in Q ; :: thesis: [x,y] in P
then ( x in D & ex f being FinSequence of D st
( y = f & <*x*> ^ f in A ) ) by A5;
hence [x,y] in P by A4; :: thesis: verum