Suppose is a well orderable set, , , and let
be the closure of under . Define the sets by the recursion
, ,
and show that
I do not have any good ideas on how to prove this. It looks like this is true the way the sets are built up, but I do not see how to argue that. Thanks.