let X, Y be non empty set ; :: thesis: for f being Function of X,Y
for F being Function st rng F c= bool X holds
( dom ((.: f) * F) = dom F & ( for i being object st i in dom ((.: f) * F) holds
((.: f) * F) . i = f .: (F . i) ) )

let f be Function of X,Y; :: thesis: for F being Function st rng F c= bool X holds
( dom ((.: f) * F) = dom F & ( for i being object st i in dom ((.: f) * F) holds
((.: f) * F) . i = f .: (F . i) ) )

let F be Function; :: thesis: ( rng F c= bool X implies ( dom ((.: f) * F) = dom F & ( for i being object st i in dom ((.: f) * F) holds
((.: f) * F) . i = f .: (F . i) ) ) )

set G = (.: f) * F;
assume A1: rng F c= bool X ; :: thesis: ( dom ((.: f) * F) = dom F & ( for i being object st i in dom ((.: f) * F) holds
((.: f) * F) . i = f .: (F . i) ) )

then rng F c= dom (.: f) by FUNCT_2:def 1;
hence A2: dom ((.: f) * F) = dom F by RELAT_1:27; :: thesis: for i being object st i in dom ((.: f) * F) holds
((.: f) * F) . i = f .: (F . i)

let i be object ; :: thesis: ( i in dom ((.: f) * F) implies ((.: f) * F) . i = f .: (F . i) )
assume A3: i in dom ((.: f) * F) ; :: thesis: ((.: f) * F) . i = f .: (F . i)
then F . i in rng F by A2, FUNCT_1:def 3;
then F . i c= X by A1;
then A4: F . i c= dom f by FUNCT_2:def 1;
((.: f) * F) . i = (.: f) . (F . i) by A2, A3, FUNCT_1:13;
hence ((.: f) * F) . i = f .: (F . i) by FUNCT_3:def 1, A4; :: thesis: verum