let it1, it2 be FinSequenceSet of the carrier' of G; :: thesis: ( ( for x being set holds
( x in it1 iff x is cyclic Path of G ) ) & ( for x being set holds
( x in it2 iff x is cyclic Path of G ) ) implies it1 = it2 )
assume that
A2: for x being set holds
( x in it1 iff x is cyclic Path of G ) and
A3: for x being set holds
( x in it2 iff x is cyclic Path of G ) ; :: thesis: it1 = it2

now :: thesis: for x being object holds
( x in it1 iff x in it2 )

let x be object ; :: thesis: ( x in it1 iff x in it2 )
( x in it1 iff x is cyclic Path of G ) by A2;
hence ( x in it1 iff x in it2 ) by A3; :: thesis: verum

end;

hence it1 = it2 by TARSKI:2; :: thesis: verum