Question
Prove that if $A$ and $B$ are sets such that $A \cup B \neq \emptyset$, then $A \neq \emptyset$ or $B \neq \emptyset$.
Step 1
We need to prove that if the union of two sets \(A\) and \(B\) is not empty, then at least one of the sets \(A\) or \(B\) is not empty. Show more…
Show all steps
Your feedback will help us improve your experience
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let A, B be sets. Prove that A ∪ B = A if and only if B ⊆ A. Assume A ∪ B = A. We must show that B ⊆ A. Let x ∈ B. Then x ∈ A ∪ B. Since A ∪ B = A, we have x ∈ A. Therefore, B ⊆ A.
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD