- Thread starter
- #1

The question is: How do different set theories handle the following definition?

U := {x : (x belongs_to A) and ( Not(A is_included_in Powerset( EmptySet)) )}

If possible in the set theory, require (A is_set). But it doesn't really matter.

The set U is interesting for some reasons.