per cases ( ( not A is empty & not B is empty ) or A is empty or B is empty ) ;
suppose ( not A is empty & not B is empty ) ; :: thesis: A ^^ B is finite
then reconsider A = A, B = B as non empty finite FinSequence-membered set ;
deffunc H1( Element of A, Element of B) -> set = A ^ B;
A1: A is finite ;
A2: B is finite ;
{ H1(u,v) where u is Element of A, v is Element of B : ( u in A & v in B ) } is finite from FRAENKEL:sch 22(A1, A2);
hence A ^^ B is finite ; :: thesis: verum
end;
suppose A is empty ; :: thesis: A ^^ B is finite
then ( A ^^ B c= B & B ^^ A c= B ) by Th106, Th107;
hence A ^^ B is finite ; :: thesis: verum
end;
suppose B is empty ; :: thesis: A ^^ B is finite
then ( A ^^ B c= A & B ^^ A c= A ) by Th106, Th107;
hence A ^^ B is finite ; :: thesis: verum
end;
end;