let X, Y be non empty set ; :: thesis: for f being Function of X,Y
for F being FinSequence st rng F c= bool X & f is one-to-one & F is disjoint_valued holds
(.: f) * F is disjoint_valued

let f be Function of X,Y; :: thesis: for F being FinSequence st rng F c= bool X & f is one-to-one & F is disjoint_valued holds
(.: f) * F is disjoint_valued

let F be FinSequence; :: thesis: ( rng F c= bool X & f is one-to-one & F is disjoint_valued implies (.: f) * F is disjoint_valued )
assume that
A1: rng F c= bool X and
A2: f is one-to-one and
A3: F is disjoint_valued ; :: thesis: (.: f) * F is disjoint_valued
set G = (.: f) * F;
for x, y being object st x <> y holds
((.: f) * F) . x misses ((.: f) * F) . y
proof
let i, j be object ; :: thesis: ( i <> j implies ((.: f) * F) . i misses ((.: f) * F) . j )
assume i <> j ; :: thesis: ((.: f) * F) . i misses ((.: f) * F) . j
then A4: F . i misses F . j by A3;
per cases ( not i in dom ((.: f) * F) or not j in dom ((.: f) * F) or ( i in dom ((.: f) * F) & j in dom ((.: f) * F) ) ) ;
suppose ( not i in dom ((.: f) * F) or not j in dom ((.: f) * F) ) ; :: thesis: ((.: f) * F) . i misses ((.: f) * F) . j
then ( ((.: f) * F) . i = {} or ((.: f) * F) . j = {} ) by FUNCT_1:def 2;
hence ((.: f) * F) . i misses ((.: f) * F) . j ; :: thesis: verum
end;
suppose ( i in dom ((.: f) * F) & j in dom ((.: f) * F) ) ; :: thesis: ((.: f) * F) . i misses ((.: f) * F) . j
then ( ((.: f) * F) . i = f .: (F . i) & ((.: f) * F) . j = f .: (F . j) ) by A1, Th5;
then (((.: f) * F) . i) /\ (((.: f) * F) . j) = f .: {} by A4, A2, FUNCT_1:62;
hence ((.: f) * F) . i misses ((.: f) * F) . j ; :: thesis: verum
end;
end;
end;
hence (.: f) * F is disjoint_valued ; :: thesis: verum