I just have a very quick (and simple) question: When trying to prove equalities like [itex]A \cup (B \cup C) = (A \cup B) \cup C[/itex], is it sufficient to note that both sets consist of all elements [itex]x[/itex] such that [itex]x \in A[/itex], [itex]x \in B[/itex] or [itex]x \in C[/itex]? Or do I need to go through proving that each set is a subset of the other and consequently deduce that the two sets are equal?(adsbygoogle = window.adsbygoogle || []).push({});

I already know that the second procedure works and although the first one seems make intuitive sense, I'm concerned that it isn't considered sufficient or formal. I would appreciate any feedback. Thanks!

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

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

# Proofs . . .

Loading...

Similar Threads - Proofs | Date |
---|---|

I An easy proof of Gödel's first incompleteness theorem? | Mar 6, 2018 |

I Cantor's decimal proof that (0,1) is uncountable | Sep 27, 2017 |

A A "Proof Formula" for all maths or formal logic? | Apr 19, 2017 |

I Regarding Cantor's diagonal proof. | Feb 28, 2017 |

I Using symbolic logic in mathematical proof? | Jan 20, 2017 |

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