let T be 1-sorted ; :: thesis: for S, V being non empty 1-sorted
for f being Function of T,S
for g being Function of S,V st rng f = [#] S & f is one-to-one & dom g = [#] S & rng g = [#] V & g is one-to-one holds
(g * f) " = (f " ) * (g " )
let S, V be non empty 1-sorted ; :: thesis: for f being Function of T,S
for g being Function of S,V st rng f = [#] S & f is one-to-one & dom g = [#] S & rng g = [#] V & g is one-to-one holds
(g * f) " = (f " ) * (g " )
let f be Function of T,S; :: thesis: for g being Function of S,V st rng f = [#] S & f is one-to-one & dom g = [#] S & rng g = [#] V & g is one-to-one holds
(g * f) " = (f " ) * (g " )
let g be Function of S,V; :: thesis: ( rng f = [#] S & f is one-to-one & dom g = [#] S & rng g = [#] V & g is one-to-one implies (g * f) " = (f " ) * (g " ) )
assume that
A1: rng f = [#] S and
A2: f is one-to-one ; :: thesis: ( not dom g = [#] S or not rng g = [#] V or not g is one-to-one or (g * f) " = (f " ) * (g " ) )
assume that
A3: dom g = [#] S and
A4: rng g = [#] V and
A5: g is one-to-one ; :: thesis: (g * f) " = (f " ) * (g " )
( rng (g * f) = [#] V & g * f is one-to-one ) by A1, A2, A3, A4, A5, FUNCT_1:46, RELAT_1:47;
then A6: (g * f) " = (g * f) " by Def4;
A7: f " = f " by A1, A2, Def4;
g " = g " by A4, A5, Def4;
hence (g * f) " = (f " ) * (g " ) by A2, A5, A7, A6, FUNCT_1:66; :: thesis: verum