consider f being Function of (Auts ((FAdj (F,{a})),F)),(Roots ((FAdj (F,{a})),(MinPoly (a,F)))) such that
A: f is bijective by ThBij;
B: dom f = Auts ((FAdj (F,{a})),F) by FUNCT_2:def 1;
C: rng f = Roots ((FAdj (F,{a})),(MinPoly (a,F))) by A, FUNCT_2:def 3;
card (dom f) = card (rng f) by A, CARD_1:70;
hence Aut ((FAdj (F,{a})),F) is finite by B, C; :: thesis: verum