let Y be non empty set ; :: thesis: for G being Subset of (PARTITIONS Y)
for A, B, C, D being a_partition of Y st G = {A,B,C,D} & A <> D & B <> D & C <> D holds
CompF (D,G) = (A '/\' C) '/\' B
let G be Subset of (PARTITIONS Y); :: thesis: for A, B, C, D being a_partition of Y st G = {A,B,C,D} & A <> D & B <> D & C <> D holds
CompF (D,G) = (A '/\' C) '/\' B
let A, B, C, D be a_partition of Y; :: thesis: ( G = {A,B,C,D} & A <> D & B <> D & C <> D implies CompF (D,G) = (A '/\' C) '/\' B )
{A,B,C,D} = {D,A,C,B} by ENUMSET1:70;
hence ( G = {A,B,C,D} & A <> D & B <> D & C <> D implies CompF (D,G) = (A '/\' C) '/\' B ) by Th7; :: thesis: verum