let I be set ; for X, Y, Z being ManySortedSet of I st X is finite-yielding & X c= [|Y,Z|] holds
ex A being ManySortedSet of I st
( A is finite-yielding & A c= Y & X c= [|A,Z|] )
let X, Y, Z be ManySortedSet of I; ( X is finite-yielding & X c= [|Y,Z|] implies ex A being ManySortedSet of I st
( A is finite-yielding & A c= Y & X c= [|A,Z|] ) )
assume that
A1:
X is finite-yielding
and
A2:
X c= [|Y,Z|]
; ex A being ManySortedSet of I st
( A is finite-yielding & A c= Y & X c= [|A,Z|] )
defpred S1[ set , set ] means ( $2 is finite & $2 c= Y . $1 & X . $1 c= [:$2,(Z . $1):] );
A3:
for i being set st i in I holds
ex j being set st S1[i,j]
proof
let i be
set ;
( i in I implies ex j being set st S1[i,j] )
assume A4:
i in I
;
ex j being set st S1[i,j]
then
X . i c= [|Y,Z|] . i
by A2, PBOOLE:def 2;
then A5:
X . i c= [:(Y . i),(Z . i):]
by A4, PBOOLE:def 16;
X . i is
finite
by A1, A4, Lm1;
then consider A9 being
set such that A6:
(
A9 is
finite &
A9 c= Y . i &
X . i c= [:A9,(Z . i):] )
by A5, FINSET_1:14;
take
A9
;
S1[i,A9]
thus
S1[
i,
A9]
by A6;
verum
end;
consider A being ManySortedSet of I such that
A7:
for i being set st i in I holds
S1[i,A . i]
from PBOOLE:sch 3(A3);
take
A
; ( A is finite-yielding & A c= Y & X c= [|A,Z|] )
thus
A is finite-yielding
( A c= Y & X c= [|A,Z|] )
thus
A c= Y
X c= [|A,Z|]
thus
X c= [|A,Z|]
verum