If A and B are two sets such that every element of A is in B and every element of B is in A, then
AA and B are necessarily disjoint
BA is a proper subset of B but A ≠ B
CA is a superset of B but A ≠ B
DA is equal to B (A = B)
Answer & Solution
Correct answer: D. A is equal to B (A = B)
Bidirectional inclusion (A ⊆ B and B ⊆ A) is the definition of set equality. Proper subset rules out equality, so options A and B are wrong; disjointness contradicts the inclusion.
Related questions
If A = {x : x is a letter in the word FOLLOW} and B = {y : y is a letter in the word WOLF}Set A is defined as {x : x is an integer, x² ≤ 4}. Which is the correct roster of A?Which of the following statements is INCORRECT?Let A = {n : n ∈ ℤ and n² ≤ 4} and B = {x : x ∈ ℝ and x² − 3x + 2 = 0}. ThenWhich of the following correctly distinguishes set X (letters of 'ALLOY') and set B (letteConsider C = {x : x − 5 = 0} and E = {x : x is an integral positive root of x² − 2x − 15 =The number n(S) of distinct elements of the set S formed by the letters of the word 'TRIGOThe set-builder form of the set {3, 6, 9, 12} can be written as