let X be set ; :: thesis: for S being cap-finite-partition-closed diff-c=-finite-partition-closed Subset-Family of X
for A being Element of S
for Q being finite Subset of S st union Q c= A & Q is a_partition of union Q holds
ex R being finite Subset of S st
( union R misses union Q & Q \/ R is a_partition of A )

let S be cap-finite-partition-closed diff-c=-finite-partition-closed Subset-Family of X; :: thesis: for A being Element of S
for Q being finite Subset of S st union Q c= A & Q is a_partition of union Q holds
ex R being finite Subset of S st
( union R misses union Q & Q \/ R is a_partition of A )

A1: for A, B being Element of S ex P being finite Subset of S st P is a_partition of A /\ B by Lem7;
A2: for C, D being Element of S st D c= C holds
ex P being finite Subset of S st P is a_partition of C \ D by Defdiff2;
let A be Element of S; :: thesis: for Q being finite Subset of S st union Q c= A & Q is a_partition of union Q holds
ex R being finite Subset of S st
( union R misses union Q & Q \/ R is a_partition of A )

let Q be finite Subset of S; :: thesis: ( union Q c= A & Q is a_partition of union Q implies ex R being finite Subset of S st
( union R misses union Q & Q \/ R is a_partition of A ) )

assume that
A3: union Q c= A and
A4: Q is a_partition of union Q ; :: thesis: ex R being finite Subset of S st
( union R misses union Q & Q \/ R is a_partition of A )

per cases ( S is empty or not S is empty ) ;
end;