let A, x be set ; :: thesis: ( x in 2 -tuples_on A iff ex a, b being set st
( a in A & b in A & x = <*a,b*> ) )

hereby :: thesis: ( ex a, b being set st
( a in A & b in A & x = <*a,b*> ) implies x in 2 -tuples_on A )

assume x in 2 -tuples_on A ; :: thesis: ex a, b being set st
( a in A & b in A & x = <*a,b*> )
then x in { s where s is Element of A * : len s = 2 } by FINSEQ_2:def 4;
then consider s being Element of A * such that
A1: ( x = s & len s = 2 ) ;
take a = s . 1; :: thesis: ex b being set st
( a in A & b in A & x = <*a,b*> )
take b = s . 2; :: thesis: ( a in A & b in A & x = <*a,b*> )
( x = <*a,b*> & rng <*a,b*> = {a,b} & a in {a,b} & b in {a,b} & rng s c= A ) by A1, FINSEQ_1:61, FINSEQ_2:147, TARSKI:def 2;
hence ( a in A & b in A & x = <*a,b*> ) by A1; :: thesis: verum

end;

given a, b being set such that A2: ( a in A & b in A & x = <*a,b*> ) ; :: thesis: x in 2 -tuples_on A
reconsider A = A as non empty set by A2;
reconsider a = a, b = b as Element of A by A2;
<*a,b*> is Element of 2 -tuples_on A by FINSEQ_2:121;
hence x in 2 -tuples_on A by A2; :: thesis: verum