For a given set, does there always exists a well-ordering of the set of all its subsets which is stronger than the usual ordering (that is set-theoretic inclusion) of the sets of the subsets of the given set?
Again (now with symbols instead of words): Let $U$ be a set. Does there necessarily exists a well ordering of $\mathscr{P} U$ which is stronger than $\subseteq$ order?
I expect that there is a counter-example but haven't found one yet.
We can assume axiom of choice.