per cases ( T = {} or T <> {} ) ;
suppose A: T = {} ; :: thesis: MinPolys T is finite
now :: thesis: not MinPolys T <> {}
assume B: MinPolys T <> {} ; :: thesis: contradiction
set p = the Element of MinPolys T;
the Element of MinPolys T in MinPolys T by B;
then consider a being F -algebraic Element of E such that
C: ( the Element of MinPolys T = MinPoly (a,F) & a in T ) ;
thus contradiction by A, C; :: thesis: verum
end;
hence MinPolys T is finite ; :: thesis: verum
end;
suppose T <> {} ; :: thesis: MinPolys T is finite
then reconsider T1 = T as non empty finite F -algebraic Subset of E ;
set S = MinPolys T1;
defpred S1[ object , object ] means ex a being F -algebraic Element of E st
( a in T1 & F = a & E = MinPoly (a,F) );
A1: now :: thesis: for x being object st x in T holds
ex y being object st
( y in MinPolys T1 & S1[x,y] )
let x be object ; :: thesis: ( x in T implies ex y being object st
( y in MinPolys T1 & S1[x,y] ) )

assume A2: x in T ; :: thesis: ex y being object st
( y in MinPolys T1 & S1[x,y] )

then consider a being F -algebraic Element of E such that
A3: x = a ;
thus ex y being object st
( y in MinPolys T1 & S1[x,y] ) :: thesis: verum
proof
take y = MinPoly (a,F); :: thesis: ( y in MinPolys T1 & S1[x,y] )
thus y in MinPolys T1 by A2, A3; :: thesis: S1[x,y]
thus S1[x,y] by A2, A3; :: thesis: verum
end;
end;
consider h being Function of T,(MinPolys T1) such that
A2: for o being object st o in T holds
S1[o,h . o] from FUNCT_2:sch 1(A1);
A3: dom h = T by FUNCT_2:def 1;
now :: thesis: for o being object st o in MinPolys T1 holds
o in rng h
let o be object ; :: thesis: ( o in MinPolys T1 implies o in rng h )
assume o in MinPolys T1 ; :: thesis: o in rng h
then consider a being F -algebraic Element of E such that
A5: ( o = MinPoly (a,F) & a in T ) ;
S1[a,h . a] by A2, A5;
hence o in rng h by A3, A5, FUNCT_1:def 3; :: thesis: verum
end;
then MinPolys T1 c= rng h ;
hence MinPolys T is finite ; :: thesis: verum
end;
end;