set g = AutComp E;
set f = (AutComp E) || (Auts (E,F));
I: dom (AutComp E) = [:(Auts E),(Auts E):] by FUNCT_2:def 1;
A: dom ((AutComp E) || (Auts (E,F))) = (dom (AutComp E)) /\ [:(Auts (E,F)),(Auts (E,F)):] by RELAT_1:61
.= [:(Auts (E,F)),(Auts (E,F)):] by I, XBOOLE_1:28, ZFMISC_1:96 ;
now :: thesis: for x being object st x in [:(Auts (E,F)),(Auts (E,F)):] holds
((AutComp E) || (Auts (E,F))) . x in Auts (E,F)
let x be object ; :: thesis: ( x in [:(Auts (E,F)),(Auts (E,F)):] implies ((AutComp E) || (Auts (E,F))) . x in Auts (E,F) )
assume AS: x in [:(Auts (E,F)),(Auts (E,F)):] ; :: thesis: ((AutComp E) || (Auts (E,F))) . x in Auts (E,F)
then consider x1, x2 being object such that
B: ( x1 in Auts (E,F) & x2 in Auts (E,F) & x = [x1,x2] ) by ZFMISC_1:def 2;
reconsider x1 = x1, x2 = x2 as Element of Auts (E,F) by B;
Auts (E,F) c= Auts E ;
then reconsider y1 = x1, y2 = x2 as Element of Auts E ;
((AutComp E) || (Auts (E,F))) . x = (AutComp E) . (y1,y2) by AS, B, FUNCT_1:49
.= x1 * x2 by defMult ;
hence ((AutComp E) || (Auts (E,F))) . x in Auts (E,F) ; :: thesis: verum
end;
hence (AutComp E) || (Auts (E,F)) is BinOp of (Auts (E,F)) by A, FUNCT_2:3; :: thesis: verum