let F be Field; :: thesis: for E being FieldExtension of F
for f, g being Function of E,E
for a, b being Element of (Aut (E,F)) st f = a & g = b holds
f * g = a * b

let E be FieldExtension of F; :: thesis: for f, g being Function of E,E
for a, b being Element of (Aut (E,F)) st f = a & g = b holds
f * g = a * b

let f, g be Function of E,E; :: thesis: for a, b being Element of (Aut (E,F)) st f = a & g = b holds
f * g = a * b

let a, b be Element of (Aut (E,F)); :: thesis: ( f = a & g = b implies f * g = a * b )
assume A: ( f = a & g = b ) ; :: thesis: f * g = a * b
[a,b] in [:(Auts (E,F)),(Auts (E,F)):] by ZFMISC_1:def 2;
hence a * b = (AutComp E) . (f,g) by A, FUNCT_1:49
.= f * g by A, defMult ;
:: thesis: verum