Hello All,(adsbygoogle = window.adsbygoogle || []).push({});

I am trying to define a uniqueness of a member of a set, please bear with me as my notation is not as refined as it ought to be:

For a set X:

{ x(i) } union { f(x(j)) = true, where j is not equal to i } = { x(i) }

what I am trying to say is, for this set X there exists only one member whose evaluation with f() results in true.

I am defining this by saying that the union of any element with any other element other than itself in the set who's value is true is equal to the first element, however this doesn't quite work - I almost need a count() function on the right side and say that the count() is always = 1.

Is there a more correct elegant way to say this?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Membership Uniqueness?

Loading...

Similar Threads - Membership Uniqueness | Date |
---|---|

I Negating the uniqueness quantifier | Jan 25, 2018 |

A Defining the membership relation in set theory? | Sep 27, 2017 |

I Unique identifier problem | Jul 31, 2017 |

Measuring Membership, or Likelihood, of given Point | Aug 5, 2013 |

Membership chains | May 28, 2008 |

**Physics Forums - The Fusion of Science and Community**