let I be set ; :: thesis: for X, Z, Y being ManySortedSet of st X is finite-yielding & Z is finite-yielding & X c= [|Y,Z|] holds
ex A being ManySortedSet of st
( A is finite-yielding & A c= Y & X c= [|A,Z|] )
let X, Z, Y be ManySortedSet of ; :: thesis: ( X is finite-yielding & Z is finite-yielding & X c= [|Y,Z|] implies ex A being ManySortedSet of st
( A is finite-yielding & A c= Y & X c= [|A,Z|] ) )
assume that
A1:
X is finite-yielding
and
A2:
Z is finite-yielding
and
A3:
X c= [|Y,Z|]
; :: thesis: ex A being ManySortedSet of 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):] );
A4:
for i being set st i in I holds
ex j being set st S1[i,j]
proof
let i be
set ;
:: thesis: ( i in I implies ex j being set st S1[i,j] )
assume A5:
i in I
;
:: thesis: ex j being set st S1[i,j]
then A6:
X . i is
finite
by A1, LL1;
A7:
Z . i is
finite
by A2, A5, LL1;
X . i c= [|Y,Z|] . i
by A3, A5, PBOOLE:def 5;
then
X . i c= [:(Y . i),(Z . i):]
by A5, PBOOLE:def 21;
then consider A' being
set such that A8:
(
A' is
finite &
A' c= Y . i &
X . i c= [:A',(Z . i):] )
by A6, A7, FINSET_1:33;
take
A'
;
:: thesis: S1[i,A']
thus
S1[
i,
A']
by A8;
:: thesis: verum
end;
consider A being ManySortedSet of such that
A9:
for i being set st i in I holds
S1[i,A . i]
from PBOOLE:sch 3(A4);
take
A
; :: thesis: ( A is finite-yielding & A c= Y & X c= [|A,Z|] )
thus
A is finite-yielding
:: thesis: ( A c= Y & X c= [|A,Z|] )
thus
A c= Y
:: thesis: X c= [|A,Z|]
thus
X c= [|A,Z|]
:: thesis: verum