let F be Field; :: thesis: for E being FieldExtension of F
for T being non empty finite F -algebraic Subset of E st E == FAdj (F,T) holds
E == FAdj (F,(Roots (E,(ProductMinPolys T))))

let E be FieldExtension of F; :: thesis: for T being non empty finite F -algebraic Subset of E st E == FAdj (F,T) holds
E == FAdj (F,(Roots (E,(ProductMinPolys T))))

let T be non empty finite F -algebraic Subset of E; :: thesis: ( E == FAdj (F,T) implies E == FAdj (F,(Roots (E,(ProductMinPolys T)))) )
assume AS: E == FAdj (F,T) ; :: thesis: E == FAdj (F,(Roots (E,(ProductMinPolys T))))
set S = MinPolys T;
set f = canFS (MinPolys T);
set p = ProductMinPolys T;
now :: thesis: for o being object st o in T holds
o in Roots (E,(ProductMinPolys T))
let o be object ; :: thesis: ( o in T implies o in Roots (E,(ProductMinPolys T)) )
assume C0: o in T ; :: thesis: o in Roots (E,(ProductMinPolys T))
then reconsider a = o as F -algebraic Element of E ;
( MinPoly (a,F) in MinPolys T & rng (canFS (MinPolys T)) = MinPolys T ) by C0, FUNCT_2:def 3;
then consider i being object such that
C2: ( i in dom (canFS (MinPolys T)) & MinPoly (a,F) = (canFS (MinPolys T)) . i ) by FUNCT_1:def 3;
reconsider i = i as Element of dom (canFS (MinPolys T)) by C2;
Ext_eval ((MinPoly (a,F)),a) = 0. E by FIELD_6:52;
then Ext_eval ((ProductMinPolys T),a) = 0. E by C2, FIELD_13:4;
then a is_a_root_of ProductMinPolys T,E by FIELD_4:def 2;
then a in { a where a is Element of E : a is_a_root_of ProductMinPolys T,E } ;
hence o in Roots (E,(ProductMinPolys T)) by FIELD_4:def 4; :: thesis: verum
end;
then T c= Roots (E,(ProductMinPolys T)) ;
then FAdj (F,T) is Subfield of FAdj (F,(Roots (E,(ProductMinPolys T)))) by FIELD_7:10;
hence E == FAdj (F,(Roots (E,(ProductMinPolys T)))) by AS, EC_PF_1:5; :: thesis: verum