let I, J be non empty set ; :: thesis: for F being multMagma-Family of J
for a being Function of I,J st a is bijective holds
( dom (trans_prod (F,a)) = [#] (product F) & rng (trans_prod (F,a)) = [#] (product (F * a)) )

let F be multMagma-Family of J; :: thesis: for a being Function of I,J st a is bijective holds
( dom (trans_prod (F,a)) = [#] (product F) & rng (trans_prod (F,a)) = [#] (product (F * a)) )

let a be Function of I,J; :: thesis: ( a is bijective implies ( dom (trans_prod (F,a)) = [#] (product F) & rng (trans_prod (F,a)) = [#] (product (F * a)) ) )
assume A1: a is bijective ; :: thesis: ( dom (trans_prod (F,a)) = [#] (product F) & rng (trans_prod (F,a)) = [#] (product (F * a)) )
set f = trans_prod (F,a);
for y being object st y in [#] (product (F * a)) holds
ex x being object st
( x in [#] (product F) & y = (trans_prod (F,a)) . x )
proof
let y be object ; :: thesis: ( y in [#] (product (F * a)) implies ex x being object st
( x in [#] (product F) & y = (trans_prod (F,a)) . x ) )

assume y in [#] (product (F * a)) ; :: thesis: ex x being object st
( x in [#] (product F) & y = (trans_prod (F,a)) . x )

then reconsider y = y as Element of (product (F * a)) ;
set x = y * (a ");
y * (a ") in product F by A1, Th3;
then reconsider x = y * (a ") as Element of (product F) ;
( dom x = J & dom y = I ) by GROUP_19:3;
then y = x * a by A1, Th4;
then y = (trans_prod (F,a)) . x by Def2;
hence ex x being object st
( x in [#] (product F) & y = (trans_prod (F,a)) . x ) ; :: thesis: verum
end;
hence ( dom (trans_prod (F,a)) = [#] (product F) & rng (trans_prod (F,a)) = [#] (product (F * a)) ) by FUNCT_2:10, FUNCT_2:def 1; :: thesis: verum