theorem
for
Y being non
empty set for
G being
Subset of
(PARTITIONS Y) for
A,
B,
C,
D,
E being
a_partition of
Y for
z,
u being
Element of
Y st
G is
independent &
G = {A,B,C,D,E} &
A <> B &
A <> C &
A <> D &
A <> E &
B <> C &
B <> D &
B <> E &
C <> D &
C <> E &
D <> E &
EqClass (
z,
((C '/\' D) '/\' E))
= EqClass (
u,
((C '/\' D) '/\' E)) holds
EqClass (
u,
(CompF (A,G)))
meets EqClass (
z,
(CompF (B,G)))