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
Union ((.: f) * F) = f .: (Union F)

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

let F be Function; :: thesis: ( rng F c= bool X implies Union ((.: f) * F) = f .: (Union F) )
assume rng F c= bool X ; :: thesis: Union ((.: f) * F) = f .: (Union F)
then rng F c= bool (dom f) by FUNCT_2:def 1;
then f .: (union (rng F)) = union ((.: f) .: (rng F)) by FUNCT_3:14;
hence Union ((.: f) * F) = f .: (Union F) by RELAT_1:127; :: thesis: verum