let P be a_partition of Vertices G; :: thesis: ( P is empty implies P is Clique-wise )
assume P is empty ; :: thesis: P is Clique-wise
for x being set st x in P holds
G SubgraphInducedBy x is Clique of G ;
hence P is Clique-wise by LCliquewise; :: thesis: verum