let F be Field; :: thesis: for E being FieldExtension of F
for T being non empty finite F -algebraic Subset of E
for f, g being F -fixing Automorphism of (FAdj (F,T)) st ( for a being Element of E st a in T holds
f . a = g . a ) holds
for p being Polynomial of (card T),F
for x being b2 -evaluating Function of (card T),E holds f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))

let E be FieldExtension of F; :: thesis: for T being non empty finite F -algebraic Subset of E
for f, g being F -fixing Automorphism of (FAdj (F,T)) st ( for a being Element of E st a in T holds
f . a = g . a ) holds
for p being Polynomial of (card T),F
for x being b1 -evaluating Function of (card T),E holds f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))

let T be non empty finite F -algebraic Subset of E; :: thesis: for f, g being F -fixing Automorphism of (FAdj (F,T)) st ( for a being Element of E st a in T holds
f . a = g . a ) holds
for p being Polynomial of (card T),F
for x being T -evaluating Function of (card T),E holds f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))

let f, g be F -fixing Automorphism of (FAdj (F,T)); :: thesis: ( ( for a being Element of E st a in T holds
f . a = g . a ) implies for p being Polynomial of (card T),F
for x being T -evaluating Function of (card T),E holds f . (Ext_eval (p,x)) = g . (Ext_eval (p,x)) )

assume AS: for a being Element of E st a in T holds
f . a = g . a ; :: thesis: for p being Polynomial of (card T),F
for x being T -evaluating Function of (card T),E holds f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))

let p1 be Polynomial of (card T),F; :: thesis: for x being T -evaluating Function of (card T),E holds f . (Ext_eval (p1,x)) = g . (Ext_eval (p1,x))
let x be T -evaluating Function of (card T),E; :: thesis: f . (Ext_eval (p1,x)) = g . (Ext_eval (p1,x))
set n = card T;
set K = FAdj (F,T);
defpred S1[ Nat] means for p being Polynomial of (card T),F st card (Support p) = $1 holds
f . (Ext_eval (p,x)) = g . (Ext_eval (p,x));
A: S1[ 0 ]
proof
let p be Polynomial of (card T),F; :: thesis: ( card (Support p) = 0 implies f . (Ext_eval (p,x)) = g . (Ext_eval (p,x)) )
assume card (Support p) = 0 ; :: thesis: f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))
then Support p = {} ;
then A1: p = 0_ ((card T),F) by FIELD_11:5;
hence f . (Ext_eval (p,x)) = f . (0. E) by FIELD_11:16
.= f . (0. (FAdj (F,T))) by FIELD_6:def 6
.= 0. (FAdj (F,T)) by RING_2:6
.= g . (0. (FAdj (F,T))) by RING_2:6
.= g . (0. E) by FIELD_6:def 6
.= g . (Ext_eval (p,x)) by A1, FIELD_11:16 ;
:: thesis: verum
end;
B: now :: thesis: for k being Nat st S1[k] holds
S1[k + 1]
let k be Nat; :: thesis: ( S1[k] implies S1[k + 1] )
assume A3: S1[k] ; :: thesis: S1[k + 1]
A0: F is Subring of E by FIELD_4:def 1;
now :: thesis: for p being Polynomial of (card T),F st card (Support p) = k + 1 holds
f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))
let p be Polynomial of (card T),F; :: thesis: ( card (Support p) = k + 1 implies f . (Ext_eval (p,x)) = g . (Ext_eval (p,x)) )
assume A4: card (Support p) = k + 1 ; :: thesis: f . (Ext_eval (p,x)) = g . (Ext_eval (p,x))
set sgp = SgmX ((BagOrder (card T)),(Support p));
set bg = (SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))));
A5: BagOrder (card T) linearly_orders Support p by POLYNOM2:18;
then SgmX ((BagOrder (card T)),(Support p)) <> {} by A4, PRE_POLY:def 2, RELAT_1:38;
then 1 <= len (SgmX ((BagOrder (card T)),(Support p))) by NAT_1:14;
then len (SgmX ((BagOrder (card T)),(Support p))) in Seg (len (SgmX ((BagOrder (card T)),(Support p)))) ;
then A6: len (SgmX ((BagOrder (card T)),(Support p))) in dom (SgmX ((BagOrder (card T)),(Support p))) by FINSEQ_1:def 3;
then (SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p)))) = (SgmX ((BagOrder (card T)),(Support p))) . (len (SgmX ((BagOrder (card T)),(Support p)))) by PARTFUN1:def 6;
then (SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p)))) in rng (SgmX ((BagOrder (card T)),(Support p))) by A6, FUNCT_1:def 3;
then A7: (SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p)))) in Support p by A5, PRE_POLY:def 2;
then A8: p . ((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))) <> 0. F by POLYNOM1:def 4;
set m = (0_ ((card T),F)) +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(p . ((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p)))))));
set p9 = p +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(0. F));
reconsider bg = (SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p)))) as bag of card T ;
dom p = Bags (card T) by FUNCT_2:def 1;
then A9: p +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(0. F)) = p +* (bg .--> (0. F)) by FUNCT_7:def 3;
reconsider p9 = p +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(0. F)) as Function of (Bags (card T)),F ;
for u being object st u in Support p9 holds
u in Support p
proof
let u be object ; :: thesis: ( u in Support p9 implies u in Support p )
assume A10: u in Support p9 ; :: thesis: u in Support p
then reconsider u = u as Element of Bags (card T) ;
reconsider u = u as bag of card T ;
then not u in dom (bg .--> (0. F)) by TARSKI:def 1;
then p . u = p9 . u by A9, FUNCT_4:11;
then p . u <> 0. F by A10, POLYNOM1:def 4;
hence u in Support p by POLYNOM1:def 4; :: thesis: verum
end;
then Support p9 c= Support p ;
then reconsider p9 = p9 as Polynomial of (card T),F by POLYNOM1:def 5;
A12: dom p = Bags (card T) by FUNCT_2:def 1;
A13: for u being object st u in Support p holds
u in (Support p9) \/ {bg}
proof
let u be object ; :: thesis: ( u in Support p implies u in (Support p9) \/ {bg} )
assume A14: u in Support p ; :: thesis: u in (Support p9) \/ {bg}
then reconsider u = u as Element of Bags (card T) ;
A15: p . u <> 0. F by A14, POLYNOM1:def 4;
end;
bg in dom (bg .--> (0. F)) by TARSKI:def 1;
then p9 . bg = (bg .--> (0. F)) . bg by A9, FUNCT_4:13;
then A16: p9 . bg = 0. F by FUNCOP_1:72;
then A17: not bg in Support p9 by POLYNOM1:def 4;
for u being object st u in (Support p9) \/ {bg} holds
u in Support p then Support p = (Support p9) \/ {bg} by A13, TARSKI:2;
then A21: k + 1 = (card (Support p9)) + 1 by A4, A17, CARD_2:41;
dom (0_ ((card T),F)) = Bags (card T) by FUNCT_2:def 1;
then A22: (0_ ((card T),F)) +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(p . ((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))))) = (0_ ((card T),F)) +* (bg .--> (p . bg)) by FUNCT_7:def 3;
reconsider m = (0_ ((card T),F)) +* (((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))),(p . ((SgmX ((BagOrder (card T)),(Support p))) /. (len (SgmX ((BagOrder (card T)),(Support p))))))) as Function of (Bags (card T)),F ;
A23: for u being object st u in Support m holds
u in {bg}
proof
let u be object ; :: thesis: ( u in Support m implies u in {bg} )
assume A24: u in Support m ; :: thesis: u in {bg}
then reconsider u = u as Element of Bags (card T) ;
A25: m . u <> 0. F by A24, POLYNOM1:def 4;
now :: thesis: not u <> bg
assume u <> bg ; :: thesis: contradiction
then not u in dom (bg .--> (p . bg)) by TARSKI:def 1;
then m . u = (0_ ((card T),F)) . u by A22, FUNCT_4:11;
hence contradiction by A25, POLYNOM1:22; :: thesis: verum
end;
hence u in {bg} by TARSKI:def 1; :: thesis: verum
end;
A27: for u being object st u in {bg} holds
u in Support m
proof
let u be object ; :: thesis: ( u in {bg} implies u in Support m )
bg in dom (bg .--> (p . bg)) by TARSKI:def 1;
then m . bg = (bg .--> (p . bg)) . bg by A22, FUNCT_4:13;
then A26: m . bg = p . bg by FUNCOP_1:72;
assume u in {bg} ; :: thesis: u in Support m
then u = bg by TARSKI:def 1;
hence u in Support m by A8, A26, POLYNOM1:def 4; :: thesis: verum
end;
then Support m = {bg} by A23, TARSKI:2;
then reconsider m = m as Polynomial of (card T),F by POLYNOM1:def 5;
A28: for u being object st u in Bags (card T) holds
(p9 + m) . u = p . u
proof
let u be object ; :: thesis: ( u in Bags (card T) implies (p9 + m) . u = p . u )
assume u in Bags (card T) ; :: thesis: (p9 + m) . u = p . u
then reconsider u = u as bag of card T ;
per cases ( u = bg or u <> bg ) ;
suppose A29: u = bg ; :: thesis: (p9 + m) . u = p . u
bg in dom (bg .--> (p . bg)) by TARSKI:def 1;
then m . bg = (bg .--> (p . bg)) . bg by A22, FUNCT_4:13;
then A30: m . bg = p . bg by FUNCOP_1:72;
u in dom (bg .--> (0. F)) by A29, TARSKI:def 1;
then A31: p9 . u = (bg .--> (0. F)) . bg by A9, A29, FUNCT_4:13;
(p9 + m) . u = (p9 . u) + (m . u) by POLYNOM1:15
.= (0. F) + (p . bg) by A29, A31, A30, FUNCOP_1:72
.= p . bg ;
hence (p9 + m) . u = p . u by A29; :: thesis: verum
end;
suppose A32: u <> bg ; :: thesis: (p9 + m) . u = p . u
then A33: not u in dom (bg .--> (0. F)) by TARSKI:def 1;
not u in dom (bg .--> (p . bg)) by A32, TARSKI:def 1;
then m . u = (0_ ((card T),F)) . u by A22, FUNCT_4:11;
then A34: m . u = 0. F by POLYNOM1:22;
(p9 + m) . u = (p9 . u) + (m . u) by POLYNOM1:15
.= p . u by A9, A33, A34, FUNCT_4:11 ;
hence (p9 + m) . u = p . u ; :: thesis: verum
end;
end;
end;
A35: f . (Ext_eval (m,x)) = g . (Ext_eval (m,x)) by AS, A23, A27, TARSKI:2, lemTH2b;
A38: the carrier of (FAdj (F,T)) = the carrier of (RAdj (F,T)) by FIELD_13:40
.= { (Ext_eval (p,x)) where p is Polynomial of (card T),F : verum } by FIELD_13:39 ;
Ext_eval (m,x) in { (Ext_eval (p,x)) where p is Polynomial of (card T),F : verum } ;
then reconsider a1 = Ext_eval (m,x) as Element of (FAdj (F,T)) by A38;
Ext_eval (p9,x) in { (Ext_eval (p,x)) where p is Polynomial of (card T),F : verum } ;
then reconsider a2 = Ext_eval (p9,x) as Element of (FAdj (F,T)) by A38;
Ext_eval (p,x) in { (Ext_eval (p,x)) where p is Polynomial of (card T),F : verum } ;
then reconsider a3 = Ext_eval (p,x) as Element of (FAdj (F,T)) by A38;
dom (p9 + m) = Bags (card T) by FUNCT_2:def 1;
then A37: Ext_eval (p,x) = Ext_eval ((m + p9),x) by A12, A28, FUNCT_1:2
.= (Ext_eval (m,x)) + (Ext_eval (p9,x)) by A0, FIELD_11:19 ;
FAdj (F,T) is Subring of E by FIELD_5:12;
then A36: a1 + a2 = a3 by A37, FIELD_6:15;
hence f . (Ext_eval (p,x)) = (f . a1) + (f . a2) by VECTSP_1:def 20
.= (g . a1) + (g . a2) by A3, A21, A35
.= g . (Ext_eval (p,x)) by A36, VECTSP_1:def 20 ;
:: thesis: verum
end;
hence S1[k + 1] ; :: thesis: verum
end;
I: for k being Nat holds S1[k] from NAT_1:sch 2(A, B);
ex k being Element of NAT st card (Support p1) = k ;
hence f . (Ext_eval (p1,x)) = g . (Ext_eval (p1,x)) by I; :: thesis: verum