Hi everyone,
In a proof I'm writing I inferred from, x is an element of D, and D is an element of A, that x is a subset of A.
There is something wrong here, right? What can I infer from knowing the first two statements?
Thank you!
Hi everyone,
In a proof I'm writing I inferred from, x is an element of D, and D is an element of A, that x is a subset of A.
There is something wrong here, right? What can I infer from knowing the first two statements?
Thank you!
You musn't confuse elements and subsets.
For example if D = {1,2,3}, and A is { {1,2,3}, {2,4}} (A consists of 2 elements {1,2,3} and {2,4} and D has 3 elements 1,2,3)
2 is an element of D, and D is an element of A, but 2 is not a subset of A.
Hi kripkey!
Suppose x={1}.
And suppose D={{1}, y}. It means that x is an element of D.
Then let A={{{1}, y}, 1}. We'd have that D is an element of A and also that x is a subset of A.
Erm... what's wrong? ;P
Thanks for the responses guys!
Not sure what an ultra-filter on a set is, so probably not! Now I'm curious
I was actually trying to somehow justify that if D = arbitrary union of G, then D is a subset of G.
So I guess I got a little lost on the way.
The definition of a subset from D is that it contains only elements that are also in D.
If you take the union of G with 1 or more other sets, the elements of G will also be in that union, so G will be a subset of that union.
If D is that union, it means that G is a subset of D and not the other way around.